research-article

Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption

Authors:

Robert I. Davis,

Stefan M. Petters,

Marko BertognaAuthors Info & Claims

ACM Transactions on Embedded Computing Systems (TECS), Volume 14, Issue 3

Article No.: 47, Pages 1 - 28

https://doi.org/10.1145/2739954

Published: 21 April 2015 Publication History

Abstract

This article introduces schedulability analysis for Global Fixed Priority Scheduling with Deferred Preemption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of Global Fixed Priority Preemptive Scheduling (gFPPS) and Global Fixed Priority Nonpreemptive Scheduling (gFPNS). We show how schedulability can be improved using gFPDS via appropriate choice of priority assignment and final nonpreemptive region lengths, and provide algorithms that optimize schedulability in this way. Via an experimental evaluation we compare the performance of multiprocessor scheduling using global approaches: gFPDS, gFPPS, and gFPNS, and also partitioned approaches employing FPDS, FPPS, and FPNS on each processor.

Supplementary Material

a47-davis-apndx.pdf (davis.zip)

Supplemental movie, appendix, image and software files for, A reward-and-punishment-based approach for concept detection using adaptive ontology rules

Download
159.18 KB

References

[1]

S. Altmeyer, R. I. Davis, and C. Maiza. 2011. Cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems. In Proceedings of the 32nd IEEE Real-Time Systems Symposium (RTSS’11). 261--271.

Digital Library

[2]

S. Altmeyer, R. I. Davis, and C. Maiza. 2012. Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems. Real-Time Syst. 48, 5 (2012), 499--526.

Digital Library

[3]

N. C. Audsley. 1991. Optimal Priority Assignment and Feasibility of Static Priority Tasks with Arbitrary Start Times. Technical Report YCS 164, University of York, UK.

[4]

N. C. Audsley. 2001. On priority assignment in fixed priority scheduling. Inf. Process. Lett. 79, 1 (2001), 39--44.

Digital Library

[5]

T. P. Baker. 2003. Multiprocessor EDF and deadline monotonic schedulability analysis. In Proceedings of the 24th IEEE Real-Time Systems Symposium (RTSS’03). 120--129.

Digital Library

[6]

S. K. Baruah and A. Burns. 2006. Sustainable scheduling analysis. In Proceedings of the 27th IEEE International Real-Time Systems Symposium (RTSS’06). 159--168.

Digital Library

[7]

S. K. Baruah. 2005. The limited-preemption uniprocessor scheduling of sporadic task systems. In Proceedings of the 17th Euromicro Conference on Real-Time Systems (ECRTS’05). 137--144.

Digital Library

[8]

S. K. Baruah. 2007. Techniques for multiprocessor global schedulability analysis. In Proceedings of the 28th IEEE International Real-Time Systems Symposium (RTSS’07). 119--128.

Digital Library

[9]

S. K. Baruah and N. Fisher. 2008. Global fixed-priority scheduling of arbitrary-deadline sporadic task systems. In Proceedings of the 9th International Conference on Distributed Computing and Networking. 215--226.

Digital Library

[10]

Bastoni, B. Brandenburg, and J. Anderson. 2010. Cache-related preemption and migration delays: Empirical approximation and impact on schedulability. In Proceedings of the 6th International Workshop on Operating Systems Platforms for Embedded Real-Time Applications (OSPERT’10). 33--44.

[11]

M. Bertogna, M. Cirinei, and G. Lipari. 2005. New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors. In Proceedings of the 9th International Conference on Principles of Distributed Systems. 306--321.

Digital Library

[12]

M. Bertogna and M. Cirinei. 2007. Response time analysis for global scheduled symmetric multiprocessor platforms. In Proceedings of the 28th IEEE International Real-Time Systems Symposium (RTSS’07). 149--158.

Digital Library

[13]

M. Bertogna, M. Cirinei, and G. Lipari. 2009. Schedulability analysis of global scheduling algorithms on multiprocessor platforms. IEEE Trans. Parallel Distrib. Syst. 20, 4 (2009), 553--566.

Digital Library

[14]

M. Bertogna, G. Buttazzo, M. Marinoni, G. Yao, F. Esposito, and M. Caccamo. 2010. Preemption points placement for sporadic task sets. In Proceedings of the 22nd Euromicro Conference on Real-Time Systems (ECRTS’10). 251--260.

