This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Partitioned Multiprocessor Scheduling of Deadline-Constrained Sporadic Task Systems
July 2006 (vol. 55 no. 7)
pp. 918-923
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks, each constrained to have its relative-deadline parameter be no larger than its period parameter, among the processors of an identical multiprocessor platform. Since the partitioning problem is easily seen to be NP--hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterization of its worst-case performance is provided in terms of resource augmentation: It is shown that any set of sporadic tasks that can be partitioned among the processors of an m{\hbox{-}}{\rm processor} identical multiprocessor platform will be partitioned by this algorithm on an m{\hbox{-}}{\rm processor} platform in which each processor is (3-1/m) times as fast.

[1] K. Albers and F. Slomka, “An Event Stream Driven Approximation for the Analysis of Real-Time Systems,” Proc. EuroMicro Conf. Real-Time Systems, pp. 187-195, July 2004.
[2] N. Audsley, A. Burns, and A. Wellings, “Deadline Monotonic Scheduling Theory and Application,” Control Eng. Practice, vol. 1, no. 1, pp. 71-78, 1993.
[3] T. Baker, “Multiprocessor EDF and Deadline Monotonic Schedulability Analysis,” Proc. IEEE Real-Time Systems Symp., pp. 120-129, Dec. 2003.
[4] T.P. Baker, “An Analysis of Deadline-Monotonic Schedulability on a Multiprocessor,” Technical Report TR-030201, Dept. of Computer Science, Florida State Univ., 2003.
[5] T.P. Baker, “An Analysis of EDF Schedulability on a Multiprocessor,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 8, pp. 760-768, Aug. 2005.
[6] S. Baruah, A. Mok, and L. Rosier, “Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor,” Proc. 11th Real-Time Systems Symp., pp. 182-190, 1990.
[7] M. Bertogna, M. Cirinei, and G. Lipari, “Improved Schedulability Analysis of EDF on Multiprocessor Platforms,” Proc. EuroMicro Conf. Real-Time Systems, pp. 209-218, July 2005.
[8] M. Dertouzos, “Control Robotics: The Procedural Control of Physical Processors,” Proc. IFIP Congress, pp. 807-813, 1974.
[9] S. Funk and S. Baruah, “Task Assignment on Uniform Heterogeneous Multiprocessors,” Proc. EuroMicro Conf. Real-Time Systems, pp. 219-226, July 2005.
[10] W. Horn, “Some Simple Scheduling Algorithms,” Naval Research Logistics Quarterly, vol. 21, pp. 177-185, 1974.
[11] D. Johnson, “Fast Algorithms for Bin Packing,” J. Computer and Systems Science, vol. 8, no. 3, pp. 272-314, 1974.
[12] D.S. Johnson, “Near-Optimal Bin Packing Algorithms,” PhD thesis, Dept. of Math., Massachusetts Inst. of Tech nology, 1973.
[13] J.P. Lehoczky, “Fixed Priority Scheduling of Periodic Tasks with Arbitrary Deadlines,” Proc. IEEE Real-Time Systems Symp., pp. 201-209, Dec. 1990.
[14] J. Leung and M. Merrill, “A Note on the Preemptive Scheduling of Periodic, Real-Time Tasks,” Information Processing Letters, vol. 11, pp. 115-118, 1980.
[15] J. Leung and J. Whitehead, “On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks,” Performance Evaluation, vol. 2, pp. 237-250, 1982.
[16] C. Liu and J. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 46-61, 1973.
[17] J.M. Lopez, J.L. Diaz, and D.F. Garcia, “Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems,” Real-Time Systems: The Int'l J. Time-Critical Computing, vol. 28, no. 1, pp. 39-68, 2004.
[18] J.M. Lopez, M. Garcia, J.L. Diaz, and D.F. Garcia, “Worst-Case Utilization Bound for EDF Scheduling in Real-Time Multiprocessor Systems,” Proc. EuroMicro Conf. Real-Time Systems, pp. 25-34, June 2000.
[19] A.K. Mok, “Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment,” PhD thesis, Laboratory for Computer Science, Massachusetts Inst. of Tech nology, 1983, Technical Report No. MIT/LCS/TR-297.
[20] C.A. Phillips, C. Stein, E. Torng, and J. Wein, “Optimal Time-Critical Scheduling via Resource Augmentation,” Proc. 29th Ann. ACM Symp. Theory of Computing, pp. 140-149, May 1997.
[21] A. Srinivasan, “Efficient and Flexible Fair Scheduling of Real-Time Tasks on Multiprocessors,” PhD thesis, Dept. of Computer Science, Univ. of North Carolina at Chapel Hill, 2003.

Index Terms:
Sporadic tasks, partitioned scheduling, multiprocessors, resource augmentation.
Citation:
Sanjoy Baruah, Nathan Fisher, "The Partitioned Multiprocessor Scheduling of Deadline-Constrained Sporadic Task Systems," IEEE Transactions on Computers, vol. 55, no. 7, pp. 918-923, July 2006, doi:10.1109/TC.2006.113
Usage of this product signifies your acceptance of the Terms of Use.