research-article

Contention-free executions for real-time multiprocessor scheduling

Authors:

Arvind Easwaran,

Insik ShinAuthors Info & Claims

ACM Transactions on Embedded Computing Systems (TECS), Volume 13, Issue 2s

Article No.: 69, Pages 1 - 25

https://doi.org/10.1145/2494530

Published: 27 January 2014 Publication History

Abstract

A time slot is defined as contention-free if the number of jobs with remaining executions in the slot is no larger than the number of processors, or contending, otherwise. Then an important property holds that in any contention-free slot, all jobs with remaining executions are guaranteed to be scheduled as long as the scheduler is work-conserving. This article aims at improving schedulability by utilizing the contention-free slots. To achieve this, this article presents a policy (called CF policy) that moves some job executions from contending slots to contention-free ones. This policy can be employed by any work-conserving, preemptive scheduling algorithm, and we show that any algorithm extended with this policy dominates the original algorithm in terms of schedulability. We also present improved schedulability tests for algorithms that employ this policy, based on the observation that interference from jobs is reduced when their executions are postponed to contention-free slots. Simulation results demonstrate that the CF policy, incorporated into existing algorithms, significantly improves schedulability of those existing algorithms.

References

[1]

AUTOSAR. 2009. AUTOSAR release 4.0 specification. http://www.autosar.org.

[2]

Airlines Electronic Engineering Committee. 2003. ARINC specification 653-1. Aeronautical Radio, INC., Annapolis, MD.

[3]

Björn Andersson, Konstantinos Bletsas, and Sanjoy Baruah. 2008. Scheduling arbitrary-deadline sporadic task systems on multiprocessor. In Proceedings of the IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA). 197--206.

Digital Library

[4]

Theodore P. Baker. 2005. Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hand real time. Tech. rep. TR-050601. Department of Computer Science, Florida State University, Tallahasee.

[5]

Theodore P. Baker and Michele Cirinei. 2006. A necessary and sometimes sufficient condition for the feasibility of sets of sporadic hard-deadline tasks. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 178--190.

Digital Library

[6]

Theodore P. Baker, Michele Cirinei, and Marko Bertogna. 2008. EDZL scheduling analysis. Real-Time Syst. 40, 264--289.

Digital Library

[7]

Sanjoy Baruah. 2004. Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. IEEE Trans. Comput. 53, 6, 781--784.

Digital Library

[8]

Sanjoy Baruah. 2007. Techniques for multiprocessor global schedulability analysis. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 119--128.

Digital Library

[9]

S. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel. 1996. Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15, 6, 600--625.

Digital Library

[10]

Sanjoy Baruah, Aloysius Mok, and Louis Rosier. 1990. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 182--190.

[11]

Marko Bertogna and Michele Cirinei. 2007. Response-time analysis for globally scheduled symmetric multiprocessor platforms. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 149--160.

Digital Library

[12]

Marko Bertogna, Michele Cirinei, and Giuseppe Lipari. 2005. Improved schedulability analysis of EDF on multiprocessor platforms. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS). 209--218.

Digital Library

[13]

Marko Bertogna, Michele Cirinei, and Giuseppe Lipari. 2009. Schedulability analysis of global scheduling algorithms on multiprocessor platforms. IEEE Trans. Parallel Distrib. Syst. 20, 553--566.

Digital Library

[14]

Alan Burns and Sanjoy Baruah. 2008. Sustainability in real-time scheduling. J. Comput. Sci. Eng. 2, 1, 74--97.

[15]

S. Cho, S.-K. Lee, S. Ahn, and K.-J. Lin. 2002. Efficient real-time scheduling algorithms for multiprocessor systems. IEICE Trans. Commun. E85--B, 12, 2859--2867.

[16]

Robert I. Davis and Alan Burns. 2011a. FPZL schedulability analysis. In Proceedings of the IEEE Real-Time Technology and Applications Symposium (RTAS). 245--256.

Digital Library

[17]

Robert I. Davis and Alan Burns. 2011b. A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. 43, 35:1--35:44.

Digital Library

[18]

M. Dertouzos. 1974. Control robotics: The procedural control of physical processors. In Proceedings of the IFIP Congress. 807--813.

[19]

