Time algorithm.
- Using the priority list T2, T4, T6, T8, T10, T1, T3, T5, T7, T9 schedule the project with two processors.
Solution
Here is the list processing algorithm:
Assign the first available task to the first available processor.
When a processor is available we set it up to work on the first job in the ready-made priority list. Ready means all the tasks that have to be completed before we begin this task.
For priority list T2, T4, T6, T8, T10, T1, T3, T5, T7, T9.
| Processor 1 | T1 | T3 | T2 | T5 | T7 | T4 |
| Processor 2 | T6 | T9 | T10 | T8 |
- Use the decreasing time algorithm to create a priority list for the digraph from#5, and schedule with three processors.
Solution
The critical path list is the priority list obtained in decreasing order of critical times by writing the tasks. The critical path algorithm (CPA) is to calculate the schedule using the critical path list. We compute the critical path list by working from the End backward.
| Processor 1 | T1 | T2 | T5 | T4 | T8 |
| Processor 2 | T6 | T10 | T3 | ||
| Processor 3 | T10 | T7 |
Work cited.
Zeng, Xianlin, Peng Yi, and Yiguang Hong. “Distributed continuous-time algorithm for constrained convex optimizations via nonsmooth analysis approach.” IEEE Transactions on Automatic Control 62.10 (2016): 5227-5233.
Garg, Ankit, et al. “A deterministic polynomial time algorithm for non-commutative rational identity testing.” 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2016.