research-article

Bandwidth allocation for fixed-priority-scheduled compositional real-time systems

Authors:

Nathan FisherAuthors Info & Claims

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

Article No.: 91, Pages 1 - 29

https://doi.org/10.1145/2560038

Published: 10 March 2014 Publication History

Abstract

Recent research in compositional real-time systems has focused on determination of a component's real-time interface parameters. An important objective in interface-parameter determination is minimizing the bandwidth allocated to each component of the system while simultaneously guaranteeing component schedulability. With this goal in mind, in this article, we explore fixed-priority schedulability in compositional setting. First we derive an efficient exact test based on iterative convergence for sporadic task systems scheduled by fixed-priority (e.g., deadline monotonic, rate monotonic) upon an explicit-deadline periodic (EDP) resource. Then we address the time complexity of the exact test by developing a fully-polynomial-time approximation scheme (FPTAS) for allocating bandwidth to components. Our parametric algorithm takes the task system and an accuracy parameter ε > 0 as input and returns a bandwidth which is guaranteed to be at most a factor (1 + ε) times the optimal minimum bandwidth required to successfully schedule the task system. We perform thorough simulation over synthetically generated task systems to compare the performance of our proposed efficient-exact and the approximate algorithm and observe a significant decrease in runtime and a very small relative error when comparing the approximate algorithm with the exact algorithm and the sufficient algorithm.

References

[1]

Masud Ahmed, Nathan Fisher, Shengquan Wang, and Pradeep Hettiarachchi. 2011. Minimizing peak temperature in embedded real-time systems via thermal-aware periodic resources. Sustain. Comput. Inf. Syst. 1, 3, 226--240.

[2]

Karsten Albers, Frank Bodmann, and Frank Slomka. 2008. Advanced Hierarchical event-stream model. In Proceedings of the EuroMicro Conference on Real-Time Systems. IEEE Computer Society, 211--220.

Digital Library

[3]

Luis Almeida and Paulo Pedreiras. 2004. Scheduling within temporal partitions: Response-time analysis and server design. In Proceedings of the 4th ACM International Conference on Embedded Software. ACM, New York, NY, 95--103.

Digital Library

[4]

N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings. 1993. Applying new scheduling theory to static priority preemptive scheduling. Softw. Eng. J. 8, 5, 285--292.

[5]

N. C. Audsley, A. Burns, M. F. Richardson, and A. J. Wellings. 1991. Hard real-time scheduling: The deadline monotonic approach. In Proceedings of the 8th IEEE Workshop on Real-Time Operating Systems and Software. 127--132.

[6]

S. Baruah, R. Howell, and L. Rosier. 1993. Feasibility problems for recurring tasks on one processor. Theor. Comput. Sci. 118, 1, 3--20.

Digital Library

[7]

G. Bernat and A. Burns. 1999. New results on fixed priority aperiodic servers. In Proceedings of the IEEE Real-Time Systems Symposium. 68--78.

Digital Library

[8]

Enrico Bini and Sanjoy Baruah. 2007. Efficient computation of response time bounds under fixed-priority scheduling. In Proceedings of the 15th International Conference on Real-Time Systems. 95--104.

[9]

E. Bini and G. Buttazzo. 2004. Biasing effects in schedulability measures. In Proceedings of the 16th Euromicro Conference on Real-Time Systems. IEEE Computer Society, 196--203.

Digital Library

[10]

R. I. Davis, A. Zabos, and A. Burns. 2008. Efficient exact schedulability tests for fixed priority real-time systems. IEEE Trans. Comput. 57, 9.

Digital Library

[11]

Z. Deng and J. Liu. 1997. Scheduling real-time applications in an open environment. In Proceedings of the 18th IEEE Real-Time Systems Symposium. IEEE Computer Society, 308--319.

Digital Library

[12]

Farhana Dewan and Nathan Fisher. 2010. Approximate bandwidth allocation for fixed-priority-scheduled periodic resources. In Proceedings of the 16th IEEE Real-Time Technology and Applications Symposium (RTAS). IEEE.

Digital Library

[13]

Farhana Dewan and Nathan Fisher. 2012a. Bandwidth allocation for fixed-priority-scheduled compositional real-time systems (extended version). Tech. rep. Wayne State University.

[14]

Farhana Dewan and Nathan Fisher. 2012b. Fixed-priority schedulability of arbitrary-deadline sporadic tasks upon periodic resources. In Proceedings of the IEEE 18th International Conference on Embedded and Real-Time Computing System and Applications.

