@inproceedings{0dc116f87f5e4a5588e3709000c5eafc,
title = "Global priority-driven aperiodic scheduling on multiprocessors",
abstract = "This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. A previously proposed priority-driven scheduling algorithm for periodic tasks with migration capability is extended to aperiodic scheduling and is shown to have a capacity bound of 0.5. This bound is close to the best achievable for a priority-driven scheduling algorithm. With an infinite number of processors, no priority-driven scheduling algorithm can perform better. We also propose a simple admission controller which guarantees that admitted tasks meet their deadlines and for many workloads, it admits tasks so that the utilization can be kept above the capacity bound.",
author = "Bj{\"o}rn Andersson and Tarek Abdelzaher and Jan Jonsson",
note = "Publisher Copyright: {\textcopyright} 2003 IEEE.; International Parallel and Distributed Processing Symposium, IPDPS 2003 ; Conference date: 22-04-2003 Through 26-04-2003",
year = "2003",
doi = "10.1109/IPDPS.2003.1213082",
language = "English (US)",
series = "Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003",
address = "United States",
}