loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st IEEE International Conference on Distributed Computing Systems (ICDCS'01)
Multiprocessor Preprocessing Algorithms for Uniprocessor On-Line Scheduling
Mesa, AZ
April 16-April 19
ISBN: 0-7695-1077-9
Joël Goossens, Universit? Libre de Bruxelles
Sanjoy Baruah, University of North Carolina
Abstract: Chetto and Chetto [3] presented an algorithm for the on-line admission control and run-time scheduling of aperiodic real-time jobs in preemptive uniprocessor environments that are executing systems of periodic hard-real-time tasks. This algorithm requires a significant degree of preprocessing of the system of periodic tasks?in general, this preprocessing takes time exponential in the representation of the periodic task system. In this paper, we develop techniques for speeding up the preprocessing phase of the Chetto and Chetto algorithm, by adapting it for implementation in parallel environments. We validate the effectiveness of our parallelization both by theoretical results, and through simulation experiments.
Citation:
Joël Goossens, Sanjoy Baruah, "Multiprocessor Preprocessing Algorithms for Uniprocessor On-Line Scheduling," icdcs, pp.0219, 21st IEEE International Conference on Distributed Computing Systems (ICDCS'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.