A delay composition theorem for real-time pipelines

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2007, Pages 29-38

  Jayachandran, Praveen ^a   Abdelzaher, Tarek ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVE COMPONENTS; EXECUTION TIMES; HIGHER-PRIORITY JOBS;

PIPELINE PROCESSING SYSTEMS; SCHEDULING; SUPERVISORY AND EXECUTIVE PROGRAMS; THEOREM PROVING;

REAL TIME SYSTEMS;

EID: 35348889193     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2007.80     Document Type: Conference Paper

References (17)

1. T. Abdelzaher and C. Lu. A utilization bound for aperiodic tasks and priority driven scheduling. IEEE Transactions on Computers, 53(3), March 2004.
2. A. N. Audsley, A. Bums, M. Richardson, and K. Tindell. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, pages 284-292, 1993.
3. E. Bini, G. Buttazzo, and G. Buttazzo. A hyperbolic bound for the rate monotonie algorithm. In 13th Euromicro Conference on Real-Time Systems, Delft, Netherlands, June 2001.
4. S. Chatterjee and J. Strosnider. Distributed pipeline scheduling: End-to-end analysis of heterogeneous multi-resource real-time sytems. In IEEE International Conference on Distributed Computing Systems, pages 204-211, May 1995.
5. G. Fohler and K. Ramamritham. Static scheduling of pipelined periodic tasks in distributed real-time systems. In 9th 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 Real-Time Systems Symposium, December 2005.
7. J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In IEEE Real-Time Systems Symposium, pages 166-171, December 1989.
8. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of ACM, 20(1):46-61, 1973.
9. 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.
10. R. Pellizzoni and G. Lipari. Improved schedulability analysis of real-time transactions with earliest deadline scheduling. In IEEE Real Time and Embedded Technology and Applications Symposium (RTAS), pages 66-75, March 2005.
11. K. Ramamritham. Allocation and scheduling of complex periodic tasks. In IEEE International Conference on Distributed Computing Systems, pages 108-115, 1990.
12. J. Schneider. Cache and pipeline sensitive fixed priority scheduling for preemptive real-time systems. In IEEE RealTime Systems Symposium, pages 195-204, November 2000.
13. M. Spuri. Holistic analysis of deadline scheduled real-time distributed systems. Technical Report RR-2873, INRIA, France, 1996.
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. Pamas. On satisfying timing constraints in hard real-time systems. IEEE Transactions on Software Engineering, 19(1):70-84, January 1993.
16. N. Zhang, A. Bums, and M. Nicholson. Pipelined processors and worst case execution times. Real-Time Systems, 5(4):319-343, 1993.
17. Y. Zhang, C. Lu, C. Gill, P. Lardieri, and G. Thaker. End-toend scheduling strategies for aperiodic tasks in middleware. Technical Report WUCSE-2005-57, University of Washington at St. Louis, December 2005.