skip to main content
research-article

Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon EDP resources

Published: 27 March 2015 Publication History

Abstract

In this paper we revisit the admission of applications upon a processor share modeled by the explicit-deadline periodic (EDP) resource-supply model. In particular, we consider applications that represent a fixed-priority sporadic task system. Existing works heavily build on the analysis of a hierarchy of preemptive task schedulers. We instead consider the feasibility of such tasks and applications for a hierarchy of deferred-preemptive schedulers, so that we can efficiently deal with the scenario where tasks and applications execute their work in non-preemptive chunks. Our model therefore gives better control over preemptions of tasks of different applications.
We present exact analysis for deferred-preemptive scheduling of tasks on EDP resources. In addition, we propose algorithms for dimensioning an application's budget tightly.

References

[1]
T. Baker. Stack-based scheduling of realtime processes. Real-Time Systems Journal, 3(1): 67--99, March 1991.
[2]
M. Behnam, T. Nolte, M. Sjodin, and I. Shin. Overrun methods and resource holding times for hierarchical scheduling of semi-independent real-time systems. IEEE TII, 6(1): 93--104, Feb. 2010.
[3]
M. Bertogna, G. Buttazzo, M. Marinoni, G. Yao, F. Esposito, and M. Caccamo. Preemption points placement for sporadic task sets. In ECRTS, pages 251--260, July 2010.
[4]
M. Bertogna, G. Buttazzo, and G. Yao. Improving feasibility of fixed priority tasks using non-preemptive regions. In RTSS, pages 251--260, Dec. 2011.
[5]
M. Bertogna, O. Xhani, M. Marinoni, F. Esposito, and G. Buttazzo. Optimal selection of preemption points to minimize preemption overhead. In ECRTS, pages 217--227, July 2011.
[6]
R. J. Bril, M. M. H. P. van den Heuvel, and J. J. Lukkien. Improved feasibility of fixed-priority scheduling with deferred preemptions using preemption thresholds for preemption points. In RTNS, pages 255--264, Oct. 2013.
[7]
A. Burns. Preemptive priority based scheduling: An appropriate engineering approach. In S. Son, editor, Advances in Real-Time Systems, pages 225--248. Prentice-Hall, 1994.
[8]
R. Davis and M. Bertogna. Optimal fixed priority scheduling with deferred pre-emption. In RTSS, pages 39--50, Dec. 2012.
[9]
R. Davis and A. Burns. Resource sharing in hierarchical fixed priority pre-emptive systems. In RTSS, pages 257--267, 2006.
[10]
Z. Deng and J.-S. Liu. Scheduling real-time applications in open environment. In RTSS, pages 308--319, Dec. 1997.
[11]
F. Dewan and N. Fisher. Approximate bandwidth allocation for fixed-priority-scheduled periodic resources. In RTAS, pages 247--256, April 2010.
[12]
A. Easwaran, M. Anand, and I. Lee. Compositional analysis framework using EDP resource models. In RTSS, pages 129--138, Dec. 2007.
[13]
P. Gai, G. Lipari, and M. Di Natale. Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In RTSS, pages 73--83, Dec. 2001.
[14]
T. M. Ghazalie and T. P. Baker. Aperiodic servers in a deadline scheduling environment. Real-Time Systems Journal, 9(1): 31--67, 1995.
[15]
J. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In RTSS, pages 201--209, Dec. 1990.
[16]
G. Lipari and E. Bini. A methodology for designing hierarchical scheduling systems. Journal of Embedded Computing, 1(2): 257--269, 2005.
[17]
C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a real-time environment. Journal of the ACM, 20(1): 46--61, Jan. 1973.
[18]
V. Lortz and K. Shin. Semaphore queue priority assignment for real-time multiprocessor synchronization. IEEE TSE, 21(10): 834--844, Oct. 1995.
[19]
T. H. C. Nguyen, N. S. Tran, V. H. Le, and P. Richard. Approximation scheme for real-time tasks under fixed-priority scheduling with deferred pre-emption. In RTNS, pages 265--274, Oct. 2013.
[20]
R. J. Bril, J. J. Lukkien, and W. F. J. Verhaegh. Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. Real-Time Systems Journal, 42(1--3): 63--119, Aug. 2009.
[21]
R. J. Bril, U. Keskin, M. Behnam, and T. Nolte. Schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited. In CRTS, Dec. 2009.
[22]
R. Santos, P. Pedreiras, M. Behnam, T. Nolte, and L. Almeida. Multi-level hierarchical scheduling in ethernet switches. In EMSOFT, pages 9--14, Oct. 2011.
[23]
G. Yao, G. Buttazzo, and M. Bertogna. Bounding the maximum length of non-preemptive regions under fixed-priority scheduling. In RTCSA, pages 351--360, Aug. 2009.

Cited By

View all
  • (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

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGBED Review
ACM SIGBED Review  Volume 12, Issue 1
Special Issue on the 6th International Workshop on Compositional Theory and Technology for Real-Time Embedded Systems
February 2015
57 pages
EISSN:1551-3688
DOI:10.1145/2752801
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 March 2015
Published in SIGBED Volume 12, Issue 1

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (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

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media