Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters
verfasst von : Deshi Ye, Lili Mei
Erschienen in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We consider the on-line scheduling of parallel jobs in heterogeneous multiple clusters, in which a set of clusters is given and the parallel jobs arrive one by one, and the goal is to schedule all the jobs while minimizing the makespan. A cluster consists of many identical processors. A parallel job may require several processors in one cluster to execute it simultaneously. In this paper, we investigate two variants of the heterogeneous clusters. First, for the clusters of different widths (number of processors) but identical processor speeds, we provide an on-line algorithm with a competitive ratio at most of 14.2915. Second, for the clusters of different speeds but identical widths, we provide an on-line algorithm with a competitive ratio at most of 18.2788.