Least Slack Time Scheduling
Least Slack Time (LST) scheduling is a scheduling algorithm. It assigns priority based on the slack time of a process. Slack time is the amount of time left after a job if the job was started now. This algorithm 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.
Read more about Least Slack Time Scheduling: Slack Time, Suitability
Famous quotes containing the words slack and/or time:
“In marriage, a man becomes slack and selfish, and undergoes a fatty degeneration of his moral being.”
—Robert Louis Stevenson (1850–1894)
“And so, standing before the aforesaid officiator, the two swore that at every other time of their lives till death took them, they would assuredly believe, feel, and desire precisely as they had believed, felt, and desired during the few preceding weeks. What was as remarkable as the undertaking itself was the fact that nobody seemed at all surprised at what they swore.”
—Thomas Hardy (1840–1928)