Abstract
This paper discusses the order-based deadlock prevention protocol with parallel requests (ODP3) [1]. From the analysis of theorems about ODP3, we found that the conclusions of paper [1] are not correct. The ODP3 method is not free from deadlock and live-lock. An example is given to illustrate our deduction.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Park, J.: A Deadlock and Livelock Free Protocol for Decentralized Internet Resource Co-allocation. IEEE Transactions on systems, man and cybernetics –Part A: systems and humans 34(1), 123 (2004)
Park, J.: A Scalable Protocol for Deadlock and Livelock Free Co-Allocation of Resources in Internet Computing. In: Proceedings of the 2003 Symposium on Applications and the Internet (SAINT 2003). IEEE Press, Los Alamitos (2003)
Czajkowski, K., Foster, I., Kesselman, C.: Resource co-allocation in computational grids. In: 7th IEEE Symposium on High Performance Distributed Computing, pp. 219–228 (1999)
Foster, I., Kesselman, C., Lee, C., Lindell, B., Nahrstedt, K., Roy, A.: A distributed resource management architecture that support advance reservations and co-allocation. In: Intl. Workshop on Quality of Service (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, C., Liu, Y., Zhang, T., Zha, Y., Zhang, W. (2006). Comments on Order-Based Deadlock Prevention Protocol with Parallel Requests in “A Deadlock and Livelock Free Protocol for Decentralized Internet Resource Co-allocation”. In: Shen, H.T., Li, J., Li, M., Ni, J., Wang, W. (eds) Advanced Web and Network Technologies, and Applications. APWeb 2006. Lecture Notes in Computer Science, vol 3842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610496_94
Download citation
DOI: https://doi.org/10.1007/11610496_94
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31158-4
Online ISBN: 978-3-540-32435-5
eBook Packages: Computer ScienceComputer Science (R0)