List scheduling
From Wikipedia, the free encyclopedia
The basic idea of list scheduling is to make an ordered list of processes by assigning them some priorities, and then repeatedly execute the following two steps until a valid schedule is obtained :
- Select from the list, the process with the highest priority for scheduling.
- Select a resource to accommodate this process.
The priorities are determined statically before scheduling process begins. The first step choose the process with highest priority, the second step select the best possible resource. Some known list scheduling strategies are :
- Highest Level First algorithm or HLF
- Longest Path algorithm or LP
- Longest Processing Time
- Critical Path
