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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Alan Burns, Scheduling Hard Real-Time Systems: A Review, Software Engineering Journal, May 1991, pp116–128.
Paul Jardetzky, Network File Server Design for Continuous Media, PhD Thesis, Computer Laboratory, University of Cambridge, 1992.
Sandeep Khanna, Michael Sebree, John Zolnowsky, Realtime Scheduling in SunOS 5.0, The proceeding of USENIX 92 Winter, pp375–390.
Lui Sha, Ragunathan Rajkumar, John P. Lehoczky, Priority Inheritance Protocols: An Approach to Real-Time Synchronisation, IEEE Transactions on Computers, Vol. 39, No. 9, September 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Needham, R., Nakamura, A. (1993). An approach to real-time scheduling — but is it really a problem for multimedia?. In: Venkat Rangan, P. (eds) Network and Operating System Support for Digital Audio and Video. NOSSDAV 1992. Lecture Notes in Computer Science, vol 712. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57183-3_4
Download citation
DOI: https://doi.org/10.1007/3-540-57183-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57183-4
Online ISBN: 978-3-540-47933-8
eBook Packages: Springer Book Archive