Skip to Main content Skip to Navigation
Conference papers

LRE-TL: An Optimal Multiprocessor Scheduling Algorithm for Sporadic Task Sets

Abstract : This paper introduces LRE-TL, a scheduling algorithm based on LLREF, and demonstrates its flexibility and improved running time. Unlike LLREF, LRE-TL is optimal for sporadic task sets. While most LLREF events take O(n) time to run, the corresponding LRETL events take O(log n) time. LRE-TL also reduces the number of task preemptions and migrations by a factor of n. Both identical and uniform multiprocessors are considered.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00442002
Contributor : Alain Monteil <>
Submitted on : Thursday, December 17, 2009 - 6:10:26 PM
Last modification on : Thursday, February 7, 2019 - 4:49:43 PM
Long-term archiving on: : Thursday, June 17, 2010 - 11:51:33 PM

File

MultiprocessorScheduling_Funk....
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00442002, version 1

Collections

Citation

Shelby Funk, Vijaykant Nanadur. LRE-TL: An Optimal Multiprocessor Scheduling Algorithm for Sporadic Task Sets. 17th International Conference on Real-Time and Network Systems, Oct 2009, Paris, France. pp.159-168. ⟨inria-00442002⟩

Share

Metrics

Record views

249

Files downloads

825