Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Real-Time Syst (2011) 47: 253284 DOI 10.1007/s11241-011-9121-1
 

Summary: Real-Time Syst (2011) 47: 253284
DOI 10.1007/s11241-011-9121-1
Cluster scheduling for real-time systems: utilization
bounds and run-time overhead
Xuan Qi Dakai Zhu Hakan Aydin
Published online: 24 March 2011
Springer Science+Business Media, LLC 2011
Abstract Cluster scheduling, where processors are grouped into clusters and the
tasks that are allocated to one cluster are scheduled by a global scheduler, has at-
tracted attention in multiprocessor real-time systems research recently. In this paper,
assuming that an optimal global scheduler is adopted within each cluster, we investi-
gate the worst-case utilization bounds for cluster scheduling with different task allo-
cation/partitioning heuristics. First, we develop a lower limit on the utilization bounds
for cluster scheduling with any reasonable task allocation scheme. Then, the lower
limit is shown to be the exact utilization bound for cluster scheduling with the worst-
fit task allocation scheme. For other task allocation heuristics (such as first-fit, best-
fit, first-fit decreasing, best-fit decreasing and worst-fit decreasing), higher utilization
bounds are derived for systems with both homogeneous clusters (where each cluster
has the same number of processors) and heterogeneous clusters (where clusters have
different number of processors). In addition, focusing on an efficient optimal global

  

Source: Aydin, Hakan - Department of Computer Science, George Mason University

 

Collections: Computer Technologies and Information Sciences; Engineering