Issue No.04 - April (2009 vol.20)
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
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.
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
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.129