Suitability of load scheduling algorithms to workload characteristics

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

Abstract

In this paper, we investigate the suitability of load scheduling algorithms to workload characteristics. With a set of workloads classified by the amount of allocated resources and their allocation times, we perform experiments with various load scheduling algorithms. As adaptive scheduling algorithms, ARR and ALC are introduced on top of the ALBM (adaptive load balancing and management) cluster system. We present the performance results with a number of classified workloads and a realistic workload, explaining the performance relationship between workloads and scheduling algorithms. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Choi, E., & Min, D. (2004). Suitability of load scheduling algorithms to workload characteristics. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3019, 83–88. https://doi.org/10.1007/978-3-540-24669-5_11

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