Skip to Main content Skip to Navigation
Conference papers

On the complexity of optimal priority assignment for periodic tasks upon identical processors

Liliana Cucu 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we study global fixed-priority scheduling of periodic task systems upon identical multiprocessor platforms. Based on existing feasibility tests for periodic task systems upon identical multiprocessor platforms, we show (using a dummy priority assignment algorithm) that optimal priority assignment for these systems exists. Then we provide an algorithm based on RMUS[m/(3m-2)] that has lower complexity. Finally, we conjuncture that, contrary to the general opinion, (pseudo-) polynomial optimal priority assignment algorithms for periodic task systems upon identical processors might exist.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/inria-00334705
Contributor : Liliana Cucu-Grosjean <>
Submitted on : Monday, October 27, 2008 - 3:40:33 PM
Last modification on : Friday, February 26, 2021 - 3:28:07 PM
Long-term archiving on: : Tuesday, October 9, 2012 - 2:30:52 PM

File

LCucuCameraReadyWipEcrts.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00334705, version 1

Collections

Citation

Liliana Cucu. On the complexity of optimal priority assignment for periodic tasks upon identical processors. 20th Euromicro Conference on Real-time Systems (ECRTS'08), Work-in-Progress session, 2008, Prague, Czech Republic. ⟨inria-00334705⟩

Share

Metrics

Record views

224

Files downloads

418