Digital Library

[15]

M. Bertogna, O. Xhani, M. Marinoni, F. Esposito, and G. Buttazzo. 2011a. Optimal selection of preemption points to minimize preemption overhead. In Proceedings of the 23rd Euromicro Conference on Real-Time Systems (ECRTS’11). 217--227.

Digital Library

[16]

M. Bertogna, G. Buttazzo, and G. Yao. 2011b. Improving feasibility of fixed priority tasks using non-preemptive regions. In Proceedings of the IEEE 32nd Real-Time Systems Symposium (RTSS), 251--260.

Digital Library

[17]

A. Block, H. Leontyev, B. Brandenburg, and J. H. Anderson. 2007. A flexible real-time locking protocol for multiprocessors. In Proceedings of 13th IEEE Conference on Real-Time Computing Systems and Applications (RTCSA’07). 47--56.

Digital Library

[18]

M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. 1973. Time bounds for selection. J. Comput. Syst. Sci. 7, 4 (1973), 448--461.

Digital Library

[19]

B. B. Brandenburg and J. Anderson. 2014. A Clarification of Link-Based Global Scheduling. Technical Report MPI-SWS-2014-007. Max Plank Institute for Software Systems. Available from http://www.mpi-sws.org/cont/tr/2014-007.pdf.

[20]

B. B. Brandenburg. 2011. Scheduling and Locking in Multiprocessor Real-Time Operating Systems. PhD thesis. The University of North Carolina at Chapel Hill.

Digital Library

[21]

R. Bril, J. Lukkien, and W. Verhaegh. 2009. Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. Real-Time Syst. 42, 1--3 (2009), 63--119.

Digital Library

[22]

A. Burns. 1994. Preemptive Priority Based Scheduling: An Appropriate Engineering Approach. S. Son (Ed.), Advances in Real-Time Systems. Prentice-Hall, Upper Saddle River, NJ, 225--248.

Digital Library

[23]

A. Burns and S. K. Baruah. 2008. Sustainability in real-time scheduling. J. Comput. Sci. Eng. 2, 1 (2008), 74--97.

[24]

G. C. Buttazzo, M. Bertogna, and G. Yao. 2013. Limited preemptive scheduling for real-time systems: A survey. IEEE Trans. Ind. Inf. 9, 1 (2013), 3--15.

[25]

R. I. Davis and A. Burns. 2009. Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In Proceedings of the 30th IEEE Real-Time Systems Symposium (RTSS’09). 398--409.

Digital Library

[26]

R. I. Davis, T. Rothvoß, S. K. Baruah, and A. Burns. 2009. Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling. Real-Time Syst. 43, 3 (2009), 211--258.

Digital Library

[27]

R. I. Davis and A. Burns. 2011a. Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Real-Time Syst. 47, 1 (2011), 1--40.

Digital Library

[28]

R. I. Davis and A. Burns. 2011b. FPZL schedulability analysis. In Proceedings of the 17th IEEE Real-Time Applications and Embedded Technology Symposium (RTAS’11). 245--256.

Digital Library

[29]

R. I. Davis and S. Kato. 2012. FPSL, FPCL and FPZL schedulability analysis. Real-Time Syst. 48, 12 (2012), 750--788.

Digital Library

[30]

R. I. Davis and A. Burns. 2011c. A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. 43, 4, Article 35 (2011), 44 pages.

Digital Library

[31]

R. I. Davis and M. Bertogna. 2012. Optimal fixed priority scheduling with deferred pre-emption. In Proceedings of the 33rd IEEE Real-Time Systems Symposium (RTSS’12). 39--50.

Digital Library

[32]

R. I. Davis, A. Burns, R. J. Bril, and J. J. Lukkien. 2007. Controller area network (CAN) schedulability analysis: Refuted, revisited and revised. Real-Time Syst. 35, 3 (2007), 239--272.

Digital Library

[33]

R. I. Davis, A. Burns, J. Marinho, V. Nelis, S. M. Petters, and M. Bertogna. 2013. Global fixed priority scheduling with deferred pre-emption. In Proceedings of the 19th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA’13). 1--11.

[34]

