Casanova, HenriChien, Andrew A.Kee, Yang-SukKennedy, KenKoelbel, CharlesMandal, AnirbanZhang, Yang2017-08-022017-08-022006-01-20Casanova, Henri, Chien, Andrew A., Kee, Yang-Suk, et al.. "Scalable Grid Application Scheduling via Decoupled Resource Selection and Scheduling." (2006) https://hdl.handle.net/1911/96346.https://hdl.handle.net/1911/96346Over 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 decoupled from scheduling (aka "decoupled" approach). Furthermore, we hypothesize that one can achieve similar or even better performance as with the non-decoupled approach (aka "one step" approach) by selecting resources judiciously. Leveraging the Virtual Grid Execution System, we demonstrate that the decoupled approach is indeed both scalable and effective in large-scale and highly heterogeneous resource environments.8 ppengYou are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).Technical reportTR06-871