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
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.