@inproceedings{85b0132ab64a4a37a7385f9259eed255,
title = "Partitioned aperiodic scheduling on multiprocessors",
abstract = "This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. We propose an algorithm for tasks without migration capabilities and prove that it has a capacity bound of 0.31. No algorithm for tasks without migration capabilities can have a capacity bound greater than 0.50.",
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.1213083",
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",
}