Skip to main content
Log in

Reduction-based schedulability analysis of distributed systems with cycles in the task graph

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

A significant problem with no simple solutions in current real-time literature is analyzing the end-to-end schedulability of tasks in distributed systems with cycles in the task graph. Prior approaches including network calculus and holistic schedulability analysis work best for acyclic task flows. They involve iterative solutions or offer no solutions at all when flows are non-acyclic. This paper demonstrates the construction of the first generalized closed-form expression for schedulability analysis in distributed task systems with non-acyclic flows. The approach is a significant extension to our previous work on schedulability in Directed Acyclic Graphs. Our main result is a bound on end-to-end delay for a task in a distributed system with non-acyclic task flows. The delay bound allows one of several schedulability tests to be performed. Using the end-to-end delay bound, we extend the delay composition algebra developed for acyclic distributed systems in prior work, to handle loops in the task graph as well. Evaluation shows that the schedulability tests thus constructed are less pessimistic than prior approaches for large distributed systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Audsley AN, Burns A, Richardson M, Tindell K (1993) Applying new scheduling theory to static priority pre-emptive scheduling. Softw Eng 284–292

  • Cruz R (1991a) A calculus for network delay, part I: Network elements in isolation. IEEE Trans Inf Theory 37(1):114–131

    Article  MATH  MathSciNet  Google Scholar 

  • Cruz R (1991b) A calculus for network delay, part II: Network analysis. IEEE Trans Inf Theory 37(1):132–141

    Article  MATH  MathSciNet  Google Scholar 

  • Fohler G, Ramamritham K (1997) Static scheduling of pipelined periodic tasks in distributed real-time systems. In: Euromicro workshop on real-time systems, June 1997, pp 128–135

  • Jayachandran P, Abdelzaher T (2007) A delay composition theorem for real-time pipelines. In: ECRTS, July 2007, pp 29–38

  • Jayachandran P, Abdelzaher T (2008a) Delay composition algebra: A reduction-based schedulability algebra for distributed real-time systems. In: RTSS, December 2008, pp 259–269

  • Jayachandran P, Abdelzaher T (2008b) Delay composition in preemptive and non-preemptive real-time pipelines. Real-Time Syst J 40(3):290–320. Special Issue on ECRTS’07

    Article  MATH  Google Scholar 

  • Jayachandran P, Abdelzaher T (2008c) Transforming acyclic distributed systems into equivalent uniprocessors under preemptive and non-preemptive scheduling. In: ECRTS, July 2008, pp 233–242

  • Jonsson B, Perathoner S, Thiele L, Yi W (2008) Cyclic dependencies in modular performance analysis. In: ACM international conference on embedded software (EMSOFT), October 2008, pp 179–188

  • Kao B, Garcia-Molina H (1997) Deadline assignment in a distributed soft real-time system. IEEE Trans Parallel Distrib Syst 8(12):1268–1274

    Article  Google Scholar 

  • Koubaa A, Song Y-Q (2004) Evaluation and improvement of response time bounds for real-time applications under non-preemptive fixed priority scheduling. Int J Prod Res 42(14):2899–2913

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Natale MD, Stankovic JA (1994) Dynamic end-to-end guarantees in distributed real-time systems. In: Proc. real-time systems symposium, December 1994, pp 216–227

  • Palencia J, Harbour M (2003) Offset-based response time analysis of distributed systems scheduled under EDF. In: Euromicro conference on real-time systems, July 2003, pp 3–12

  • Pellizzoni R, Lipari G (2005) Improved schedulability analysis of real-time transactions with earliest deadline scheduling. In: RTAS, March 2005, pp 66–75

  • Thiele L, Chakraborty S, Naedele M (2000) Real-time calculus for scheduling hard real-time systems. In: IEEE international symposium on circuits and systems, vol 4, May 2000, pp 101–104

  • Tindell K, Clark J (1994) Holistic schedulability analysis for distributed hard real-time systems. Microprocess Microprogram 40(2–3):117–134

    Article  Google Scholar 

  • Wandeler E, Maxiaguine A, Thiele L (2004) Quantitative characterization of event streams in analysis of hard real-time applications. In: IEEE real-time and embedded technology and applications symposium (RTAS), May 2004, pp 450–459

  • Xu J, Parnas D (1993) On satisfying timing constraints in hard real-time systems. IEEE Trans Softw Eng 19(1):70–84

    Article  Google Scholar 

  • Zhang Y, Lu C, Gill C, Lardieri P, Thaker G (2005) End-to-end scheduling strategies for aperiodic tasks in middleware. Technical Report WUCSE-2005-57, University of Washington at St. Louis, December 2005

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Praveen Jayachandran.

Additional information

This work was funded in part by NSF grants CNS 05-53420, CNS 06-13665, and CNS 07-20513, and ONR grant N00014-10-1-0172.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jayachandran, P., Abdelzaher, T. Reduction-based schedulability analysis of distributed systems with cycles in the task graph. Real-Time Syst 46, 121–151 (2010). https://doi.org/10.1007/s11241-010-9098-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-010-9098-1

Keywords

Navigation