loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06)
Real-Time Scheduling on Multicore Platforms
San Jose, California
April 04-April 07
ISBN: 0-7695-2516-4
James H. Anderson, The University of North Carolina at Chapel Hill
John M. Calandrino, The University of North Carolina at Chapel Hill
UmaMaheswari C. Devi, The University of North Carolina at Chapel Hill
Multicore architectures, which have multiple processing units on a single chip, are widely viewed as a way to achieve higher processor performance, given that thermal and power problems impose limits on the performance of single-core designs. Accordingly, several chip manufacturers have already released, or will soon release, chips with dual cores, and it is predicted that chips with up to 32 cores will be available within a decade. To effectively use the available processing resources on multicore platforms, software designs should avoid co-executing applications or threads that can worsen the performance of shared caches, if not thrash them. While cache-aware scheduling techniques for such platforms have been proposed for throughput-oriented applications, to the best of our knowledge, no such work has targeted real-time applications. In this paper, we propose and evaluate a cache-aware Pfair-based scheduling scheme for real-time tasks on multicore platforms
Index Terms:
Multicore architectures, multiprocessors, real-time scheduling.
Citation:
James H. Anderson, John M. Calandrino, UmaMaheswari C. Devi, "Real-Time Scheduling on Multicore Platforms," rtas, pp.179-190, 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.