Fine-grained task reweighting on multiprocessors

We consider the problem of task reweighting in fair-scheduled multiprocessor systems wherein each task's processor share is specified as a weight. Task reweighting can be used as a means for consuming (or making available) spare processing capacity. In this paper, we propose a multiprocessor reweighting scheme that can change a task's processor share with "minimal" error per share change.

[1]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

[2]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.

[3]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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

[5]  James H. Anderson,et al.  Fair scheduling of dynamic task systems on multiprocessors , 2005, J. Syst. Softw..

[6]  James H. Anderson,et al.  Task reweighting on multiprocessors: efficiency versus accuracy , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[7]  Lixia Zhang,et al.  VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.

[8]  Hussein M. Abdel-Wahab,et al.  A proportional share resource allocation algorithm for real-time, time-shared systems , 1996, 17th IEEE Real-Time Systems Symposium.

[9]  Gary Bishop,et al.  Whisper: a spread spectrum approach to occlusion in acoustic tracking , 2002 .

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

[11]  K ParekhAbhay,et al.  A generalized processor sharing approach to flow control in integrated services networks , 1993 .

[12]  James H. Anderson,et al.  Task Reweighting under Global Scheduling on Multiprocessors , 2006, ECRTS.

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

[14]  Sang Hyuk Son,et al.  Design and evaluation of a feedback control EDF scheduling algorithm , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[15]  Sanjoy K. Baruah,et al.  Proportionate progress: A notion of fairness in resource allocation , 1993, Algorithmica.

[16]  Lixia Zhang.  VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

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

[18]  Joseph Kee-Yin Ng,et al.  Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05): Foreword , 2005 .

[19]  Kumar Jayantilal Parekn Abhay,et al.  A generalized processor sharing approach to frow control in integrated services networks , 1992 .

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

[21]  James H. Anderson,et al.  Mixed Pfair/ERfair scheduling of asynchronous periodic tasks , 2001, Proceedings 13th Euromicro Conference on Real-Time Systems.

[22]  Aaron Block.  Accuracy versus Migration Overhead in Multiprocessor Reweighting Algorithms , 2005 .

[23]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM 1996.

[24]  James H. Anderson,et al.  Quick-release fair scheduling , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.