A new representation for the scheduling problem and its applications - CentraleSupélec Access content directly
Conference Papers Year : 2006

A new representation for the scheduling problem and its applications

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.
No file

Dates and versions

hal-00258276 , version 1 (21-02-2008)

Identifiers

  • HAL Id : hal-00258276 , version 1

Cite

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⟩
108 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More