KOPS - The Institutional Repository of the University of Konstanz

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling

Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können derzeit keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted currently.)

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling

Cite This

Files in this item

Checksum: MD5:6e41f9548d99010e72d1fe09bceb4ecb

KARRENBAUER, Andreas, Thomas ROTHVOSS, 2009. An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling. In: FIAT, Amos, ed., Peter SANDERS, ed.. Algorithms - ESA 2009. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 432-443. ISBN 978-3-642-04127-3. Available under: doi: 10.1007/978-3-642-04128-0_39

@inproceedings{Karrenbauer2009Avera-6005, title={An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling}, year={2009}, doi={10.1007/978-3-642-04128-0_39}, number={5757}, isbn={978-3-642-04127-3}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Algorithms - ESA 2009}, pages={432--443}, editor={Fiat, Amos and Sanders, Peter}, author={Karrenbauer, Andreas and Rothvoß, Thomas} }

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically optimal processor assignments if utilization values are chosen uniformly at random. More precisely we prove that the expected waste is upper bounded by O(n3/4(log n)3/8). Here the waste denotes the ratio of idle times, cumulated over all processors and n gives the number of tasks.<br />The algorithm can be implemented to run in time O(n log n) and even in the worst case, an asymptotic approximation ratio of 2 is guaranteed. Experiments yield an average waste proportional to n 0.70, indicating that the above upper bound on the expected waste is almost tight.<br />While such average-case analyses are a classical topic of Bin Packing, to the best of our knowledge, this is the first result dealing with a theoretical average-case analysis for this scheduling problem, which was described by Liu and Layland more than 35 years ago and has received a lot of attention, especially in the real-time and embedded-systems community. 2011-03-24T16:08:42Z Rothvoß, Thomas 2009 First publ. in: Algorithms : ESA 2009 ; 17th Annual European Symposium, Copenhagen, Denmark, September 7 - 9, 2009 / Amos Fiat ... (eds.). - Berlin: Springer, 2009. - pp. 432-443 eng Karrenbauer, Andreas Karrenbauer, Andreas terms-of-use application/pdf 2011-03-24T16:08:42Z Rothvoß, Thomas

Downloads since Oct 1, 2014 (Information about access statistics)

avcase_esa09.pdf 340

This item appears in the following Collection(s)

Search KOPS


My Account