Least slack time scheduling
id:
least-slack-time-scheduling-198-12688132
title:
Least slack time scheduling
text:
Least slack time (LST) scheduling is an algorithm for dynamic priority scheduling. It assigns priorities to processes based on their slack time. 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
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Least_slack_time_scheduling
date created:
date modified:
2023-05-30T12:04:09Z
main entity:
{"identifier":"Q1810747","url":"https://www.wikidata.org/entity/Q1810747"}
image:
fields total:
13
integrity:
13