Subscribe

Issue No.04 - April (2009 vol.20)

pp: 553-566

Marko Bertogna , Scuola Superiore Sant' Anna, Pisa

Michele Cirinei , Scuola Superiore Sant' Anna, Pisa

Giuseppe Lipari , Scuola Superiore Sant' Anna, Pisa

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.129

ABSTRACT

Research on real-time scheduling algorithms for multiprocessor systems is a hot topic, due to the recent popularity of multicore hardware platforms. When executing applications with dynamic requirements on symmetric multiprocessor platforms, a possibility is to use global scheduling, where ready tasks are inserted in a single system-wide queue and migration from one processor to another is allowed during task lifetime. This paper addresses the problem of schedulability analysis of globally scheduled periodic and sporadic task sets. First, a general method to derive schedulability conditions for multiprocessor real-time systems will be presented. The analysis will be applied to two typical scheduling algorithms: Earliest Deadline First (EDF) and Fixed Priority (FP). Then, the derived schedulability conditions will be tightened, refining the analysis with a simple and effective technique that significantly improves the percentage of accepted task sets. The effectiveness of the proposed test is shown through an extensive set of synthetic experiments.

INDEX TERMS

Real-time distributed, Scheduling and task partitioning, Parallel Architectures, Processor Architectures, Multi-core/single-chip multiprocessors, Real-time and embedded systems, Special-Purpose and Application-Based Systems, Computer Systems Organization, Multiprocessor Systems, Computer System Implementation, Scheduling, Process Management, Operating Systems, Software/Software Engineering, Organization and Design

CITATION

Marko Bertogna, Michele Cirinei, Giuseppe Lipari, "Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms",

*IEEE Transactions on Parallel & Distributed Systems*, vol.20, no. 4, pp. 553-566, April 2009, doi:10.1109/TPDS.2008.129REFERENCES

- [1] M. Garey and D. Johnson,
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.- [2] J.M. Calandrino, J.H. Anderson, and D.P. Baumberger, “A Hybrid Real-Time Scheduling Approach for Large-Scale Multicore Platforms,”
Proc. 19th Euromicro Conf. Real-Time Systems (ECRTS), 2007.- [4] J. Anderson and A. Srinivasan, “Pfair Scheduling: Beyond Periodic Task Systems,”
Proc. Seventh Int'l Conf. Real-Time Computing Systems and Applications (RTCSA '00), Dec. 2000.- [5] P. Holman and J.H. Anderson, “Adapting Pfair Scheduling for Symmetric Multiprocessors,”
J. Embedded Computing, vol. 1, no. 4, pp. 543-564, 2005.- [6] J. Goossens, S. Funk, and S. Baruah, “Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors,”
Real Time Systems, vol. 25, nos. 2-3, pp. 187-205, 2003.- [7] T. Baker, “Multiprocessor EDF and Deadline Monotonic Schedulability Analysis,”
Proc. 24th IEEE Real-Time Systems Symp. (RTSS '03), pp. 120-129, Dec. 2003.- [9] B. Andersson, “Static-Priority Scheduling on Multiprocessors,” PhD dissertation, Dept. of Computer Eng., Chalmers Univ., 2003.
- [11] M. Bertogna, M. Cirinei, and G. Lipari, “New Schedulability Tests for Real-Time Tasks Sets Scheduled by Deadline Monotonic on Multiprocessors,”
Proc. Ninth Int'l Conf. Principles of Distributed Systems (OPODIS '05), Dec. 2005.- [12] T.P. Baker, “An Analysis of Fixed-Priority Schedulability on a Multiprocessor,”
Real-Time Systems: The Int'l J. Time-Critical Computing, vol. 32, nos. 1-2, pp. 49-71, 2006.- [14] T.P. Baker and M. Cirinei, “A Unified Analysis of Global EDF and Fixed-Task-Priority Schedulability of Sporadic Task Systems on Multiprocessors,”
J. Embedded Computing, http://www.cs.fsu. edu/research/reportsTR-060401.pdf , 2007.- [16] M. Bertogna, “Real-Time Scheduling Analysis for Multiprocessor Platforms,” PhD dissertation, Scuola Superiore Sant'Anna, 2008.
- [19] J. Anderson and A. Srinivasan, “Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks,”
Proc. 13th Euromicro Conf. Real-Time Systems (ECRTS '01), June 2001.- [21] S. Cho, S.K. Lee, and K.-J. Lin, “On-Line Algorithms for Real-Time Task Scheduling on Multiprocessor Systems,”
Proc. Fifth IASTED Int'l Conf. Internet and Multimedia Systems and Applications (IMSA'01), pp. 395-400, Aug. 2001.- [22] M. Cirinei and T.P. Baker, “Edzl Scheduling Analysis,”
Proc. 19th Euromicro Conf. Real-Time Systems (ECRTS '07), July 2007.- [23] N. Fisher and S. Baruah, “The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms,”
Proc. 19th Euromicro Conf. Real-Time Systems (ECRTS '07), July 2007.- [24] T.P. Baker and M. Cirinei, “A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks,”
Proc. 27th IEEE Real-Time Systems Symp. (RTSS '06), pp.178-190, 2006.- [25] L. Cucu and J. Goossens, “Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors,”
Proc. 11th IEEE Int'l Conf. Emerging Technologies and Factory Automation (ETFA '06), Sept. 2006. |