research-article

Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption

Authors:

T. H. C. Nguyen,

Pascal RichardAuthors Info & Claims

RTNS '13: Proceedings of the 21st International conference on Real-Time Networks and Systems

Pages 265 - 274

https://doi.org/10.1145/2516821.2516831

Published: 16 October 2013 Publication History

RTNS '13: Proceedings of the 21st International conference on Real-Time Networks and Systems

Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption

Pages 265 - 274

Abstract
References

Abstract

We consider real-time tasks under fixed-priority scheduling with deferred preemption (FPDS) and arbitrary deadlines. Exact response time analysis is known but exhibits to high computational cost. Effective sufficient test has been proposed under certain conditions and still subjects to pseudo-polynomial complexity. Some applications require efficiently computed response time bounds. In this paper, we provide a novel exact processor demand analysis. Based on this, we define a parametric polynomial time algorithm that both analyzes the approximate feasibility and computes the response time upper bounds. Using the resource augmentation technique, we obtain a performance guarantee that allows defining a compromise between the response-time bound and processor capacity requirements. Finally, the algorithm average behavior is analyzed through numerical experiments.

References

[1]

K. Albers and F. Slomka. An event stream driven approximation for the analysis of real-time systems. proc. Euromicro Int. Conf. on Real-Time Systems (ECRTS'04), pages 187--195, 2004.

Digital Library

[2]

K. Albers and F. Slomka. Efficient feasibility analysis for real-time systems with edf scheduling. proc. of Design, Automation and Test in Europe Conference (Date'05), 2005.

Digital Library

[3]

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

Digital Library

[4]

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

Digital Library

[5]

M. Bertogna, O. Xhani, M. Marinoni, F. Esposito, and G. Buttazzo. Optimal selection of preemption points to minimize preemption overhead. 23rd Euromicro Conf. on Real-Time Systems (ECRTS) 2011, pages 217--227, 2011.

Digital Library

[6]

E. Bini and G. Buttazzo. Measuring the performance of schedulability tests. Journal of Real-Time Systems, 30(1-2):129--154, 2005.

Digital Library

[7]

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

Digital Library

[8]

A. Burns. Preemptive priority-based scheduling: An appropriate engineering approach. In Advances in Real-Time Systems, chapter 10, pages 225--248. Prentice Hall, 1994.

Digital Library

[9]

R. Davis and A. Burns. Response time upper bounds for fixed priority real-time system. proc. IEEE Int. Symposium on Real-Time Systems (RTSS'08), 2008.

Digital Library

[10]

R. I. Davis and M. Bertogna. Optimal fixed priority scheduling with deferred pre-emption. In Proc. of the 33rd IEEE Real-Time Systems Symposium, RTSS 2012, pages 39--50, 2012.

Digital Library

[11]

F. Eisenbrand and T. Rothvoss. Static-priority real-time scheduling: Response time computation is np-hard. Proc. IEEE Int. Symposium on Real-Time Systems, 2008.

Digital Library

[12]

N. Fisher and S. Baruah. A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines. proc. Euromicro Int. Conf. on Real-Time Systems (ECRTS'05), pages 117--126, July 2005.

Digital Library

[13]

N. Fisher and S. Baruah. A polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines. Proc. Int. Conf. on Real-Time and Network Systems (RTNS'05), pages 233--249, 2005.

[14]

J. C. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in hard real-time environment. Journal of the ACM, 20(1):46--61, 1973.

Digital Library

[15]

T. Nguyen, P. Richard, and E. Bini. Approximation techniques for response-time analysis of static-priority tasks. Journal of Real-Time Systems (RTSJ'09), 43(2):147--176, oct 2009.

Digital Library

[16]

T. Nguyen, P. Richard, and N. Fisher. The fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines revisited. Proc. Int. Conf. on Real-Time and Network Systems (RTNS'10), pages 21--30, nov 2010.

[17]

T. Nguyen, N. Tran, V. Le, and P. Richard. Approximate response time bounds for fixed-priority tasks with deferred preemption. University of Engineering and Technology - Vietnam National University - Research Report, 2013.

[18]

H. Ramaprasad and F. Mueller. Tightening the bounds on feasible preemption points. In Proc. of the 27th IEEE International Real-Time Systems Symposium (RTSS), pages 212--222. IEEE Computer Society, 2006.

Digital Library

[19]

H. Ramaprasad and F. Mueller. Bounding worst-case response time for tasks with non-preemptive regions. In RTAS '08: Proc. of Real-Time and Embedded Technology and Applications Symposium, pages 58--67, April 2008.

Digital Library

[20]

P. Richard, J. Goossens, and N. Fisher. Approximate feasibility analysis and response-time bounds of static-priority tasks with release jitters. proc. Int. Real-Time and Network Systems (RTNS'07), 2007.

[21]

P. Richard, G. Kemayo, F. Ridouard, E. Grolleau, and T. H. C. Nguyen. Response time bounds for static-priority tasks and arbitrary relative deadlines with resource augmentation. ETFA 2012, pages 1--8, 2012.

[22]

G. Yao, G. Buttazzo, and M. Bertogna. Comparative evaluation of limited preemptive methods. In 2010 IEEE Conf. on Emerging Technologies and Factory Automation (ETFA), pages 1--8, 2010.

[23]

G. Yao, G. Buttazzo, and M. Bertogna. Feasibility analysis under fixed priority scheduling with limited preemptions. Real-Time Systems, 47(3):198--223, 2011.

Digital Library

Cited By

van den Heuvel MBril RLukkien J(2015)Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon EDP resourcesACM SIGBED Review10.1145/2752801.275280412:1(19-27)Online publication date: 27-Mar-2015
https://dl.acm.org/doi/10.1145/2752801.2752804
Thi Huyen Chau Nguyen Richard PGrolleau E(2015)An fptas for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource AugmentationIEEE Transactions on Computers10.1109/TC.2014.234617864:7(1805-1818)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1109/TC.2014.2346178
Ren JWu GLi XPirozmand PObaidat M(2015)Probabilistic response-time analysis for real-time systems in body area sensor networksInternational Journal of Communication Systems10.1002/dac.299028:16(2145-2166)Online publication date: 10-Nov-2015
https://dl.acm.org/doi/10.1002/dac.2990

Recommendations

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 ...
Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption

Fixed-priority scheduling with deferred preemption (FPDS) has been proposed in the literature as a viable alternative to fixed-priority pre-emptive scheduling (FPPS), that obviates the need for non-trivial resource access protocols and reduces the cost ...
Worst-Case Response Time Analysis of Real-Time Tasks under Fixed-Priority Scheduling with Deferred Preemption Revisited
ECRTS '07: Proceedings of the 19th Euromicro Conference on Real-Time Systems

Fixed-priority scheduling with deferred preemption (FPDS) has been proposed in the literature as a viable alternative to fixed-priority preemptive scheduling (FPPS), that both reduces the cost of arbitrary preemptions and removes the need for non-...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

RTNS '13: Proceedings of the 21st International conference on Real-Time Networks and Systems

October 2013

298 pages

ISBN:9781450320580

DOI:10.1145/2516821

General Chairs:
Michel Auguin
LEAT, Nice, France
,
Robert de Simone
INRIA, Sophia Antipolis, France
,
Program Chairs:
Robert Davis
University of York, UK
,
Emmanuel Grolleau
LIAS, ISAE-ENSMA, France

Copyright © 2013 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]

Sponsors

CNRS: Centre National De La Rechercue Scientifique
INRIA: Institut Natl de Recherche en Info et en Automatique

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 October 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

University of Engineering and Technology-Vietnam National University, Hanoi (VNU)

Conference

RTNS 2013

Sponsor:

CNRS
INRIA

RTNS 2013: 21st International Conference on Real-Time Networks and Systems

October 16 - 18, 2013

Sophia Antipolis, France

Acceptance Rates

RTNS '13 Paper Acceptance Rate 29 of 62 submissions, 47%;

Overall Acceptance Rate 119 of 255 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
67
Total Downloads

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

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

van den Heuvel MBril RLukkien J(2015)Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon EDP resourcesACM SIGBED Review10.1145/2752801.275280412:1(19-27)Online publication date: 27-Mar-2015
https://dl.acm.org/doi/10.1145/2752801.2752804
Thi Huyen Chau Nguyen Richard PGrolleau E(2015)An fptas for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource AugmentationIEEE Transactions on Computers10.1109/TC.2014.234617864:7(1805-1818)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1109/TC.2014.2346178
Ren JWu GLi XPirozmand PObaidat M(2015)Probabilistic response-time analysis for real-time systems in body area sensor networksInternational Journal of Communication Systems10.1002/dac.299028:16(2145-2166)Online publication date: 10-Nov-2015
https://dl.acm.org/doi/10.1002/dac.2990

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 Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten