Global backfilling scheduling in multiclusters

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

Abstract

There exist a centralized scheduler structure and a distributed scheduler structure at multiclusters scheduler. The current centralized scheduler structure requires exact knowledge of scheduling activities about geographically distributed clusters. However, such timely and frequent information dissertation can not be supported by existed network infrastructure. In order to make the centralized scheduler structure realistic, this paper investigates the global scheduler at muliclusters without timely and frequently information distribution. This global scheduler is based on the backfilling scheduling policy and the global scheduler tries to find holes at clusters for queued jobs at other cluster. This global backfilling scheduling policy is evaluated by using real workload trace driven simulation. The simulation results show that proposed policy consistently outperforms the independent site execution. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Yue, J. (2004). Global backfilling scheduling in multiclusters. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3285, 232–239. https://doi.org/10.1007/978-3-540-30176-9_30

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