Personal tools
You are here: Home Publications Scalable Grid Application Scheduling via Decoupled Resource Selection and Scheduling
Document Actions

Yang Zhang, Anirban Mandal, Henri Casanova, Andrew A Chien, Yang-Suk Kee, Ken Kennedy, and Charles Koelbel (ed.) (2006)

Scalable Grid Application Scheduling via Decoupled Resource Selection and Scheduling

IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006), vol. Volume 1(pp. 568 - 575).

Over the past years grid infrastructures have been deployed at larger and larger scales, with envisioned deployments incorporating tens of thousands of resources. Therefore, application scheduling algorithms can become unscalable (albeit polynomial) and thus unusable in large-scale environments. One reason for unscalability is that these algorithms perform implicit resource selection. One can achieve better scalability by performing explicit resource selection independently from scheduling in a "decoupled" approach. Furthermore, we hypothesize that one can achieve similar or even better performance as with the non-decoupled approach, which we call the "one step" approach, by selecting resources judiciously. Leveraging the Virtual Grid abstraction, we demonstrate that the decoupled approach is indeed both scalable and effective in large-scale and highly heterogeneous resource environments.

by admin last modified 2008-04-30 12:20
« September 2010 »
Su Mo Tu We Th Fr Sa
1234
567891011
12131415161718
19202122232425
2627282930
 

VGrADS Collaborators include:

Rice University UCSD UH UCSB UTK ISI UTK

Powered by Plone