A new representation for the scheduling problem and its applications

Matthieu Lemerre Vincent David 1 Christophe Aussagues 1 Guy Vidal-Naquet 2
1 LIST - Laboratoire d'Intégration des Systèmes et des Technologies
2 SUPELEC-Campus Gif
Abstract : We present a new representation for the scheduling problem that allows a significant simplification for its solution, especially for the multiprocessor case. We use this representation to solve in an efficient way the periodic scheduling problem on uniform multiprocessors, which has been open for a long time. We also derive optimal multiprocessor schedulers for several other important cases, such as finite job sets and the task systems for OASIS.
Document type :
Conference papers
Complete list of metadatas
https://hal-supelec.archives-ouvertes.fr/hal-00258276
Contributor : Evelyne Faivre <>
Submitted on : Thursday, February 21, 2008 - 3:08:18 PM
Last modification on : Wednesday, January 23, 2019 - 2:38:28 PM

Identifiers

  • HAL Id : hal-00258276, version 1

Collections

CEA | SUPELEC | DRT | LIST

Citation

Matthieu Lemerre, Vincent David, Christophe Aussagues, Guy Vidal-Naquet. A new representation for the scheduling problem and its applications. RTSS 2006 : 27th International Rea-Time Systems Symposium, Dec 2006, Rio de Janeiro, Brazil. pp.89-92. ⟨hal-00258276⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

249

Contact

Informations

CCSD