Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

In this paper, we prove that a simplified variant of the PD Pfair algorithm, called PD/sup 2/, 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.

[1]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[2]  Mark Moir,et al.  Static-priority periodic scheduling on multiprocessors , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[3]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[4]  James H. Anderson,et al.  A New Look at Pfair Priorities , 1999 .

[5]  James H. Anderson,et al.  Early-release fair scheduling , 2000, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000.

[6]  James H. Anderson,et al.  Pfair scheduling: beyond periodic task systems , 2000, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications.

[7]  James H. Anderson,et al.  Optimal rate-based scheduling on multiprocessors , 2002, STOC '02.

[8]  Sanjoy K. Baruah,et al.  Fast scheduling of periodic tasks on multiple resources , 1995, Proceedings of 9th International Parallel Processing Symposium.

[9]  Sanjoy K. Baruah,et al.  Fairness in periodic real-time scheduling , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[10]  Mark Moir,et al.  Pfair scheduling of fixed and migrating periodic tasks on multiple resources , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).