On the Scalability of Real-Time Scheduling Algorithms on Multicore Platforms: A Case Study
Brandenburg, B.B.
Calandrino, J.M.
Anderson, J.H.
Dept. of Comput. Sci., Univ. of North Carolina at Chapel Hill, Chapel Hill, NC;
This paper appears in: Real-Time Systems Symposium, 2008
Publication Date: Nov. 30 2008-Dec. 3 2008
On page(s): 157-169
Location: Barcelona,
ISSN: 1052-8725
ISBN: 978-0-7695-3477-0
INSPEC Accession Number: 10414599
Digital Object Identifier: 10.1109/RTSS.2008.23
Current Version Published: 2008-12-08
Abstract
Multicore platforms are predicted to become significantly larger in the coming years. Given that real-time workloads will inevitably be deployed on such platforms, the scalability of the scheduling algorithms used to support such workloads warrants investigation. In this paper, this issue is consideredand an empirical evaluation of several global and partitioned scheduling algorithms is presented. This evaluation was conducted using a Sun Niagara multicore platformwith 32 logical CPUs (eight cores, four hardware threads per core). In this study, each tested algorithm proved to be a viable choice for some subset of the workload categories considered.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
