loading...
Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks
Delft, The Netherlands June 13-June 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EMRTS.2001.93400413th Euromicro Conference on Real-Tim ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
James H. Anderson, University of North Carolina Chapel Hill
Anand Srinivasan, University of North Carolina Chapel Hill
Abstract: In this paper, we prove that a simplified variant of the PD Pfair algorithm, called PD2, is optimal for scheduling any mix of early-release and non-early-release asynchronous tasks on a multiprocessor. This result breaks new ground by incorporating both early-release and non-early-release tasks under a common framework. In addition, all prior work on optimal multiprocessor Pfair scheduling algorithms has been limited to synchronous periodic task systems.
Citation:
James H. Anderson, Anand Srinivasan, "Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks," ecrts, pp.0076, 13th Euromicro Conference on Real-Time Systems (ECRTS'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.