Fixed-priority multiprocessor scheduling with Liu & Layland's utilization bound

Nan Guan, Martin Stigge, Wang Yi, Ge Yu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

66 Citations (Scopus)

Abstract

Liu and Layland discovered the famous utilization bound N(2 1/N-1) for fixed-priority scheduling on single-processor systems in the 1970's. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and Layland's utilization bound.
Original languageEnglish
Title of host publicationProceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010
Pages165-174
Number of pages10
DOIs
Publication statusPublished - 28 Jun 2010
Externally publishedYes
Event16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010 - Stockholm, Sweden
Duration: 12 Apr 201015 Apr 2010

Conference

Conference16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010
CountrySweden
CityStockholm
Period12/04/1015/04/10

Keywords

  • Fixed priority scheduling
  • Multiprocessor
  • Real-time systems
  • Utilization bound

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this