Nan Guan, Martin Sitgge, Wang Yi, and Ge Yu. 2009. New response time bounds for fixed priority multiprocessor scheduling. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 387--397.

Digital Library

[20]

Lei Ju, Samarjit Chakraborty, and Abhik Roychoudhury. 2007. Accounting for cache-related preemption delay in dynamic priority schedulability analysis. In Proceedings of the Design, Automation & Test in Europe Conference & Exhibition (DATE). 1623--1628.

Digital Library

[21]

Shinpei Kato, Nobuyoki Yamasaki, and Yutaka Ishikawa. 2009. Semi-partitioned scheduling of sporadic task systems on multiprocessors. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS). 249--258.

Digital Library

[22]

Jinkyu Lee, Arvind Easwaran, and Insik Shin. 2010. LLF schedulability analysis on multiprocessor platforms. In Proceedings of the IEEE Real-Time Systems Symposium (RTSS). 25--36.

Digital Library

[23]

Jinkyu Lee, Arvind Easwaran, and Insik Shin. 2011a. Maximizing contention-free executions in multiprocessor scheduling. In Proceedings of the IEEE Real-Time Technology and Applications Symposium (RTAS). 235--244.

Digital Library

[24]

Jinkyu Lee, Arvind Easwaran, Insik Shin, and Insup Lee. 2011b. Zero-laxity based real-time multiprocessor scheduling. J. Syst. Soft. 84, 12, 2324--2333.

Digital Library

[25]

On-line multiprocessor scheduling algorithms for real-time tasks. In Proceedings of the IEEE Region 10's 9th Annual International Conference. 607--611.

[26]

J. Y. T. Leung and J. Whitehead. 1982. On the complexity of fixed-priority scheduling of periodic real-time tasks. Perform. Eval. 2, 237--250.

[27]

J. Y.-T. Leung. 1989. A new algorithm for scheduling periodic, real-time tasks. Algorithmica 4, 209--219.

[28]

C. L. Liu and James Layland. 1973. Scheduling algorithms for multi-programming in a hard-real-time environment. J. ACM 20, 1, 46--61.

Digital Library

[29]

Aloysius Mok. 1983. Fundamental design problems of distributed systems for the hard-real-time environment. Ph.D. Dissertation, Massachusetts Institute of Technology.

Digital Library

[30]

Minkyu Park, Sangchul Han, Heeheon Kim, Seongje Cho, and Yookun Cho. 2005. Comparison of deadline-based scheduling algorithms for periodic real-time tasks on multiprocessor. IEICE Trans. Info. Syst. E88-D, 658--661.

Digital Library

[31]

Anand Srinivasan and Sanjoy Baruah. 2002. Deadline-based scheduling of periodic task systems on multiprocessors. Info. Process. Lett. 84, 2, 93--98.

Digital Library

[32]

C. H. (Kees) van Berkel. 2009. Multi-core for mobile phones. In Proceedings of the Design, Automation & Test in Europe Conference & Exhibition (DATE). 1260--1265.

Digital Library

Cited By

Baek HLee J(2023)Contention-Free Scheduling for Single Preemption Multiprocessor PlatformsMathematics10.3390/math1116354711:16(3547)Online publication date: 16-Aug-2023
https://doi.org/10.3390/math11163547
Baek HLee K(2020)Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time SystemSymmetry10.3390/sym1209151512:9(1515)Online publication date: 14-Sep-2020
https://doi.org/10.3390/sym12091515
Baek HShin KLee J(2020)Response-Time Analysis for Multi-Mode Tasks in Real-Time Multiprocessor SystemsIEEE Access10.1109/ACCESS.2020.29928688(86111-86129)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2992868
Show More Cited By

Index Terms

Contention-free executions for real-time multiprocessor scheduling
1. Computer systems organization
  1. Embedded and cyber-physical systems
  2. Real-time systems
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Scheduling

Recommendations

Global EDF-based scheduling with laxity-driven priority promotion

This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based ...
Maximizing Contention-Free Executions in Multiprocessor Scheduling
RTAS '11: Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium

It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with each other for processors, and this could produce more contention-free slots ...
Capturing urgency and parallelism using quasi-deadlines for real-time multiprocessor scheduling

