Abstract
Deadlock avoidance algorithms help to improve fault tolerance feature of computer system. Unfortunately, few current algorithms are useful to embedded system either because they only work with single-unit resources, or because the time cost is too high. This paper improves the reduction algorithm with tree structure. According to the new algorithm, only multi-unit resources and the root process in each tree are considered when reducing, while single-unit resources and other processes are ignored because they are combined with tree structure. Thus the new algorithm works with all kinds of resources and its time cost is lower. The new algorithm is useful to embedded system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Belik, F.: An Efficient Deadlock Avoidance Technique. IEEE Transaction on Computers 39(7) (July 1990)
Cahit: Deadlock Detection using (0,1)-labeling of Resource Allocation Graphs. IEE Proc.- Comput. Digit. Tech. 145(1) (January 1998)
Kim, J., Koh, K.: An O(1) time deadlock detection scheme in a single unit and single request multiprocessor system. In: IEEE TENCON 1991, August 1991, pp. 219–223 (1991)
Holt, R.C.: Some Deadlock Properties of Computer Systems. Computing Surveys 4(3), 176–196 (1972)
Levine, G.N.: Defining Deadlock with Multi-unit resources. Operating Systems Review, ACM Press 37(3), 5–11 (2003)
Labrosse, J.J.: MicroC/OS-II, The Real-Time Kernel. R&D Books (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, G., Tang, Z., Tu, S. (2005). A New Approach to Deadlock Avoidance in Embedded System. In: Wu, Z., Chen, C., Guo, M., Bu, J. (eds) Embedded Software and Systems. ICESS 2004. Lecture Notes in Computer Science, vol 3605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535409_56
Download citation
DOI: https://doi.org/10.1007/11535409_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28128-3
Online ISBN: 978-3-540-31823-1
eBook Packages: Computer ScienceComputer Science (R0)