2006 15th IEEE International Conference on High Performance Distributed Computing
Robust Resource Allocation for Large-scale Distributed Shared Resource Environments
Paris
June 19-June 23
ISBN: 1-4244-0307-3
Y.-S. Kee, California Univ., San Diego, La Jolla, CA
K. Yocum, California Univ., San Diego, La Jolla, CA
A.A. Chien, California Univ., San Diego, La Jolla, CA
This paper presents a new formulation of the resource selection and binding problem and proposes a new algorithm called integrated selection and binding to solve this problem. Our insight is that a resource selection algorithm should consider binding failures. Consequently, the key idea of the integrated selection and binding approach is to decompose a resource collection request into components that can be bound and composed independently and to select multiple sets of resources for each component. The integrated approach is more efficient and effective than the separate approach for competitive access to federated resources
Index Terms:
federated resources, resource allocation, distributed shared resource environment, integrated selection and binding algorithm, resource selection algorithm, resource collection request
Citation:
Y.-S. Kee, K. Yocum, A.A. Chien, "Robust Resource Allocation for Large-scale Distributed Shared Resource Environments," hpdc, pp.341-342, 2006 15th IEEE International Conference on High Performance Distributed Computing, 2006
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb