1. List Processing (SOL: DM.10)
Homework (day 31):
Worksheet day 31

2. 1. Follow the order given to you.
List Processing
1. Follow the order given to you.
2. A task is independent as long as there are no arrows.
3. A task is dependent if there are arrows (which says that the task before it must be completed first.)
Note: The more the machine runs the more efficient it is.
FAU

3. The Algorithm works as follows: At any given time, assign the lowest- numbered free processor the first take on the priority list that is ready at that time and that has not already been assigned to a processor. that time and that has not already been assigned to a processor.

4. Critical Path Algorithm
A critical path is the path with the longest processing tie from start to finish.
Critical time is the total processing time for the critical path.