Applying internet random early detection strategies to scheduling in grid environments

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

Abstract

Resource Allocation in Grid environments to date is generally carried out under the assumption that there is one primary scheduling system scheduling jobs. However, as environments tend towards larger open "utility" Grids it becomes increasingly likely that deployments will involve multiple independent schedulers allocating jobs over the same resources. In this paper we show that, if using current standard scheduling approaches, such multi-scheduler environments may well be prone to serious oscillation problems in resource allocation similar to those commonly found in IP network traffic. Further we demonstrate how common techniques from IP networks - in particularly approaches based on Random Early Detection (RED) buffer management and its subsequent extensions / variations - may provide an effective way to damp or eliminate such oscillations. The paper describes the analogy between multi-scheduler Grid resource allocation and IP network routing and explores the impact of oscillation and RED methods by simulation. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Brugnoli, M., Willmott, S., Heymann, E., Hurley, P., & Senar, M. A. (2007). Applying internet random early detection strategies to scheduling in grid environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4873 LNCS, pp. 587–598). Springer Verlag. https://doi.org/10.1007/978-3-540-77220-0_53

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