In multicluster systems, and more generally, in grids, johs may require co-allocation, i.e., the simultaneous allocation of resources such as pmcessors and inputfiles in multiple clusters. While such johs may have reduced runtimes because they have access to more resources, waiting for processors in multiple clusters andfor the inputfiles to become available in the right locations may intruduce inefficiencies In previous work, we have studied through simulations only processor co-allocation. Here, we extend this work with an analysis of the p e r f o m n c e in a real testhed of our pmtotype Processor and Data Co-Allocator with the Close-to-Files (CF) job-placement algorirhm CF tries to place job components on clusters with enough idle processors which are close to the sites where the inputfiles reside. We present a comparison of the performance of CF and the Worst-Fit job-placement algorithm, with and withoutfile replication, achieved with our prototype. Our most importantfindings are that CF with replication works best, and that the utiiiiation in our testhed can be driven to ahout 80%.
Mohamed and Epema REF developed an algorithm named Close-to-File (CF) that schedules tasks on sites with enough processing capacity that are close to the sites where the required data (input files) reside.
An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
2004 IEEE International Conference on Cluster Computing (IEEE Cat. No.04EX935)
2004 IEEE International Conference on Cluster Computing (IEEE Cat. No.04EX935)
Computer Science