P. Emberson, R. Stafford, and R. I. Davis. 2010. Techniques for the synthesis of multiprocessor tasksets. In Proceedings of the 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-Time Systems (WATERS’10). 6--11.

[35]

N. Fisher and S. K. Baruah. 2006. Global static-priority scheduling of sporadic task systems on multiprocessor platforms. In Procedings of the IASTED International Conference on Parallel and Distributed Computing and Systems.

[36]

N. Fisher, S. K. Baruah, and T. P. Baker. 2006. The partitioned scheduling of sporadic tasks according to static priorities. In Proceedings of the 18th EuroMicro Conference on Real-Time Systems (ECRTS’06). 118--127.

Digital Library

[37]

M. Garey and D. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York.

Digital Library

[38]

N. Guan, W. Yi, Q. Deng, Z. Gu, and G. Yu. 2011. Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling. J. Syst. Archit. 57, 5 (2011), 536--546.

Digital Library

[39]

N. Guan, M. Stigge, W. Yi, and G. Yu. 2009. New response time bounds for fixed priority multiprocessor scheduling. In Proceedings of the 30th IEEE Real-Time Systems Symposium (RTSS’09). 388--397.

Digital Library

[40]

B. Kalyanasundaram and K. Pruhs. 1995. Speed is as powerful as clairvoyance. In Proceedings of the 36th Symposium on Foundations of Computer Science. 214--221.

Digital Library

[41]

W. Lunniss, S. Altmeyer, and R. I. Davis. 2014. A comparison between fixed priority and EDF scheduling accounting for cache related pre-emption delays. Leibniz Trans. Embedded Syst. 1, 1 (2014).

[42]

J. Marinho, V. Nelis, S. M. Petters, M. Bertogna, and R. I. Davis. 2013. Limited pre-emptive global fixed task priority. In Proceedings of the IEEE 34th Real-Time Systems Symposium (RTSS’13). 182--191.

Digital Library

[43]

J. Marinho, V. Nélis, S. M. Petters, and I. Puaut. 2012. Preemption delay analysis for floating non-preemptive region scheduling. In Proceedings of DATE. 497--502.

Digital Library

[44]

D. I. Oh and T. P. Baker. 1998. Utilization bounds for N-processor rate monotone scheduling with stable processor assignment. Real-Time Syst. 15, 2 (1998), 183--193.

Digital Library

[45]

G. Yao, G. Buttazzo, and M. Bertogna. 2009. Bounding the maximum length of non-preemptive regions under fixed priority scheduling. In Proceedings of the 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA’06). 351--360.

Digital Library

Cited By

Garanina NAnureev IKondratyev D(2025)Polynomial Exact Schedulability and Infeasibility Test for Fixed-Priority Scheduling on Multiprocessor PlatformsApplied System Innovation10.3390/asi80100158:1(15)Online publication date: 20-Jan-2025
https://doi.org/10.3390/asi8010015
Sharma YMoulik S(2021)SMART-EDF: An EDF based semi-partitioned energy-aware multicore scheduler for real-time systemsTENCON 2021 - 2021 IEEE Region 10 Conference (TENCON)10.1109/TENCON54134.2021.9707333(821-826)Online publication date: 7-Dec-2021
https://doi.org/10.1109/TENCON54134.2021.9707333
Talmale GShrawankar U(2021)Cluster formation techniques for hierarchical real time tasks allocation on multiprocessor systemConcurrency and Computation: Practice and Experience10.1002/cpe.643833:21Online publication date: 4-Jun-2021
https://doi.org/10.1002/cpe.6438
Show More Cited By

Index Terms

Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption
1. Computer systems organization
  1. Embedded and cyber-physical systems
  2. Real-time systems

Recommendations

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances made in schedulability analysis, and contains a number of significant ...
FPSL, FPCL and FPZL schedulability analysis

This paper presents the Fixed Priority until Static Laxity (FPSL), Fixed Priority until Critical Laxity (FPCL) and Fixed Priority until Zero Laxity (FPZL) scheduling algorithms for multiprocessor real-time systems. FPZL is similar to global fixed ...
A unified analysis of global EDF and fixed-task-priority schedulability of sporadic task systems on multiprocessors

