Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On the Scalability of Real-Time Scheduling Algorithms on Multicore Platforms: A Case Study
 

Summary: On the Scalability of Real-Time Scheduling Algorithms on
Multicore Platforms: A Case Study
Bjšorn B. Brandenburg, John M. Calandrino, and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
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 scalabil-
ity of the scheduling algorithms used to support such work-
loads warrants investigation. In this paper, this issue is con-
sidered and an empirical evaluation of several global and
partitioned scheduling algorithms is presented. This evalua-
tion was conducted using a Sun Niagara multicore platform
with 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.
1 Introduction
Most major chip manufacturers have embraced multicore
technologies as a way to continue performance improve-

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences