13-06-2009, 06:09 PM
Least Slack Time ( LST )
scheduling is a scheduling algorithm. It assigns priority based on the slack time of a process. It is also known as Least Laxity First. Its most common use is in embedded systems, especially those with multiple processors. It imposes the simple constraint that each process on each available processor possesses the same run time, and that individual processes do not have an affinity to a certain processor. This is what lends it a suitability to embedded systems. Slack time This scheduling Slack time is defined as the temporal difference between the deadline, the ready time and the run time. More formally, the slack time for a process is defined as: where d is the process deadline, t is the real time since the cycle start, and is the remaining computation time. Thus, this algorithm tries to schedule each process as late as possible.
scheduling is a scheduling algorithm. It assigns priority based on the slack time of a process. It is also known as Least Laxity First. Its most common use is in embedded systems, especially those with multiple processors. It imposes the simple constraint that each process on each available processor possesses the same run time, and that individual processes do not have an affinity to a certain processor. This is what lends it a suitability to embedded systems. Slack time This scheduling Slack time is defined as the temporal difference between the deadline, the ready time and the run time. More formally, the slack time for a process is defined as: where d is the process deadline, t is the real time since the cycle start, and is the remaining computation time. Thus, this algorithm tries to schedule each process as late as possible.