Fixed-task-priority (FTP) scheduling and earliest-deadline-first (EDF) scheduling policies are alike in fixing the priority of each job of a task at the time the job is released. This common feature of FTP and EDF scheduling permits a unified analysis ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems

ACM Transactions on Embedded Computing Systems Volume 14, Issue 3

Special Issue on Embedded Platforms for Crypto and Regular Papers

May 2015

515 pages

ISSN:1539-9087

EISSN:1558-3465

DOI:10.1145/2764962

Editor:
Sandeep K. Shukla
Virginia Tech, USA

Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 21 April 2015

Accepted: 01 January 2015

Revised: 01 November 2014

Received: 01 September 2013

Published in TECS Volume 14, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Portuguese National Funds through FCT (Portuguese Foundation for Science and Technology
UK EPSRC Tempo project (EP/G055548/1)
UK EPSRC MCC project (EP/K011626/1)
ERDF (European Regional Development Fund) through COMPETE (Operational Programme "Thematic Factors of Competitiveness"), within the RePoMuC project (FCOMP-01-0124-FEDER-015050)

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
266
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)1

Reflects downloads up to 04 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Garanina NAnureev IKondratyev D(2025)Polynomial Exact Schedulability and Infeasibility Test for Fixed-Priority Scheduling on Multiprocessor PlatformsApplied System Innovation10.3390/asi80100158:1(15)Online publication date: 20-Jan-2025
https://doi.org/10.3390/asi8010015
Sharma YMoulik S(2021)SMART-EDF: An EDF based semi-partitioned energy-aware multicore scheduler for real-time systemsTENCON 2021 - 2021 IEEE Region 10 Conference (TENCON)10.1109/TENCON54134.2021.9707333(821-826)Online publication date: 7-Dec-2021
https://doi.org/10.1109/TENCON54134.2021.9707333
Talmale GShrawankar U(2021)Cluster formation techniques for hierarchical real time tasks allocation on multiprocessor systemConcurrency and Computation: Practice and Experience10.1002/cpe.643833:21Online publication date: 4-Jun-2021
https://doi.org/10.1002/cpe.6438
Senoussaoui IZahaf HBenhaoua MLipari GOlejnik RCucu-Grosjean LMedina RAltmeyer SScharbarg J(2020)Allocation of Real-Time Tasks onto Identical Core Platforms under Deferred fixed Preemption-Point ModelProceedings of the 28th International Conference on Real-Time Networks and Systems10.1145/3394810.3394821(34-43)Online publication date: 9-Jun-2020
https://dl.acm.org/doi/10.1145/3394810.3394821
Baek HKwak JLee J(2020)Non-Preemptive Real-Time Multiprocessor Scheduling Beyond Work-Conserving2020 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS49844.2020.00020(102-114)Online publication date: Dec-2020
https://doi.org/10.1109/RTSS49844.2020.00020
Baek HLee J(2020)Improved Schedulability Test for Non-Preemptive Fixed-Priority Scheduling on MultiprocessorsIEEE Embedded Systems Letters10.1109/LES.2020.296668112:4(129-132)Online publication date: 23-Nov-2020
https://dl.acm.org/doi/10.1109/LES.2020.2966681
Hasan MMohan SPellizzoni RBobba R(2018)A design-space exploration for allocating security tasks in multicore real-time systems2018 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE.2018.8342007(225-230)Online publication date: Mar-2018
https://doi.org/10.23919/DATE.2018.8342007
Han MZhang TLin YFeng ZDeng Q(2018)Global Fixed Priority Scheduling with Constructing Execution Dependency in Multiprocessor Real-Time SystemsJournal of Circuits, Systems and Computers10.1142/S021812661850165727:10(1850165)Online publication date: Sep-2018
https://doi.org/10.1142/S0218126618501657
Davis RAltmeyer SIndrusiak LMaiza CNelis VReineke J(2018)An extensible framework for multicore response time analysisReal-Time Systems10.1007/s11241-017-9285-454:3(607-661)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s11241-017-9285-4
Lee J(2017)Improved Schedulability Analysis Using Carry-In Limitation for Non-Preemptive Fixed-Priority Multiprocessor SchedulingIEEE Transactions on Computers10.1109/TC.2017.270408366:10(1816-1823)Online publication date: 1-Oct-2017
https://doi.org/10.1109/TC.2017.2704083
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents