An Improved Protocol for Deadlock and Livelock Avoidance Resource Co-allocation in Network Computing

Authors:
Jie Cao;Zhiang Wu
Affiliations:
Jiangsu Provincial Key Laboratory of E-business, Nanjing University of Finance and Economics, Nanjing, People's Republic of China;Jiangsu Provincial Key Laboratory of E-business, Nanjing University of Finance and Economics, Nanjing, People's Republic of China and School of Computer Science and Engineering, Southeast Universi ...
Venue:
World Wide Web
Year:
2010

Citing 11
Cited 1

Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

IEEE Transactions on Information Theory
Introduction to Algorithms

Introduction to Algorithms
Resource Co-Allocation in Computational Grids

HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
A SNAP-Based Community Resource Broker Using a Three-Phase Commit Protocol: A Performance Study

The Computer Journal
Resource Co-Allocation: A Complementary Technique that Enhances Performance in Grid Computing Environment

ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
Advance Reservation and Co-Allocation Protocol for Grid Computing

E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing
Alternative Architectures and Protocols for Providing Strong Consistency in Dynamic Web Applications

World Wide Web
Efficient and deadlock-free reconfiguration for source routed networks

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Deadlock prevention by turn prohibition in interconnection networks

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
GridARS: an advance reservation-based grid co-allocation framework for distributed computing and network resources

JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
A deadlock and livelock free protocol for decentralized Internet resource coallocation

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

Exploiting space-time status for service recommendation

APWeb'12 Proceedings of the 14th international conference on Web Technologies and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A multitude of applications require simultaneous access to multiple kinds of resources scatted in distributed sites. This problem is known as resource co-allocation which has evolved as a hot topic in network computing. How to design a kind of high-performance protocol for deadlock and livelock avoidance resource co-allocation becomes a challenging problem. In this paper, we propose a new protocol OODP3 (Optimal ODP3) which is based on the currently popular protocol ODP3 (Order-based Deadlock Prevention Protocol with Parallel requests).OODP3 not only inherits the advantage of ODP3 but also guarantees the fulfillment of resource co-allocation within polynomial time. Theoretical proof is conducted to verify the correctness of OODP3. Experimental results also show that OODP3 achieves the better performance improvements than the existing deadlock and livelock avoidance protocol.