In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input .les in multiple clusters. While such jobs may have reduced runtimes because they have access to more resources, waiting for processors in multiple clusters and for the input .les to become available in the right locations, may introduce ine.ciencies. In this paper we present the design of KOALA, a prototype for processor and data co-allocation that tries to minimize these ine.ciencies through the use of its Close-to-Files placement policy and its Incremental Claiming Policy. The latter policy tries to solve the problem of a lack of support for reservation by local resource managers.
|Title of host publication||Advances in Grid Computing - EGC 2005 (European Grid Conference, Amsterdam, The Netherlands, February 14-16, 2005. Revised Selected Papers)|
|Editors||P.M.A. Sloot, A.G. Hoekstra, T. Priol, A. Reinefeld, M. Bubak|
|Place of Publication||Berlin|
|Publication status||Published - 2005|
|Name||Lecture Notes in Computer Science|