2012 IEEE 8th International Conference on E-Science (2006)
Dec. 4, 2006 to Dec. 6, 2006
Ewa Deelman , USC, USA
Carl Kesselman , USC, USA
Gurmeet Singh , USC, USA
In this paper, we present algorithms for Grid resource provisioning that employ agreement-based resource management. These algorithms allow userlevel resource allocation and scheduling of applications that are structured as a precedenceconstrained set of tasks. We present a provisioning model where the resource availability in the Grid can be enumerated as a set of slots. A slot is defined as a number of processors available from a certain start time for a certain duration at a certain cost. Using a cost model that combines the cost of resource allocation and the expected application runtime, we evaluate the performance of the Min-Min and of the Genetic algorithm (GA)-based heuristics for a range of synthetic applications. We show that the GA paired with a list scheduling algorithm can obtain significantly better solutions than the Min-Min heuristic alone.
Ewa Deelman, Carl Kesselman, Gurmeet Singh, "Application-Level Resource Provisioning on the Grid", 2012 IEEE 8th International Conference on E-Science, vol. 00, no. , pp. 83, 2006, doi:10.1109/E-SCIENCE.2006.25