Skip to main content
Article thumbnail
Location of Repository

Fixed-Priority Multiprocessor Scheduling with Liu & Layland’s Utilization Bound

By Nan Guan, Martin Stigge, Wang Yi and Ge Yu

Abstract

Abstract—Liu and Layland discovered the famous utilization bound N(2 1 N − 1) for fixed-priority scheduling on singleprocessor 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. Keywords-real-time systems; utilization bound; multiprocessor; fixed priority scheduling I

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.180.7249
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://user.it.uu.se/%7Eyi/pdf... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.