Comments on order-based deadlock prevention protocol with parallel requests in "a deadlock and livelock free protocol for decentralized internet resource co-allocation"

Authors:
Chuanfu Zhang;Yunsheng Liu;Tong Zhang;Yabing Zha;Wei Zhang
Affiliations:
College of Mechaeronics Engineering and Automation, National University of Defense, Technology, Changsha, China;College of Mechaeronics Engineering and Automation, National University of Defense, Technology, Changsha, China;College of Mechaeronics Engineering and Automation, National University of Defense, Technology, Changsha, China;College of Mechaeronics Engineering and Automation, National University of Defense, Technology, Changsha, China;College of Mechaeronics Engineering and Automation, National University of Defense, Technology, Changsha, China
Venue:
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Year:
2006

Citing 3
Cited 0

Resource Co-Allocation in Computational Grids

HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
A Scalable Protocol for Deadlock and Livelock Free Co-Allocation of Resources in Internet Computing

SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
A deadlock and livelock free protocol for decentralized Internet resource coallocation

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

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.