Name
Abstract | ||
|---|---|---|
This paper details work done on how to avoid bad behaviour caused by priority inversion and lock blocking in real-time processing in multimedia environments. We will show how they can be cured by more complex algorithms. (1) Priority inheritance protocol, (2) the priority ceiling protocol, (3) the semaphore dependency protocol deal with increasing complex situations. The question is why should there be complex situations? Our suggestion is that there should not be complex situations in multimedia systems, therefore and that simple priority inheritance ought to be good enough. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1007/3-540-57183-3_4 | NOSSDAV |
Keywords | Field | DocType |
real-time scheduling,priority ceiling protocol,real time processing | Priority ceiling protocol,Computer science,Computer network,Real-time computing,Rate-monotonic scheduling,Distributed computing,Fixed-priority pre-emptive scheduling,Deadline-monotonic scheduling,Priority inversion,Priority inheritance,Dynamic priority scheduling,Earliest deadline first scheduling,Multimedia | Conference |
ISBN | Citations | PageRank |
3-540-57183-3 | 4 | 0.41 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roger M. Needham | 1 | 4648 | 2075.99 |
| Akira Nakamura | 2 | 24 | 9.48 |