Name
Abstract | ||
|---|---|---|
Scheduling policies are of crucial importance to real-time systems. Ada currently gives full support to the most popular policy, fixed priority dispatching. In this paper we argue that the language should be extended to support another common paradigm, Earliest Deadline First (EDF). A proposal is described that uses standard priorities and the priority ceiling protocol for protected objects. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-24841-5_12 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
real time systems,earliest deadline first,priority ceiling protocol | Priority ceiling protocol,Scheduling (computing),Computer science,Deadline-monotonic scheduling,Real-time operating system,Real-time computing,Priority inversion,Earliest deadline first scheduling,Dynamic priority scheduling,Software development | Conference |
Volume | ISSN | Citations |
3063 | 0302-9743 | 6 |
PageRank | References | Authors |
0.54 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A Burns | 1 | 5034 | 375.85 |
| Andy Wellings | 2 | 1901 | 192.85 |
| S. Tucker Taft | 3 | 50 | 14.12 |