research-article

Optimizing Preemption-Overhead Accounting in Multiprocessor Real-Time Systems

Authors:

Abhilash Thekkilakattil,

James H. AndersonAuthors Info & Claims

RTNS '14: Proceedings of the 22nd International Conference on Real-Time Networks and Systems

Pages 235 - 243

https://doi.org/10.1145/2659787.2659811

Published: 08 October 2014 Publication History

Abstract

There exist two general techniques to account for preemption-related overheads on multiprocessors. This paper presents a new preemption-related overhead-accounting technique, called analytical redistribution of preemption overheads (ARPO), which integrates the two previous techniques to minimize preemption-overhead-related utilization loss. ARPO is applicable under any job-level fixed priority (JLFP) preemptive scheduler, as well as some limited-preemption schedulers. ARPO is evaluated in a new experimental-design framework for overhead-aware schedulability studies that addresses unrealistic simplifying assumptions made in previous studies, and is shown to improve real-time schedulability.

References

[1]

T. Baker. Multiprocessor EDF and deadline monotonic schedulability analysis. In Real-Time Systems Symposium (RTSS), December 2003.

Digital Library

[2]

S. Baruah. The limited-preemption uniprocessor scheduling of sporadic task systems. In Euromicro Conference on Real-Time Systems (ECRTS), 2005.

Digital Library

[3]

S. Baruah, V. Bonifaci, A. Marchetti-Spaccamela, and S. Stiller. Improved multiprocessor global schedulability analysis. Real-Time Systems, 2010.

Digital Library

[4]

S. Baruah, J. Gehrke, and G. Plaxton. Fast scheduling of periodic tasks on multiple resources. In Parallel Processing Symposium, 1995.

Digital Library

[5]

S. Baruah, A. Mok, and L. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Real-Time Systems Symposium (RTSS), 1990.

[6]

A. Bastoni, B. Brandenburg, and J. Anderson. Cache-related preemption and migration delays: Empirical approximation and impact on schedulability. In The Workshop on Operating Systems Platforms for Embedded Real-Time applications (OSPERT), 2010.

[7]

M. Bertogna, G. Buttazzo, M. Marinoni, G. Yao, F. Esposito, and M. Caccamo. Preemption points placement for sporadic task sets. In Euromicro Conference on Real-Time Systems (ECRTS), 2010.

Digital Library

[8]

M. Bertogna and M. Cirinei. Response-time analysis for globally scheduled symmetric multiprocessor platforms. In Real-Time Systems Symposium (RTSS), 2007.

Digital Library

[9]

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

Digital Library

[10]

B. Bui, M. Caccamo, L. Sha, and J. Martinez. Impact of cache partitioning on multi-tasking real time embedded systems. In Embedded and Real-Time Computing Systems and Applications (RTCSA), 2008.

Digital Library

[11]

A. Burns, K. Tindell, and A. Wellings. Effective analysis for engineering real-time fixed priority schedulers. Transactions on Software Engineering, 1995.

Digital Library

[12]

J. V. Busquets-Mataix., J. J. Serrano, R. Ors, P. Gil, and A. Wellings. Adding instruction cache effect to schedulability analysis of preemptive real-time systems. In Real-Time Technology and Applications Symposium (RTAS), 1996.

Digital Library

[13]

G. Buttazzo. Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series). Springer-Verlag TELOS, Santa Clara, CA, USA, 2004.

Digital Library

[14]

G. Buttazzo, M. Bertogna, and G. Yao. Limited preemptive scheduling for real-time systems: A survey. Transactions on Industrial Informatics, 2012.

[15]

R. Davis, A. Burns, J. Marinho, V. Nelis, S. Petters, and M. Bertogna. Global fixed priority scheduling with deferred pre-emption. In Embedded and Real-Time Computing Systems and Applications (RTCSA), 2013.

[16]

J. Erickson, J. Anderson, and B. Ward. Fair lateness scheduling: Reducing maximum lateness in G-EDF-like scheduling. Real-Time Systems, 2014.

Digital Library

[17]

J. Goossens, S. Funk, and S. Baruah. Priority-driven scheduling of periodic task systems on multiprocessors. 2003.

[18]

M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal, 1986.

[19]

C. Lee, J. Hahn, Y. Seo, S. Min, R. Ha, S. Hong, C. Park, M. Lee, and C. Kim. Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. Transactions on Computers, 1998.

Digital Library

[20]

B. Lisper and P. Mellgren. Response-time calculation and priority assignment with integer programming methods. In Work-in-progress and Industrial Sessions, Euromicro Conference on Real-Time Systems, June 2001.

[21]

J. Liu. Real-Time Systems. Prentice Hall PTR, Upper Saddle River, NJ, USA, 1st edition, 2000.

[22]

L. Lundberg. Multiprocessor scheduling of age constraint processes. In Real-Time Computing Systems and Applications (RTCSA), 1998.

Digital Library

[23]

W. Lunniss, S. Altmeyer, and R. Davis. A comparison between fixed priority and EDF scheduling accounting for cache related pre-emption delays. Leibniz Transactions on Embedded Systems, 2014.

[24]

J. Marinho, V. Nelis, S. Petters, M. Bertogna, and R. Davis. Limited pre-emptive global fixed task priority. In Real-Time Systems Symposium (RTSS), 2013.

Digital Library

[25]

C. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation (extended abstract). In ACM Symposium on Theory of Computing, 1997.

Digital Library

[26]

P. Regnier, G. Lima, E. Massa, G. Levin, and S. Brandt. RUN: Optimal multiprocessor real-time schedluing via reduction to uniprocessor. In Real-Time Systems Symposium (RTSS), 2011.

