Fixed-priority pre-emptive scheduling: Difference between revisions

Revision as of 18:54, 27 December 2024

Revision as of 16:52, 28 December 2024

Line 1:

{{unreferencedmore citations needed|date=FebruaryDecember 20202024}}

'''Fixed-priority preemptive scheduling''' is a [[Computer multitasking|scheduling system]] commonly used in [[real-time system]]s.<ref>{{Cite journal |last=Audsley |first=Neil C. |last2=Burns |first2=Alan |last3=Davis |first3=Robert I. |last4=Tindell |first4=Ken W. |last5=Wellings |first5=Andy J. |date=1995-03-01 |title=Fixed priority pre-emptive scheduling: An historical perspective |url=https://link.springer.com/article/10.1007/BF01094342 |journal=Real-Time Systems |language=en |volume=8 |issue=2 |pages=173–198 |doi=10.1007/BF01094342 |issn=1573-1383}}</ref> With fixed priority preemptive scheduling, the scheduler ensures that at any given time, the [[central processing unit|processor]] executes the highest priority [[task (computing)|task]] of all those tasks that are currently ready to execute.

Line 7:

<references />

{{Operating system}}

{{Comp-sci-stub}}

[[Category:Processor scheduling algorithms]]

{{Comp-sci-stub}}