A scalable protocol for deadlock and livelock free co-allocation of resources in Internet computing
A scalable protocol for deadlock and livelock free co-allocation of resources in Internet computing
复制标题
DOI：
10.1109/saint.2003.1183034
复制
发表时间：
2003-01
期刊：
影响因子：
--
通讯作者：
Jonghun Park
中科院分区：
文献类型：
--
作者：
Jonghun Park
互联网上的计算正变得越来越流行。有了诸如计算网格之类的新兴基础设施，就有可能通过无缝地利用适当的Internet资源开发支持各种Internet范围协作的应用程序。然而，随着互联网计算的普及，在设计有效的资源分配协议、为共享资源的获取提供明确的指令方面也提出了许多新的挑战。特别是，跨多个管理域的分布式Internet资源的协同分配问题由于需要可伸缩性、备选协同分配方案的可用性以及死锁和活动锁的可能性而变得复杂。基于此，本文开发了一种新的可扩展协议，用于互联网资源的快速共分配。该协议不存在死锁和活动锁，并通过对所需资源的请求并行化，有效地利用了可用的替代资源共分配方案。实验结果表明，与现有的死锁预防协议相比，该协议的性能有了显著提高。
Computing over the Internet is becoming increasingly popular. With the emerging infrastructures such as computational grids, it is possible to develop applications that support various Internet-wide collaborations through seamlessly harnessing appropriate Internet resources. Yet, as Internet computing is becoming pervasive, it also presents a number of new challenges in designing efficient resource allocation protocol that provides clear directives on the acquisition of shared resources. In particular, the problem of co-allocating distributed Internet resources that span multiple administrative domains is complicated by the need for scalability, the availability of alternative co-allocation schemes, and the possibility of deadlock and livelock. Motivated by this, this paper develops a new scalable protocol for fast co-allocation of Internet resources. The proposed protocol is free from deadlock and livelock, and seeks to effectively exploit the available alternative resource co-allocation schemes through parallelization of requests for required resources. Experimental results demonstrate that the proposed protocol yields a significant performance improvement over the existing deadlock prevention protocol.