1. Planning and Scheduling

2.  A job can be made up of a number of smaller tasks that can be completed by a number of different “processors.”  The processors can be machines, robots, humans, or a combination of any of these, depending on the job.  Each task is associated with an amount of time that is required to complete the tasks.  In addition, some tasks will need to be complete before others.  The problem is scheduling: which processor should work on which job at which time?

3.  To simplify the problem, we will make some assumptions.  If a processor starts a task, it will work on that task until the task is complete.  No processor will be voluntarily idle: if there is a processor free and a task ready, that processor will immediately begin work on that task.  There is an order-requirement graph that indicates which tasks must be completed before others.  The tasks are arranged in a priority list that is independent of the order requirements. The priority list indicates which tasks are “most important” and is used to break ties when multiple tasks are ready at a given time.

4.  Usually, the goal of the scheduling problem is to schedule the processors so that all tasks are complete as early as possible.  However, sometimes we will be interested in minimizing idle time, or minimizing the number of processors needed to finish all tasks by a given deadline.

5.  Consider the order-requirement graph shown below. There are 8 tasks to be completed.  Suppose there are 2 processors, and the priority list is T 8, T 7, T 6, …, T 1, so that T 8 is the most important task, and T 1 is the least important. 57 86 53 94 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4

6.  The job starts at time 0. There are two processors, and both are available. Processor 1 gets to choose first, but it needs to choose a ready task.  Tasks 1, 7, and 8 are ready, since they have no prerequisites. The other tasks are not ready since their prerequisites have not been completed. 57 86 53 94 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4

7.  Which of the three ready tasks should Processor 1 work on? Task 8 comes first on the priority list, so it is the most important. Processor 1 chooses Task 8.  Processor 2 is also available at time 0. Task 8 has already been chosen, so Processor 2 chooses the ready task with the highest priority: Task 7. 57 86 53 94 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4

8.  In order to keep track of which tasks have been completed at any given time, we draw a timeline.  Whenever a processor performs a task, we draw a box labeled with the task name on that processor’s line.  The left side of the box is lined up with the start time on the timeline, and the right side is lined up with the end time. 0 Processor 1 Processor 2

9. 75  Processor 1 works on Task 8 from time 0 to time 7.  Processor 2 works on Task 7 from time 0 to time 5.  In our diagrams, red tasks are being worked on, grey tasks are complete, and green tasks have not yet begun. 86 53 94 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 05 7 Processor 1 Processor 2 Task 8 Task 7

10. 8 7  At time 5, Processor 2 is available. The only ready task is Task 1. 6 53 94 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 05 7 13 Processor 1 Processor 2 Task 8 Task 7Task 1 5

11. 8 75  At time 7, Processor 1 becomes available. However, there is no ready task! Task 2 is not ready because task 1 must be complete before Task 2 can begin. 6 53 94 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 05713 Processor 1 Processor 2 Task 8 Task 7Task 1

12. 68 75  At time 13, both processors are available, and Task 2 is ready. Processor 1 gets to choose first, and works on Task 2. However, there is no other remaining task for Processor 2. 53 94 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 0571319 Processor 1 Processor 2 Task 8 Task 7Task 1 Task 2

13. 5 9 68 75  At time 19, Task 2 is complete, and both processors are available. Tasks 3 and 5 are ready, and Processor 1 gets first pick. Since Task 5 is more important, Processor 1 chooses it. Processor 2 works on Task 3. 3 4 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 3 0571319 Processor 1 Processor 2 Task 8 Task 7Task 1 Task 2 28

14. 3 9 5 68 75  At time 24, Processor 1 completes Task 5. Task 6 is the only ready task, so Processor 1 begins work on it. 4 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 5 Task 6 Task 3 0571319 Processor 1 Processor 2 Task 8 Task 7Task 1 Task 2 28 24 27

15. 3 9 5 68 75  At time 27, Processor 1 completes Task 6. Since Task 3 still is not complete, Task 4 is not ready, so Processor 1 must be idle. 4 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 5 Task 6 Task 3 0571319 Processor 1 Processor 2 Task 8 Task 7Task 1 Task 2 28 24 27

16. 49 35 68 75  At time 28, Processor 2 completes Task 3, and both processors are available.  Processor 1 gets to choose first, and chooses the only task remaining: Task 4. Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 5 Task 6 Task 3 0571319 Processor 1 Processor 2 Task 8 Task 7Task 1 Task 2 28 24 27 32

17. 49 35 68 75  At time 32, all tasks are complete! Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 5 Task 6 Task 3 0571319 Processor 1 Processor 2 Task 8 Task 7Task 1 Task 2 28 24 27 32

18.  You may have noticed that our solution had a lot of idle time. Since we were following the priority list, we were forced to complete the tasks in that order.  However, watch what happens when we use a different priority list: T 1, T 2, T 3, …, T 8.

19. 7 8 5 6 53 94 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 058 Processor 1 Processor 2 Task 1 Task 7

20. 75 86 53 94 Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 8 058 Processor 1 Processor 2 Task 1 Task 7 12

21. 68 75 53 94 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 2 Task 8 058 Processor 1 Processor 2 Task 1 Task 7 1214

22. 7 68 5 53 94 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 2 Task 8 058 Processor 1 Processor 2 Task 1 Task 7 1214

23. 9 5 6 7 8 5 3 4 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 3 Task 5 Task 2 Task 8 058 Processor 1 Processor 2 Task 1 Task 7 12141923

24. 5 9 6 7 8 5 3 4 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 6 Task 3 Task 5 Task 2 Task 8 058 Processor 1 Processor 2 Task 1 Task 7 121419 2322

25. 35 9 6 7 8 5 4 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 6 Task 3 Task 5 Task 2 Task 8 058 Processor 1 Processor 2 Task 1 Task 7 121419 2322

26. 49 35 6 7 8 5 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 6 Task 3 Task 5 Task 2 Task 8 058 Processor 1 Processor 2 Task 1 Task 7 121419 2322 27

27. 49 35 6 7 8 5 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4 Task 6 Task 3 Task 5 Task 2 Task 8 058 Processor 1 Processor 2 Task 1 Task 7 121419 2322 27

28.  This method for assigning tasks is known as the list- processing algorithm. The basic rule for the algorithm is: ◦ At any given time, assign to a processor the first task on the priority list that is ready.

29. 4 86 9  Note that the critical path (indicated in red on the diagram) has a total length of 27 time units. This means that all eight tasks could not have been completed in less than 27 time units, no matter how many processors we use. 57 53 Task 7Task 8 Task 1 Task 2 Task 5Task 6 Task 3Task 4