Abstract
This paper discusses the order-based deadlock prevention protocol with parallel requests (OOP3) [1]. From the analysis of theorems about ODP3, we found that the conclusions of paper [1] are not correct. The OOP3 method is not free from deadlock and live-lock. An example is given to illustrate our deduction. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3842 LNCS, pp. 698–701). https://doi.org/10.1007/11610496_94
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
