Global priority-driven aperiodic scheduling on multiprocessors

This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. A previously proposed priority-driven scheduling algorithm for periodic tasks with migration capability is extended to aperiodic scheduling and is shown to have a capacity bound of 0.5. This bound is close to the best achievable for a priority-driven scheduling algorithm. With an infinite number of processors, no priority-driven scheduling algorithm can perform better. We also propose a simple admission controller which guarantees that admitted tasks meet their deadlines and for many workloads, it admits tasks so that the utilization can be kept above the capacity bound.

[1]  Björn Andersson,et al.  The aperiodic multiprocessor utilization bound for liquid tasks , 2002, Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium.

[2]  Sanjoy K. Baruah,et al.  Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors , 2003, Real-Time Systems.

[3]  Sanjoy K. Baruah,et al.  Static-priority scheduling on multiprocessors , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[4]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[5]  Kang G. Shin,et al.  QoS negotiation in real-time systems and its application to automated flight control , 1997, Proceedings Third IEEE Real-Time Technology and Applications Symposium.

[6]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) , 1997, Symposium on the Theory of Computing.

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

[8]  Rami G. Melhem,et al.  Comparison of global and partitioning schemes for scheduling rate monotonic tasks on a multiprocessor , 1998, Proceeding. 10th EUROMICRO Workshop on Real-Time Systems (Cat. No.98EX168).

[9]  Chenyang Lu,et al.  Schedulability analysis and utilization bounds for highly scalable real-time services , 2001, Proceedings Seventh IEEE Real-Time Technology and Applications Symposium.

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

[11]  Rohit Jain,et al.  Variability in the execution of multimedia applications and implications for architecture , 2001, Proceedings 28th Annual International Symposium on Computer Architecture.

[12]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[13]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[14]  Rohit Jain,et al.  Soft real-time scheduling on simultaneous multithreaded processors , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[15]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[16]  Jane W.-S. Liu,et al.  Validating timing constraints in multiprocessor and distributed real-time systems , 1994, 14th International Conference on Distributed Computing Systems.

[17]  Guillem Bernat,et al.  An Approach to Symbolic Worst-Case Execution Time Analysis , 2000 .