Delay composition algebra: A reduction-based schedulability algebra for distributed real-time systems

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2008, Pages 259-269

  Jayachandran, Praveen ^a   Abdelzaher, Tarek ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS TOOLS; DISTRIBUTED REAL TIME SYSTEM; DISTRIBUTED SYSTEMS; DISTRIBUTED TASKS; END TO END DELAY; ORIGINAL SYSTEMS; REAL-TIME TASKS; REDUCTION RULES; SCHEDULABILITY; SCHEDULABILITY ANALYSIS; SHOW THROUGH; SINGLE COMPONENTS; UNIPROCESSOR;

ALGEBRA; CIRCUIT THEORY; CONTROL THEORY; SET THEORY;

REAL TIME SYSTEMS;

EID: 67249108729     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2008.38     Document Type: Conference Paper

References (15)

1. A. N. Audsley, A. Burns, M. Richardson, and K. Tindell. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering, pages 284-292, 1993.
2. R. Bettati and J. W. Liu. Algorithms for end-to-end scheduling to meet deadlines. In IEEE Symposium on Parallel and Distributed Processing, pages 62-67, December 1990.
3. R. Cruz. A calculus for network delay, part i: Network elements in isolation. IEEE Transactions on Information Theory, 37(1):114-131, January 1991.
4. R. Cruz. A calculus for network delay, part ii: Network analysis. IEEE Transactions on Information Theory, 37(1):132-141, January 1991.
5. G. Fohler and K. Ramamritham. Static scheduling of pipelined periodic tasks in distributed real-time systems. In Euromicro Workshop on Real-Time Systems, pages 128-135, June 1997.
6. W. Hawkins and T. Abdelzaher. Towards feasible region calculus: An end-to-end schedulability analysis of real-time multistage execution. In IEEE RTSS, December 2005.
7. P. Jayachandran and T. Abdelzaher. A delay composition theorem for real-time pipelines. In ECRTS, pages 29-38, July 2007. (Pubitemid 47591684)
8. P. Jayachandran and T. Abdelzaher. Delay composition in preemptive and non-preemptive real-time pipelines. Invited to Real-Time Systems Journal: Special Issue on ECRTS'07 (to appear), 2008.
9. P. Jayachandran and T. Abdelzaher. Transforming acyclic distributed systems into equivalent uniprocessors under preemptive and non-preemptive scheduling. In ECRTS, pages 233- 242, July 2008.
10. A. Koubaa and Y.-Q. Song. Evaluation and improvement of response time bounds for real-time applications under nonpreemptive fixed priority scheduling. International Journal of Production and Research, 42(14):2899-2913, July 2004.
11. J. Palencia and M. Harbour. Offset-based response time analysis of distributed systems scheduled under edf. In Euromicro Conference on Real-Time Systems, pages 3-12, July 2003.
12. J. Palencia and M. G. Harbour. Schedulability analysis for tasks with static and dynamic offsets. In IEEE Real-Time Systems Symposium, pages 26-37, December 1998.
13. R. Pellizzoni and G. Lipari. Improved schedulability analysis of real-time transactions with earliest deadline scheduling. In RTAS, pages 66-75, March 2005. (Pubitemid 41311459)
14. K. Tindell and J. Clark. Holistic schedulability analysis for distributed hard real-time systems. Elsevier Microprocessing and Microprogramming, 40(2-3):117-134, 1994.
15. J. Xu and D. Parnas. On satisfying timing constraints in hard real-time systems. IEEE Transactions on Software Engineering, 19(1):70-84, January 1993.