Partitioned aperiodic scheduling on multiprocessors

Björn Andersson, Tarek Abdelzaher, Jan Jonsson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. We propose an algorithm for tasks without migration capabilities and prove that it has a capacity bound of 0.31. No algorithm for tasks without migration capabilities can have a capacity bound greater than 0.50.

Original languageEnglish (US)
Title of host publicationProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)0769519261, 9780769519265
DOIs
StatePublished - Jan 1 2003
Externally publishedYes
EventInternational Parallel and Distributed Processing Symposium, IPDPS 2003 - Nice, France
Duration: Apr 22 2003Apr 26 2003

Publication series

NameProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Other

OtherInternational Parallel and Distributed Processing Symposium, IPDPS 2003
CountryFrance
CityNice
Period4/22/034/26/03

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Software

Fingerprint Dive into the research topics of 'Partitioned aperiodic scheduling on multiprocessors'. Together they form a unique fingerprint.

  • Cite this

    Andersson, B., Abdelzaher, T., & Jonsson, J. (2003). Partitioned aperiodic scheduling on multiprocessors. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003 [1213083] (Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPDPS.2003.1213083