The Community for Technology Leaders
2005 IEEE International Conference on Cluster Computing (2005)
Burlington, MA
Sept. 27, 2005 to Sept. 30, 2005
ISSN: 1552-5244
ISBN: 0-7803-9485-2
pp: 1-11
R. Ranjan , Dept. of Comput. Sci.&Software Eng., Melbourne Univ., Vic.
R. Buyya , Dept. of Comput. Sci.&Software Eng., Melbourne Univ., Vic.
A. Harwood , Dept. of Comput. Sci.&Software Eng., Melbourne Univ., Vic.
ABSTRACT
Interest in grid computing has grown significantly over the past five years. Management of distributed cluster resources is a key issue in grid computing. Central to management of resources is the effectiveness of resource allocation, as it determines the overall utility of the system. In this paper, we propose a new grid system that consists of grid federation agents which couple together distributed cluster resources to enable a cooperative environment. The agents use a computational economy methodology, that facilitates QoS scheduling, with a cost-time scheduling heuristic based on a scalable, shared federation directory. We show by simulation, while some users that are local to popular resources can experience higher cost and/or longer delays, the overall users' QoS demands across the federation are better met. Also, the federation's average case message passing complexity is seen to be scalable, though some jobs in the system may lead to large numbers of messages before being scheduled
INDEX TERMS
message passing complexity, cooperative coupling, incentive-based coupling, distributed clusters, grid computing, distributed cluster resources, resource management, resource allocation, grid system, grid federation agents, cooperative environment, computational economy, QoS scheduling, cost-time scheduling
CITATION

R. Buyya, R. Ranjan and A. Harwood, "A Case for Cooperative and Incentive-Based Coupling of Distributed Clusters," 2005 IEEE International Conference on Cluster Computing(CLUSTER), Burlington, MA, 2005, pp. 1-11.
doi:10.1109/CLUSTR.2005.347038
89 ms
(Ver 3.3 (11022016))