On Multiprocessor Utility Accrual Real-Time Scheduling with Statistical Timing Assurances

We present the first Utility Accrual (or UA) real-time scheduling algorithm for multiprocessors, called gMUA. The algorithm considers an application model where real-time activities are subject to time/utility function time constraints, variable execution time demands, and resource overloads where the total activity utilization demand exceeds the total capacity of all processors. We establish several properties of gMUA including optimal total utility (for a special case), conditions under which individual activity utility lower bounds are satisfied, a lower bound on system-wide total accrued utility, and bounded sensitivity for assurances to variations in execution time demand estimates. Our simulation experiments confirm our analysis and illustrate the algorithm's effectiveness

[1]  David P. Maynard,et al.  An Example Real-Time Command, Control, and Battle Management Application for Alpha , 1988 .

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

[3]  Raymond K. Clark,et al.  Software organization to facilitate dynamic processor scheduling , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[4]  Raymond Keith Clark,et al.  Scheduling dependent real-time activities , 1990 .

[5]  Rami G. Melhem,et al.  Dynamic and aggressive scheduling techniques for power-aware real-time systems , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[6]  Binoy Ravindran,et al.  Fast, best-effort real-time scheduling algorithms , 2004, IEEE Transactions on Computers.

[7]  James H. Anderson,et al.  Tardiness Bounds under Global EDF Scheduling on a Multiprocessor , 2005, RTSS.

[8]  Arkady Kanevsky,et al.  An Adaptive, Distributed Airborne Tracking System ("process the Right Tracks at the Right Time") , 1999, IPPS/SPDP Workshops.

[9]  Theodore P. Baker,et al.  Multiprocessor EDF and deadline monotonic schedulability analysis , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[10]  Hideyuki Tokuda,et al.  A Time-Driven Scheduling Model for Real-Time Operating Systems , 1985, RTSS.

[11]  Giuseppe Lipari,et al.  Improved schedulability analysis of EDF on multiprocessor platforms , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[12]  James H. Anderson,et al.  Efficient scheduling of soft real-time applications on multiprocessors , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[13]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[14]  Binoy Ravindran,et al.  On recent advances in time/utility function real-time scheduling and resource management , 2005, Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05).

[15]  J. Duane Northcutt.  Mechanisms for Reliable Distributed Real-Time Operating Systems: The Alpha Kernel , 1987 .

[16]  James H. Anderson,et al.  An EDF-based scheduling algorithm for multiprocessor soft real-time systems , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[17]  Sanjoy K. Baruah,et al.  A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms , 2004, Handbook of Scheduling.

[18]  James H. Anderson,et al.  Adapting Pfair scheduling for symmetric multiprocessors , 2005, J. Embed. Comput..

[19]  Sanjoy K. Baruah,et al.  Deadline-based scheduling of periodic task systems on multiprocessors , 2002, Inf. Process. Lett..

[20]  Omar U. Pereira Zapata,et al.  EDF and RM Multiprocessor Scheduling Algorithms : Survey and Performance Evaluation , 2005 .

[21]  Zheng Wang,et al.  System support for automatic profiling and optimization , 1997, SOSP.

[22]  © R. Bettati.  Priority-driven Scheduling of Periodic Tasks , 2000 .

[23]  Binoy Ravindran,et al.  A formally verified application-level framework for real-time scheduling on POSIX real-time operating systems , 2004, IEEE Transactions on Software Engineering.