Least slack time scheduling
From Wikipedia, the free encyclopedia
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.
[edit] Slack time
This scheduling algorithm first selects those processes that have the smallest "slack time". 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:
(d − t) − c'
where d is the process deadline, t is the real time since the cycle start, and c' is the remaining computation time. Thus, this algorithm tries to schedule each process as late as possible.
[edit] Suitability
LST scheduling is most useful in systems comprising mainly aperiodic tasks, because no prior assumptions are made on the events' rate of occurrence. The main weakness of LST is that it does not look ahead, and works only on the current system state. Thus, during a brief overload of system resources, LST can be sub-optimal. It will also be suboptimal when used with uninterruptible processes. However, like earliest deadline first, and unlike rate monotonic scheduling, this algorithm can be used for processor utilization up to 100%.
