Name
Abstract | ||
|---|---|---|
The paper presents exact schedulability analyses for real-time systems scheduled at run-time with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) release jitter --- such as waiting for a message to arrive. The analysis presented is more general than that previously published, and subsumes, for example, techniques based on the Rate Monotonic approach. In addition to presenting the theory, an existing avionics case study is described and analysed. The predictions that follow from this analysis are seen to be in close agreement with the behaviour exhibited during simulation studies. 1. INTRODUCTION One proposed method of building a hard real time system is from a number of periodic and sporadic tasks, and a common way of scheduling such tasks is by using a static priority preemptive scheduler --- at run-time the highest priority runnable task... |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1049/sej.1993.0034 | Software Engineering Journal |
Field | DocType | Volume |
Monotonic function,Computer science,Scheduling (computing),Scheduling theory,Avionics,Deadline-monotonic scheduling,Theoretical computer science,Jitter,Distributed computing,Embedded system | Journal | 8 |
Issue | ISSN | Citations |
5 | 0268-6961 | 545 |
PageRank | References | Authors |
44.72 | 14 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Neil C. Audsley | 1 | 1058 | 91.40 |
| Alan Burns | 2 | 739 | 59.60 |
| M. F. Richardson | 3 | 601 | 61.17 |
| K. Tindell | 4 | 638 | 60.38 |
| Andy Wellings | 5 | 1901 | 192.85 |