Loading...
Please wait, while we are loading the content...
Similar Documents
Bounding the end-to-end response times of tasks in a distributed real-time system using the direct synchronization protocol
| Content Provider | Semantic Scholar |
|---|---|
| Author | Liu, Jinbao |
| Copyright Year | 1995 |
| Abstract | In a distributed real-time system, a task may consist of a chain of subtasks which execute on different processors. In order to guarantee that all timing constraints are met in such a system, it is imperative to be able to determine the end-to-end response time for each task. This report focuses on distributed systems where tasks are periodic and scheduled according to fixed priority scheduling algorithms. Moreover, if a subtask has predecessors, every instance of the subtask is released as soon as the corresponding instance of the immediate predecessor subtask completes. This report describes an algorithm that can be used to find upper bounds on the end-to-end response times of tasks in such a distributed real-time system. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://pertsserver.cs.uiuc.edu/papers/SuLi96a.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |