Enhanced algorithms for multi-site scheduling

43Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper discusses two approaches to enhance multi-site scheduling for grid environments. First the potential improvements of multi-site scheduling by applying constraints for the job fragmentation are presented. Subsequently, an adaptive multi-site scheduling algorithm is pointed out and evaluated. The adaptive multi-site scheduling uses a simple decision rule whether to use or not to use multi-site scheduling. To this end, several machine configurations have been simulated with different parallel job workloads which were extracted from real traces. The adaptive system improves the scheduling results in terms of a short average response time significantly. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Ernemann, C., Hamscher, V., Streit, A., & Yahyapour, R. (2002). Enhanced algorithms for multi-site scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2536 LNCS, pp. 219–231). Springer Verlag. https://doi.org/10.1007/3-540-36133-2_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free