Digital Library

[15]

Arvind Easwaran. 2007 Compositional schedulability analysis supporting associativity, optimality, dependency and concurrency. Ph.D. Dissertation. University of Pennsylvania, Philadelphia, PA.

[16]

Arvind Easwaran, Madhukar Anand, and Insup Lee. 2007. Compositional analysis framework using EDP resource models. In Proceedings of the IEEE Real-time Systems Symposium. IEEE Computer Society.

Digital Library

[17]

Arvind Easwaran, Insup Lee, Oleg Sokolsky, and Steve Vestal. 2009. A compositional scheduling framework for digital avionics systems. In Proceedings of the International Workshop on Real-Time Computing Systems and Applications. 371--380.

Digital Library

[18]

Xiang (Alex) Feng and Al Mok. 2002. A model of hierarchical real-time virtual resources. In Proceedings of the IEEE Real-Time Systems Symposium. IEEE Computer Society, 26--35.

Digital Library

[19]

Nathan Fisher. 2009. An FPTAS for interface selection in the periodic resource model. In Proceedings of the 17th International Conference on Real-Time and Network Systems.

[20]

Nathan Fisher and Sanjoy Baruah. 2005. A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems. In Proceedings of the EuroMicro Conference on Real-Time Systems. IEEE Computer Society.

Digital Library

[21]

Nathan Fisher and Farhana Dewan. 2012. A bandwidth allocation scheme for compositional real-time systems with periodic resources. Real-Time Syst. 48, 3, 223--263.

Digital Library

[22]

Pradeep M. Hettiarachchi, Nathan Fisher, Masud Ahmed, Le Yi Wang, Shinan Wang, and Weisong Shi. 2012. The design and analysis of thermal-resilient hard-real-time systems. In Proceeding of the IEEE Real-Time and Embedded Technology and Applications Symposium. 67--76.

Digital Library

[23]

J. Lehoczky, L. Sha, and Y. Ding. 1989. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of the Real-Time Systems Symposium. IEEE Computer Society, 166--171.

[24]

J. Lehoczky, L. Sha, and J. Stronider. 1987. Enhanced aperiodic responsiveness in hard real-time environments. In Proceedings of the Real-Time Systems Symposium. IEEE, 261--270.

[25]

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

[26]

Giuseppe Lipari and Enrico Bini. 2003. Resource partitioning among real-time applications. In Proceedings of the EuroMicro Conference on Real-Time Systems. IEEE Computer Society, 151--160.

[27]

A. Mok. 1988. Task management techniques for enforcing ED scheduling on a periodic task set. In Proceedings of the 5th IEEE Workshop on Real-Time Software and Operating Systems. 42--46.

[28]

A. K. Mok. 1983. Fundamental design problems of distributed systems for the hard-real-time environment. Ph.D. Dissertation. Laboratory for Computer Science, Massachusetts Institute of Technology. (Tech. rep. No. MIT/LCS/TR-297.)

Digital Library

[29]

C. Okwudire, M. van den Heuvel, R. Bril, and J. Lukkien. 2010. Exploiting harmonic periods to improve linearly approximated response-time upper bounds. In Proceedings of the IEEE Conference on Emerging Technologies and Factory Automation (ETFA). 1--4.

[30]

Raj Rajkumar, Kanaka Juvva, Anastasio Molano, and Shuichi Oikawa. 2001. Resource kernels: A resource-centric approach to real-time and multimedia systems. In Readings in Multimedia Computing and Networking, Morgan Kaufmann Publishers Inc., San Francisco, CA, 476--490.

Digital Library

[31]

Insik Shin, Arvind Easwaran, and Insup Lee. 2008. Hierarchical scheduling framework for virtual clustering of multiprocessors. In Proceedings of the EuroMicro Conference on Real-Time Systems. IEEE Computer Society.

Digital Library

[32]

Insik Shin and Insup Lee. 2003. Periodic resource model for compositional real-time guarantees. In Proceedings of the IEEE Real-Time Systems Symposium. IEEE Computer Society, 2--13.

Digital Library

[33]

Insik Shin and Insup Lee. 2004. Compositional real-time scheduling framework. In Proceedings of the IEEE Real-Time Systems Symposium. IEEE Computer Society, 57--67.

Digital Library

[34]

Insik Shin and Insup Lee. 2008. Compositional real-time scheduling framework with periodic model. ACM Trans. Embed. Comput. Syst. 7, 3.

