Skip to Main content Skip to Navigation
Conference papers

Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem

Liliana Cucu 1 Olivier Buffet 2
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 MAIA - Autonomous intelligent machine
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a {\em constraint satisfaction problem} that we prove equivalent to the multiprocessor problem. A solution has to satisfy a set of constraints and there is no performance criterion to optimize. We propose two different CSP formulations. The first one is a basic encoding allowing to use state of the art CSP solvers. The second one is a more complex encoding designed to obtain solutions faster. With these encodings, we then study the resolution of the scheduling problem using systematic search algorithms based on backtracking.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00429506
Contributor : Olivier Buffet <>
Submitted on : Wednesday, November 18, 2009 - 7:00:06 AM
Last modification on : Friday, February 26, 2021 - 3:28:07 PM
Long-term archiving on: : Tuesday, October 16, 2012 - 1:06:17 PM

File

cucBuf09xrts.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00429506, version 1

Collections

Citation

Liliana Cucu, Olivier Buffet. Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem. ICPP'09 Workshop on Real-time systems on multicore platforms: Theory and Practice (XRTS'09), Sep 2009, Vienne, Austria. ⟨inria-00429506⟩

Share

Metrics

Record views

403

Files downloads

500