ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Future Generation Computer Systems
Volume 24, Issue 4, April 2008, Pages 280-295
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (2833 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.future.2007.05.006    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier Ltd All rights reserved.

A case for cooperative and incentive-based federation of distributed clustersstar, open

Rajiv RanjanCorresponding Author Contact Information, a, E-mail The Corresponding Author, E-mail The Corresponding Author, Aaron Harwooda, E-mail The Corresponding Author and Rajkumar Buyyaa, E-mail The Corresponding Author

aGRIDS Lab and P2P Group, Department of Computer Science and Software Engineering, University of Melbourne, Victoria, Australia

Received 18 April 2006; 
revised 22 May 2007; 
accepted 22 May 2007. 
Available online 15 June 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

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 brokering 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 sub-optimal 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 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 Quality of Service (QoS)-based scheduling, but also enhances utility delivered by resources. 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.

Article Outline

1. Introduction
1.1. Grid-Federation
2. Related work
3. Grid-Federation: Architecture for decentralized resource management
3.1. Decentralised market place and Grid-Federation
3.2. General Grid-Federation superscheduling technique
3.3. QoS driven resource allocation algorithm for Grid-Federation
3.4. Quote value
3.5. User budget and deadline
4. Experiments and analysis
4.1. Workload and resource methodology
4.2. Experiment 1 — independent resources
4.3. Experiment 2 — with federation
4.4. Experiment 3 — with federation and economy
4.5. Experiment 4 — message complexity with respect to jobs
4.6. Experiment 5 — message complexity with respect to system size
4.7. Results and observations
4.7.1. Justifying Grid-Federation-based resource sharing
4.7.2. Resource owner perspective
4.7.3. End users’ perspective
4.7.4. Remote and local message complexity
4.7.5. System’s scalability perspective
5. Conclusion
Acknowledgements
References
Vitae












 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.