Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound
2010pp. 165–174
Citations Over TimeTop 10% of 2010 papers
Abstract
Liu and Layland discovered the famous utilization bound 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.
Related Papers
- → The research of scheduling algorithms in real-time system(2010)19 cited
- → Analysis of Process Scheduling Algorithm for Multiprocessor System(2018)3 cited
- → A multiprocessor real-time process scheduling method(2003)7 cited
- → On-line Scheduling in Real-Time Multiprocessor Systems(2008)
- Task Scheduling in Multiprocessor Real-Time Systems(2001)