Question 1 (Task Scheduling Suppose that we have n tasks to schedule on a computer with a single-core processor where task i takes t, time units to finish. We would like to run all of the n tasks while minimizing the total waiting time for all tasks. Assuming that the first task starts at t = 0, the waiting time wi for task i is the total time before it is started. For example, if we have three tasks with execution times t₁ = 5, t₂ = 3, and t3 = 2 scheduled to run in the order (C1, C2, C3), the waiting times are w1₁ = 0, W₂ = 5, and w3 = 5 + 3 = 8. If they are scheduled in the order (C3, C2, C₁), the waiting times become w3 = 0, W2 = 2, and w₁ = 2 + 3 = 5. Propose a greedy algorithm that finds the optimal scheduling for the n tasks with the minimum waiting time. Establish the running time of your algorithm. Prove the optimality of your algorithm.

Question 1 (Task Scheduling Suppose that we have n tasks to schedule on a computer with a single-core processor where task i takes t, time units to finish. We would like to run all of the n tasks while minimizing the total waiting time for all tasks. Assuming that the first task starts at t = 0, the waiting time wi for task i is the total time before it is started. For example, if we have three tasks with execution times t₁ = 5, t₂ = 3, and t3 = 2 scheduled to run in the order (C1, C2, C3), the waiting times are w1₁ = 0, W₂ = 5, and w3 = 5 + 3 = 8. If they are scheduled in the order (C3, C2, C₁), the waiting times become w3 = 0, W2 = 2, and w₁ = 2 + 3 = 5. Propose a greedy algorithm that finds the optimal scheduling for the n tasks with the minimum waiting time. Establish the running time of your algorithm. Prove the optimality of your algorithm.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: mple mapping of the 14 tasks of the LU

A: A graph is a very important data structure used across various solutions.

Q: Referring to the digraph above, schedule the tasks on two processors using the decreasing-time-list…

Q: Assume the following transection T1 and T2 executing in serial schedule. The Initial value of A=20…

A: Answer: In serial schedule a process performs all transaction exclusively. After completing the all…

Q: Consider a system using preemptive Shortest Job First algorithm. The systems is running tasks P1,…

A: In Preemptive SJF Scheduling, jobs are put into the ready queue as they come. A process with the…

Q: A periodic task-set as shown in the table is to be scheduled on a processor. The first release of…

A: Here is the solution:

Q: 1) A process p starts running at time 0, becomes blocked at time 2, and starts running again at time…

A: To calculate the attained CPU time for process p under short-term and long-term scheduling, we need…

Q: 3-22 A small manufacturing department contains three serial workstations (that is, parts go through…

A: The objective of the question is to identify the bottleneck in a manufacturing system with three…

Q: In this, the process that comes first will be executed first and next process starts on after the…

A: Find the answer given as below :

Q: P2 P3 CPU CPU 2s 4s In the above figure, assume P1, P2, and P3 arrive in order and at almost the…

A: We are given three processes P1, P2 and P3. They need CPU time of 3s, 4s and 2s respectively. Also…

Q: We have 4 periodical processes II₁, II, II and II, that process a video. We know their periods P;…

Question

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Introduction

VIEW

Step 2: Greedy algorithm that finds the optimal scheduling for the n tasks with the minimum waiting time.

VIEW

Step 3: Establish the running time of your algorithm.

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

Similar questions

CPU scheduler will decide which process should be given the CPU for its execution. For this it uses different algorithm to choose among the process. One among that algorithm is FCFS algorithm. In this algorithm the process which arrives first is given the CPU after finishing its request only it will allow the CPU to execute another process. Write a c program to implement the first come first serve CPU scheduling algorithm Sample output: Enter number of processes:3 Enter the burst times: Gantt chartPi 92 P3 Process Burst Time Waiting Time Turnaround Time 8 5 P1 P2 P3 0 13 Average Waiting Time is 7.000000 Average Turn around Time is 14.333333 8 22
Real-time Scheduling: Choose all true assertions. Rate Monotonic (RM) scheduling divides time into equal parts and requires each process to seek a portion upon starting. RM schedules real-time systems with CPU utilization below 1. When CPU utilization is less than 1, Earliest Deadline First (EDF) may schedule a real-time system. A process is initiated every p time unit. RM scheduling prioritizes shorter processes. EDF scheduling prioritizes processes with the shortest time frame.
For Question, put your answer in the following blanks. Note: You must put answer only, no need to put the unit. One answer per blank.
The principal disadvantage of mapping is the complex circuitry required to examine the tags of all cache lines in parallel. O No answer text provided. Set-associative O Fully-Associative O Direct
Consider the following processes schedule using RR Scheduling algorithm If the CPU scheduling policy is Round Robin with time quantum = 3 unit: Process Arrival time Burst Time P1 P2 P3 P4 P5 5 P6 4 3 1 2 5 6 6 7 9 2 Turn around time 3 Draw the ready queue, Gantt Chart for the schedule and find the TAT, WT, RT for each process then, find the Average waiting time, Response Time and the average turnaround time. Waiting Time Response Time
1. Design an efficient algorithm to solve the following scheduling problem. Provide a pseudo- code and a worst case complexity analysis for your algorithm. You are given a set of n jobs with a processing time t; and a weight w; for each job. You want to order the jobs so as to minimize the weighted some of the completion times, Žw,C, . i=1 Example: Suppose there are two jobs, the first takes time ti = 1 and has weight wi = 10, while the second takes time t2 = 3 and has weight w2 = 2. Then doing job 1 first would yield a weighted completion time of 10x1 + 2x4 = 18, while doing job 2 first yields the larger weighted completion time of 10x4 + 2x3 = 46.