Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Study of Utilization Bound and Run-Time Overhead for Cluster Scheduling in Multiprocessor Real-Time Systems
 

Summary: A Study of Utilization Bound and Run-Time Overhead for
Cluster Scheduling in Multiprocessor Real-Time Systems
Xuan Qi, Dakai Zhu Hakan Aydin
Department of Computer Science Department of Computer Science
University of Texas at San Antonio George Mason University
San Antonio, TX, 78249 Fairfax, VA 22030
{xqi,dzhu}@cs.utsa.edu aydin@cs.gmu.edu
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 attracted at-
tention in multiprocessor real-time systems research re-
cently. In this paper, by adopting optimal global sched-
ulers within each cluster, first we investigate the worst-
case utilization bound for cluster scheduling. Specifi-
cally, for a system with m homogeneous clusters where
each cluster has k processors, we show that the worst-
case achievable system utilization is k/ m+1
k/ +1 k, where
is the maximum utilization for the periodic tasks con-

  

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

 

Collections: Computer Technologies and Information Sciences; Engineering