Digital Library

[27]

J. Staschulat, S. Schliecker, and R. Ernst. Scheduling analysis of real-time systems with precise modeling of cache related preemption delay. In Euromicro Conference on Real-Time Systems (ECRTS), 2005.

Digital Library

[28]

Y. Tan and V. Mooney. Timing analysis for preemptive multitasking real-time systems with caches. In Transactions on Embedded Computing Systems, 2007.

Digital Library

[29]

A. Thekkilakattil, S. Baruah, R. Dobrin, and S. Punnekkat. The global limited preemptive earliest deadline first feasibility of sporadic real-time tasks. In Euromicro Conference on Real-Time Systems (ECRTS), 2014.

Digital Library

[30]

B. Ward, A. Thekkilakattil, and J. Anderson. Optimizing preemption-overhead accounting in multiprocessor real-time systems (online appendix). 2014. http://www.cs.unc.edu/~anderson/papers.html.

Digital Library

[31]

M. Xu, L. Phan, I. Lee, O. Sokolsky, S. Xi, C. Lu, and C. Gill. Cache-aware compositional analysis of real-time multicore virtualization platforms. In Real-Time Systems Symposium (RTSS), 2013.

Digital Library

Cited By

Nguyen VHardy DPuaut I(2019)Cache-conscious off-line real-time scheduling for multi-core platforms: algorithms and implementationReal-Time Systems10.1007/s11241-019-09333-zOnline publication date: 6-Mar-2019
https://doi.org/10.1007/s11241-019-09333-z
Berlińska J(2018)Scheduling Data Gathering with Maximum Lateness ObjectiveParallel Processing and Applied Mathematics10.1007/978-3-319-78054-2_13(135-144)Online publication date: 23-Mar-2018
https://doi.org/10.1007/978-3-319-78054-2_13
Xu MPhan LChoi HLee I(2016)Analysis and Implementation of Global Preemptive Fixed-Priority Scheduling with Dynamic Cache Allocation2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)10.1109/RTAS.2016.7461322(1-12)Online publication date: Apr-2016
https://doi.org/10.1109/RTAS.2016.7461322
Show More Cited By

Index Terms

Optimizing Preemption-Overhead Accounting in Multiprocessor 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. Contextual software domains
      1. Operating systems
        Process management
    2. Software system structures
      1. Embedded software
      2. Real-time systems software

Recommendations

A technique to reduce preemption overhead in real-time multiprocessor task scheduling
ACSAC'05: Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture

Partitioning and global scheduling are two approaches for scheduling real-time tasks in multiprocessor environments. Partitioning is the more favored approach, although it is sub-optimal. This is mainly due to the fact that popular uniprocessor real-...
Schedulability issues for EDZL scheduling on real-time multiprocessor systems

EDZL (Earliest Deadline first until Zero Laxity) is an efficient and practical scheduling algorithm on multiprocessor systems. It has a comparable number of context switch to EDF (Earliest Deadline First) and its schedulable utilization seems to be ...
Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption
Special Issue on Embedded Platforms for Crypto and Regular Papers

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 ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

RTNS '14: Proceedings of the 22nd International Conference on Real-Time Networks and Systems

October 2014

335 pages

ISBN:9781450327275

DOI:10.1145/2659787

General Chairs:
Mathieu Jan
CEA LIST, Gif-sur-Yvette, France
,
Belgacem Ben Hedia
CEA LIST, Gif-sur-Yvette, France
,
Program Chairs:
Joël Goossens
Université Libre de Bruxelles, Belgium
,
Claire Maiza
Grenoble INP / Verimag, France

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 the author(s) 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].

In-Cooperation

CEA: Commissariat à l'énergie atomique et aux énergies alternatives
GDR ASR: GDR Architecture, Systèmes et Réseaux

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 October 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Research
Refereed limited

Conference

RTNS '14

RTNS '14: 22nd International Conference on Real-Time Networks and Systems

October 8 - 10, 2014

Versaille, France

Acceptance Rates

Overall Acceptance Rate 119 of 255 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
64
Total Downloads

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

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Nguyen VHardy DPuaut I(2019)Cache-conscious off-line real-time scheduling for multi-core platforms: algorithms and implementationReal-Time Systems10.1007/s11241-019-09333-zOnline publication date: 6-Mar-2019
https://doi.org/10.1007/s11241-019-09333-z
Berlińska J(2018)Scheduling Data Gathering with Maximum Lateness ObjectiveParallel Processing and Applied Mathematics10.1007/978-3-319-78054-2_13(135-144)Online publication date: 23-Mar-2018
https://doi.org/10.1007/978-3-319-78054-2_13
Xu MPhan LChoi HLee I(2016)Analysis and Implementation of Global Preemptive Fixed-Priority Scheduling with Dynamic Cache Allocation2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)10.1109/RTAS.2016.7461322(1-12)Online publication date: Apr-2016
https://doi.org/10.1109/RTAS.2016.7461322
Keskar RDeshpande U(2015)Multiprocessor Scheduling with Cache Related Preemption Delays2015 Fifth International Conference on Communication Systems and Network Technologies10.1109/CSNT.2015.102(869-875)Online publication date: Apr-2015
https://doi.org/10.1109/CSNT.2015.102
Thekkilakattil ADobrin RPunnekkat S(2015)The limited-preemptive feasibility of real-time tasks on uniprocessorsReal-Time Systems10.1007/s11241-015-9222-351:3(247-273)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1007/s11241-015-9222-3

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 Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents