article

Computing periodic request functions to speed-up the analysis of non-cyclic task models

Authors:

Marco Di NataleAuthors Info & Claims

Real-Time Systems, Volume 51, Issue 4

Pages 360 - 394

https://doi.org/10.1007/s11241-014-9209-5

Published: 01 July 2015 Publication History

Abstract

Tasks are units of sequential code implementing the system actions and executed concurrently by an operating system. Techniques have been developed to determine, at design time, whether a set of tasks can safely complete before their deadlines. Several models have been proposed to represent conditional executions and dependencies among concurrent tasks for the purpose of schedulability analysis. Among them, task graphs with cyclic recurrent behavior (i.e., those modeled with a single source vertex and a period parameter specifying the minimum amount of time that must elapse between successive activations of the source job) allow for efficient schedulability analysis based on the periodicity of the request and demand bound functions (rbf and dbf). In this paper, we leverage results from max-plus algebra to identify a recurrent term in rbf and dbf of general task graph models, even when the execution is neither recurrent nor controlled by a period parameter. As such, the asymptotic complexity of calculating rbf and dbf is independent from the length of the time interval. Experimental results demonstrate significant improvements on the runtime for system schedulability analysis.

References

[1]

Anand M, Easwaran A, Fischmeister S, Lee I (2008) Compositional feasibility analysis of conditional real-time task models. In: Proceedings of the 11th IEEE international symposium on object oriented real-time distributed computing, pp 391-398, May 2008.

[2]

Axer P, Quinton S, Neukirchner M, Ernst R, Döbel B, Härtig H (2013) Response-time analysis of parallel fork-join workloads with real-time constraints. In: Proceedings of the 25th euromicro workshop on real-time systems, pp 215-224, July 2013.

[3]

Baccelli F, Cohen G, Olsder G, Quadrat J (1992) Synchronization and linearity: an algebra for discrete event systems. Wiley, New York

[4]

Baruah S (1998) Feasibility analysis of recurring branching tasks. In: Proceedings of the 10th Euromicro Workshop on Real-Time Systems, pp 138-145, June 1998.

[5]

Baruah S, Chen D, Gorinsky S, Mok A (1999) Generalized multiframe tasks. Real-Time Syst 17(1):5-22

Digital Library

[6]

Baruah S (2003) Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Syst 24(1):93-128, January 2003.

Digital Library

[7]

Baruah S (2010) The non-cyclic recurring real-time task model. In Proceedings of the 31st IEEE Real-Time Systems Symposium, pp 173-182, December 2010.

Digital Library

[8]

Baruah S, Bonifaci V, Marchetti-Spaccamela A, Stougie L, Wiese A (2012) A generalized parallel task model for recurrent real-time processes. In Proceedings of the 33rd IEEE real-time systems symposium, pp 63-72, December 2012.

[9]

Balcer Y, Veinott AF (1973) Computing a graph's period quadratically by node condensation. Discret Math 4(4):295-303

Digital Library

[10]

Bonifaci V, Marchetti-Spaccamela A, Stougie L, Wiese A (2013) Feasibility analysis in the sporadic DAG task model. In Proceedings of the 25th euromicro conference on real-time systems, pp 225-233, July 2013.

[11]

Charron-Bost B, Függer M, Nowak T (2011) On the transience of linear max-plus dynamical systems. Comput Res Repos (CoRR). arXiv:1111.4600 2011.

[12]

Dasdan A (2004) Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Trans Design Autom Electron Syst 9(4):385-418, October 2004.

Digital Library

[13]

Fersman E, Krcal P, Pettersson P, Yi W (August 2007) Task automata: schedulability, decidability and undecidability. Inform Comput 205(8):1149-1172

Digital Library

[14]

Floyd R (1962) Algorithm 97: shortest path. Commun ACM 5(6):345, June 1962.

[15]

Gavalec M (2000) Linear matrix period in max-plus algebra. Linear Algebra Appl 307(1-3):167-182, March 2000.

[16]

Gavalec M (2000b) Polynomial algorithm for linear matrix period in max-plus algebra. Central Eur J Oper Res 8(3):247-258, 2000.

[17]

Hartmann M, Arguelles C (May 1999) Transience bounds for long walks. Math Oper Res 24(2):414-439

[18]

Henia R, Hamann A, Jersak M, Racu R, Richter K, Ernst R (March 2005) System level performance analysis¿the SymTA/S approach. IEE Proc Comput Digital Techn 152(2):148-166

[19]

Karp R (1978) A characterization of the minimum cycle mean in a digraph. Discret Math 23(3):309-311, 1978.

[20]

Künzli S, Hamann A, Ernst R, Thiele L (2007) Combined approach to system level performance analysis of embedded systems. In: Proceedings of the IEEE/ACM/IFIP international conference on hardware/software codesign and system synthesis, pp 63-68, September 2007.

[21]