We introduce a multiprocessor scheduling parameter called quasi-deadline.We propose two scheduling algorithms, called EQDF and EQDZL.We derive new schedulability analysis tests for EQDF and EQDZL.We address the problem of priority assignment under EQDF ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems

ACM Transactions on Embedded Computing Systems Volume 13, Issue 2s

Special Section ESFH'12, ESTIMedia'11 and Regular Papers

January 2014

409 pages

ISSN:1539-9087

EISSN:1558-3465

DOI:10.1145/2544375

Editors:
Naehyuck Chang
Seoul National University (SNU), Korea
,
Jian-Jia Chen
Karlsruhe Institute of Technology (KIT), Germany

Issue’s Table of Contents

Copyright © 2014 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: 27 January 2014

Accepted: 01 July 2013

Revised: 01 December 2012

Received: 01 July 2012

Published in TECS Volume 13, Issue 2s

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

BRL (2009-0086964)
BSRP (2010-0006650, 2012-R1A1A1014930)
KEIT (2011-10041313)
Nanyang Technological University
National IT Industry Promotion Agency
Ministry of Science, ICT and Future Planning
Korea Institute for Advancement of Technology
Ministry of Education, Science and Technology

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
223
Total Downloads

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

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Baek HLee J(2023)Contention-Free Scheduling for Single Preemption Multiprocessor PlatformsMathematics10.3390/math1116354711:16(3547)Online publication date: 16-Aug-2023
https://doi.org/10.3390/math11163547
Baek HLee K(2020)Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time SystemSymmetry10.3390/sym1209151512:9(1515)Online publication date: 14-Sep-2020
https://doi.org/10.3390/sym12091515
Baek HShin KLee J(2020)Response-Time Analysis for Multi-Mode Tasks in Real-Time Multiprocessor SystemsIEEE Access10.1109/ACCESS.2020.29928688(86111-86129)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2992868
Baek HLee J(2019)Task-Level Re-Execution Framework for Improving Fault Tolerance on Symmetry MultiprocessorsSymmetry10.3390/sym1105065111:5(651)Online publication date: 9-May-2019
https://doi.org/10.3390/sym11050651
Baek HBaek J(2019)Response-Time Analysis for Contention-Free Fixed-Priority Scheduling AlgorithmThe Journal of Korean Institute of Information Technology10.14801/jkiit.2019.17.9.3117:9(31-40)Online publication date: 30-Sep-2019
https://doi.org/10.14801/jkiit.2019.17.9.31
Baek HLee J(2019)Improved Schedulability Analysis of the Contention-Free Policy for Real-Time SystemsJournal of Systems and Software10.1016/j.jss.2019.04.067Online publication date: Apr-2019
https://doi.org/10.1016/j.jss.2019.04.067
BAEK HLIM DLEE J(2018)Proof and Evaluation of Improved Slack Reclamation for Response Time Analysis of Real-Time Multiprocessor SystemsIEICE Transactions on Information and Systems10.1587/transinf.2017EDL8260E101.D:8(2136-2140)Online publication date: 1-Aug-2018
https://doi.org/10.1587/transinf.2017EDL8260
Baek H(2018)Multi-Level Contention-Free Policy for Rate Monotonic Scheduling Algorithm on Real-Time SystemsThe Journal of Korean Institute of Information Technology10.14801/jkiit.2018.16.2.2916:2(29-38)Online publication date: 28-Feb-2018
https://doi.org/10.14801/jkiit.2018.16.2.29
Baek HLee JShin I(2018)Multi-level contention-free policy for real-time multiprocessor schedulingJournal of Systems and Software10.1016/j.jss.2017.11.027137(36-49)Online publication date: Mar-2018
https://doi.org/10.1016/j.jss.2017.11.027
Ghavidel ANik SHajibegloo MNaghibzadeh M(2015)DARTS: DynAmic Real-time Task Scheduling2015 7th Conference on Information and Knowledge Technology (IKT)10.1109/IKT.2015.7288767(1-6)Online publication date: May-2015
https://doi.org/10.1109/IKT.2015.7288767
Show More Cited By

View Options

Get Access

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.

Media

Figures

Other

Tables

View Issue’s Table of Contents