Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms Export

@article{bertogna09schedulability, 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.}, address = {Piscataway, NJ, USA}, author = {Bertogna, Marko and Cirinei, Michele and Lipari, Giuseppe}, citeulike-article-id = {4570957}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1515608.1515674}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/TPDS.2008.129}, doi = {10.1109/TPDS.2008.129}, issn = {1045-9219}, journal = {IEEE Transactions on Parallel Distributed Systems}, keywords = {edf, fixed-priority, multiprocessor, scheduling}, number = {4}, pages = {553--566}, posted-at = {2009-05-21 17:15:37}, priority = {2}, publisher = {IEEE Press}, title = {Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms}, url = {http://dx.doi.org/10.1109/TPDS.2008.129}, volume = {20}, year = {2009} }

TY - JOUR ID - bertogna09schedulability L3 - citeulike-article-id:4570957 N2 - 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. IS - 4 JF - IEEE Transactions on Parallel Distributed Systems SN - 1045-9219 AD - Piscataway, NJ, USA EP - 566 TI - Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms PB - IEEE Press VL - 20 SP - 553 KW - edf KW - fixed-priority KW - multiprocessor KW - scheduling AU - Bertogna, Marko AU - Cirinei, Michele AU - Lipari, Giuseppe PY - 2009/// UR - http://dx.doi.org/10.1109/TPDS.2008.129 ER -