Liu CL, Layland JW (January 1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20(1):46-61

Digital Library

[22]

Norström C, Wall A, Yi W (1999) Timed automata as task models for event-driven systems. In: Proceedings of the 6th conference on real-time computing systems and applications, pp 182-189, 1999.

[23]

Mok AK, Chen D (1996) A multiframe model for real-time tasks. In Proceedings of the 17th IEEE real-time systems symposium, pp 22-29, December 1996.

[24]

Molnárová M (2003) Computational complexity of nachtigall's representation. Optimization 52(1):93-104, 2003.

[25]

Molnárová M (2005) Generalized matrix period in max-plus algebra. Linear Algebra Appl 404:345-366, July 2005.

[26]

Moyo NT, Nicollet E, Lafaye F, Moy C (2010) On schedulability analysis of non-cyclic generalized multi-frame tasks. In: Proceedings of the 22nd euromicro conference on real-time systems, pp 271-278, July 2010.

[27]

Saifullah A, Agrawal K, Lu C, Gill C (2011) Multi-core real-time scheduling for generalized parallel task models. In: Proceedings of the 32nd IEEE real-time systems symposium, pp 217-226, December 2011.

[28]

Stigge M, Ekberg P, Guan N, Yi W (2011) The digraph real-time task model. In: Proceedings of the 16th IEEE real-time and embedded technology and applications symposium, pp 71-80, April 2011.

[29]

Stigge M, Ekberg P, Guan N, Yi W (2011b) On the tractability of digraph-based task models. In: Proceedings of the 23rd euromicro conference on real-time systems, pp 162-171, July 2011.

[30]

Stigge M, Yi W (2012) Hardness results for static priority real-time scheduling. In: Proceedings of the 24th euromicro conference on real-time systems, pp 189-198, July 2012.

[31]

Stigge M, Yi W (2013) Combinatorial abstraction refinement for feasibility analysis. In Proceedings of the 34th IEEE real-time systems symposium, pp 340-349, December 2013.

[32]

Tarjan, R E (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146-160, 1972.

Digital Library

[33]

Thiele L, Chakraborty S, Naedele M (2000) Real-time calculus for scheduling hard real-time systems. In Proceedings of the IEEE international symposium on circuits and systems, pp 101-104, 2000.

[34]

Wandeler E, Thiele L (2006) Real-time calculus (RTC) toolbox. http://www.mpa.ethz.ch/Rtctoolbox. Accessed 17 March 2014

[35]

Young N, Tarjant R, Orlin J (March 1991) Faster parametric shortest path and minimumbalance algorithms. Networks 21(2):205-221

[36]

Zeng H, Di Natale M (2012) Schedulability analysis of periodic tasks implementing synchronous finite state machines. In Proceedings of the 24th euromicro conference on real-time systems, pp 353-362, July 2012.

[37]

Zuhily A, Burns A (October 2009) Exact scheduling analysis of non-accumulatively monotonic multiframe tasks. Real-Time Syst 43(2):119-146

Digital Library

Cited By

Zhao YZeng HSangiovanni-Vincentelli ASztipanovits JZhu Q(2019)Optimization techniques for time-critical cyber-physical systemsProceedings of the Workshop on Design Automation for CPS and IoT10.1145/3313151.3313168(41-50)Online publication date: 15-Apr-2019
https://dl.acm.org/doi/10.1145/3313151.3313168
Peng CZeng HNatale M(2019)A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMsReal-Time Systems10.1007/s11241-019-09331-155:3(598-638)Online publication date: 31-Jul-2019
https://dl.acm.org/doi/10.1007/s11241-019-09331-1
Peng CZeng H(2018)Response time analysis of digraph real-time tasks scheduled with static priorityReal-Time Systems10.1007/s11241-017-9290-754:1(91-131)Online publication date: 28-Dec-2018
https://dl.acm.org/doi/10.1007/s11241-017-9290-7

Computing periodic request functions to speed-up the analysis of non-cyclic task models
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Compositional Feasibility Analysis of Conditional Real-Time Task Models
ISORC '08: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing

Conditional real-time task models, which are generalizations of periodic, sporadic, and multi-frame tasks, represent real world applications more accurately. These models can be classified based on a tradeoff in two dimensions - expressivity and ...
Dependable parallel computing with agents based on a task graph model
PDP '95: Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing

We discuss a novel technique for improving the dependability of parallel programs executing on a MIMD shared memory architecture. The idea is to empower certain tasks of each application program to carry out failure detection, and to reschedule the ...
Hyper-bent functions and cyclic codes

Bent functions are those Boolean functions whose Hamming distance to the Reed-Muller code of order 1 equal 2^n-1) - 2^n/2-1 (where the number n of variables is even). These combinatorial objects, with fascinating properties, are rare. Few constructions ...

Comments

Information & Contributors

Information

Published In

cover image Real-Time Systems

Real-Time Systems Volume 51, Issue 4

July 2015

125 pages

ISSN:0922-6443

Issue’s Table of Contents

Copyright © Copyright © 2015 Springer Science+Business Media New York.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 July 2015

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhao YZeng HSangiovanni-Vincentelli ASztipanovits JZhu Q(2019)Optimization techniques for time-critical cyber-physical systemsProceedings of the Workshop on Design Automation for CPS and IoT10.1145/3313151.3313168(41-50)Online publication date: 15-Apr-2019
https://dl.acm.org/doi/10.1145/3313151.3313168
Peng CZeng HNatale M(2019)A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMsReal-Time Systems10.1007/s11241-019-09331-155:3(598-638)Online publication date: 31-Jul-2019
https://dl.acm.org/doi/10.1007/s11241-019-09331-1
Peng CZeng H(2018)Response time analysis of digraph real-time tasks scheduled with static priorityReal-Time Systems10.1007/s11241-017-9290-754:1(91-131)Online publication date: 28-Dec-2018
https://dl.acm.org/doi/10.1007/s11241-017-9290-7

View Options

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

Media

Figures

Other

Tables

View Issue’s Table of Contents