A Case for Cooperative and Incentive-Based Coupling of Distributed Clusters
<|reference_start|>A Case for Cooperative and Incentive-Based Coupling of Distributed Clusters: Research interest in Grid computing has grown significantly over the past five years. Management of distributed resources is one of the key issues in Grid computing. Central to management of resources is the effectiveness of resource allocation as it determines the overall utility of the system. The current approaches to superscheduling in a grid environment are non-coordinated since application level schedulers or brokers make scheduling decisions independently of the others in the system. Clearly, this can exacerbate the load sharing and utilization problems of distributed resources due to suboptimal schedules that are likely to occur. To overcome these limitations, we propose a mechanism for coordinated sharing of distributed clusters based on computational economy. The resulting environment, called \emph{Grid-Federation}, allows the transparent use of resources from the federation when local resources are insufficient to meet its users' requirements. The use of computational economy methodology in coordinating resource allocation not only facilitates the QoS based scheduling, but also enhances utility delivered by resources.<|reference_end|>
@article{ranjan2006a,
    title={A Case for Cooperative and Incentive-Based Coupling of Distributed
  Clusters},
    author={Rajiv Ranjan, Aaron Harwood and Rajkumar Buyya},
    journal={In Proceedings of the 7th IEEE International Conference on Cluster
  Computing (Cluster 2005), IEEE Computer Society Press, September 27 - 30,
  2005, Boston, Massachusetts, USA.},
    year={2006},
    doi={10.1109/CLUSTR.2005.347038},
    archivePrefix={arXiv},
    eprint={cs/0605060},
    primaryClass={cs.DC}
}