A. Nakamura. An investigation of real-time synchronisation. PhD thesis, University of Cambridge Computer Laboratory, 1993. (p 15) Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Explicit Network Scheduling - Black (1994) (23 citations) (Correct)
....scheme is rarely sufficient. Simple priority schemes suffer from priority inversion, leading to the priority inheritance protocol, and the priority ceiling protocol [Sha87] which requires static analysis (the determination of the complete call graph at compile time) In fact Namakura argues [Nakamura93] that even more complex schemes are required, again requiring static analysis. Static analysis of code, however, is an operation which can only be applied to code with a static call graph. This is most untypical of all but the most esoteric of executives. In a system using dynamic binding of ....
A. Nakamura. An investigation of real-time synchronisation. PhD thesis, University of Cambridge Computer Laboratory, 1993. (p 15)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC