Least Slack Time
1. Least slack time schedulingLeast 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.
Read “Least slack time scheduling” on English Wikipedia
Read “Least Slack Time” on Japanese Wikipedia
Read “Least slack time scheduling” on DBpedia
Read “Least slack time scheduling” on English Wikipedia
Read “Least Slack Time” on Japanese Wikipedia
Read “Least slack time scheduling” on DBpedia
Discussions
Log in to talk about this word.