Abstract
The StarLite integrated programming environment is designed to support research in real-time database, operating system, and network technology. This paper discusses the results of experiments, using the capabilities of StarLite, to test the applicability of deadlock avoidance algorithms for real-time resource management. We extend existing algorithms to include priority inheritance and we introduce a new class of algorithms embodying a specification-ordered safety test. These new algorithms have the potential for improved efficiency and great flexibility in meeting user requirements. We also present a resource manager design that is amenable to hardware implementation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cook, R. P. and L. Hsu, “StarLite: A Software Education Laboratory,” Fourth SEI Conference on Software Engineering Educationreprinted in Software Engineering EducationSpringer-Verlag Lecture Notes in Computer Science 423, Lionel E. Deimel (Ed.), (April 1990).
Dijkstra, E.W.,“A Class of Allocation Strategies Inducing Bounded Delays Only,” AFIPS 1972 SJCC, Vol. 40,Montvale, N.J., AFIPS Press, (1972).
Habermann, A.N., “Prevention of System Deadlocks,” Communications of the ACM 12, (Dec. 1969).
Cook, R. P., “The StarLite Operating System,” Operating Systems for Mission-Critical Computing,Eds. K. Gordon, P. Hwang, A. Agrawala, ACM Press, (to appear).
S. H. Son and C. Chang, “Performance Evaluation of Real-Time Locking Protocols using a Distributed Software Prototyping Environment,” 10th International Conference on Distributed Computing Systems,Paris, France, (June 1990).
Cook, R. P. and H. Oh, “The StarLite Project,” Frontiers 90 Conference on Massively Parallel Computation, (Oct. 1990).
Roberts, E.S. and M.T. Vandevoorde, “WorkCrews: An Abstraction for Controlling Parallelism,” DEC SRC Research Report 42, (April 1989).
Munch-Anderson, B. and T.U. Zahle, “Scheduling According to Job Priority With Prevention of Deadlock and Permanent Blocking,” Acta Informatica 8,2(1977).
Lausen,S.,“Job Scheduling Guaranteeing Reasonable Turn-Around Times,” Acta Informatica2, 1(1973).
Rajkumar, R., L. Sha, and J.P. Lehoczky, “Real-Time Synchronization Protocols for Multiprocessors,” Real-Time Systems Symposium,Huntsville, AL, (Dec. 1988).
Abbott, R. and H. Garcia-Molina, “Scheduling Real-Time Transactions,” SIGMOD Record 17,l(March 1988).
Mok, A.K. Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment”,Ph.D. Thesis, M.I.T. (1983).
Liu, C.L. and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” JACM 20,1(1973).
Lampson, B.W. and D.D. Redell,“Experience with Processes and Monitors in Mesa,” Communications of the ACM 23,2(Feb. 1980).
Belik, F., “An Efficient Deadlock Avoidance Technique,” IEEE Transactions on Computers 39,7(July 1990).
Babaoglu, O., K. Marzullo, and F.B. Schneider, “Priority Inversion and Its Prevention,” Cornell TR-90–1088, (Feb. 1990).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cook, R.P., Hsu, L., Son, S.H. (1991). Real-Time, Priority-Ordered, Deadlock Avoidance Algorithms. In: van Tilborg, A.M., Koob, G.M. (eds) Foundations of Real-Time Computing: Scheduling and Resource Management. The Springer International Series in Engineering and Computer Science, vol 141. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3956-8_11
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3956-8_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6766-6
Online ISBN: 978-1-4615-3956-8
eBook Packages: Springer Book Archive