Digital Library

[35]

Mikael Sjödin and Hans Hansson. 1998. Improved response-time analysis calculations. In Proceedings of the 19th IEEE Real-Time Systems Symposium (RTSS). 399--408.

Digital Library

[36]

B. Sprunt, J. Lehoczky, and L. Sha. 1888 Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm. In Proceedings of the Real-Time Systems Symposium. 251--258.

[37]

B. Sprunt, L. Sha, and J. P. Lehoczky. 1989. Aperiodic task scheduling for hard real-time systems. Real-Time Syst. 1, 1, 27--69.

[38]

J. Strosnider, J. Lehoczky, and L. Sha. 1995. The deferrable server algorithm for enhancing aperiodic responsiveness in hard-real-teime environments. IEEE Trans. Comput. 44, 1.

Digital Library

[39]

Martijn M. M. H. P. van den Heuvel, Pieter J. L. Cuijpers, Johan J. Lukkien, and Nathan Fisher. 2012. Revised budget allocations for fixed-priority-scheduled periodic resources. CS-report 12-03, Technische Universiteit Eindhoven (TU/e).

Cited By

Salman SPapadopoulos AMubeen SNolte T(2022)Multi-processor scheduling of elastic applications in compositional real-time systemsJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2021.102358122:COnline publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1016/j.sysarc.2021.102358
Salman SMubeen SMarkovic FPapadopoulos ANolte T(2021)Scheduling Elastic Applications in Compositional Real-Time Systems2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )10.1109/ETFA45728.2021.9613375(1-8)Online publication date: 7-Sep-2021
https://doi.org/10.1109/ETFA45728.2021.9613375
Chen HZhang WLyu Y(2020)Research on Partition Parameter Design Method for Integrated Modular Avionics Based on MOEA/D-ADVIEEE Access10.1109/ACCESS.2020.30029728(117278-117297)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3002972
Show More Cited By

Index Terms

Bandwidth allocation for fixed-priority-scheduled compositional real-time systems
1. Computer systems organization
  1. Embedded and cyber-physical systems
    1. Embedded systems
  2. Real-time systems
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Embedded software
      2. Real-time systems software

Recommendations

Preference-oriented fixed-priority scheduling for periodic real-time tasks

A preference priority assignment (PPA) scheme that explicitly incorporates the ASAP and ALAP execution preferences of periodic real-time tasks is proposed.An online dual-queue based preference-oriented fixed- priority (POFP) scheduler is proposed 4, ...
A bandwidth allocation scheme for compositional real-time systems with periodic resources

Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. State-of-the-art algorithms for bandwidth allocation use either exponential-time or pseudo-polynomial-time techniques for exact allocation, or linear-...
Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors

Abstract--In fixed-priority scheduling, the priority of a job, once assigned, may not change. A new fixed-priority algorthm for scheduling systems of periodic tasks upon identical multiprocessors is proposed. This algorithm has an achievable utilization ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems

ACM Transactions on Embedded Computing Systems Volume 13, Issue 4

Regular Papers

November 2014

647 pages

ISSN:1539-9087

EISSN:1558-3465

DOI:10.1145/2592905

Editor:
Sandeep K. Shukla
Virginia Tech, USA

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: 10 March 2014

Accepted: 01 October 2013

Revised: 01 February 2013

Received: 01 August 2012

Published in TECS Volume 13, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
157
Total Downloads

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

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Salman SPapadopoulos AMubeen SNolte T(2022)Multi-processor scheduling of elastic applications in compositional real-time systemsJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2021.102358122:COnline publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1016/j.sysarc.2021.102358
Salman SMubeen SMarkovic FPapadopoulos ANolte T(2021)Scheduling Elastic Applications in Compositional Real-Time Systems2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )10.1109/ETFA45728.2021.9613375(1-8)Online publication date: 7-Sep-2021
https://doi.org/10.1109/ETFA45728.2021.9613375
Chen HZhang WLyu Y(2020)Research on Partition Parameter Design Method for Integrated Modular Avionics Based on MOEA/D-ADVIEEE Access10.1109/ACCESS.2020.30029728(117278-117297)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3002972
Park JLee ISokolsky OHwang DAhn SChoi JKang I(2017)A process algebraic approach to the schedulability analysis and workload abstraction of hierarchical real-time systemsJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2017.07.00192(1-18)Online publication date: Nov-2017
https://doi.org/10.1016/j.jlamp.2017.07.001

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