Bounding the end-to-end response time in multiprocessor real-time systems
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In a multiprocessor real-time system, a task may execute in turn on several processors before it completes. The task may have different priorities on different processors and may execute on some processors more than once. Existing techniques for bounding the response times of such tasks are not effective. In this paper, we present a method to compute tighter upper bounds on their response times.Keywords
This publication has 5 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Real-time synchronization protocols for multiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- End-to-end scheduling to meet deadlines in distributed systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An end-to-end approach to schedule tasks with shared resources in multiprocessor systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Finding Response Times in a Real-Time SystemThe Computer Journal, 1986