@inproceedings{5444f32f6c6543a9be2e37813d1dbd91,
title = "Fixed-priority multiprocessor scheduling with Liu \& Layland's utilization bound",
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.",
keywords = "Fixed priority scheduling, Multiprocessor, Real-time systems, Utilization bound",
author = "Nan Guan and Martin Stigge and Wang Yi and Ge Yu",
year = "2010",
doi = "10.1109/RTAS.2010.39",
language = "英语",
isbn = "9780769540016",
series = "Real-Time Technology and Applications - Proceedings",
pages = "165--174",
booktitle = "Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010",
note = "16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2010 ; Conference date: 12-04-2010 Through 15-04-2010",
}