Minimizing average response time for scheduling stochastic workload in heterogeneous computational grids

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

Abstract

Scheduling stochastic workloads is a difficult task. We analyze minimum average response time of computational grids composed of nodes with multiple processors when stochastic workloads are scheduled to the grids. We propose an algorithm to achieve minimum average response time of grids. We compare the minimum average response time of grids with the average response time of grids with load balancing scheduling in different cases. Specifically, we analyze the impact of differential processor speeds, the number of processors per node, and utilization rate of the grids on the difference between these two scheduling strategies. These analysis provide deeper understanding of average response time of grids, which will allow us to design more efficient algorithms for Grid workload scheduling. © 2006 Springer-Verlag.

Cite

CITATION STYLE

APA

Hu, J., & Klefstad, R. (2006). Minimizing average response time for scheduling stochastic workload in heterogeneous computational grids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4297 LNCS, pp. 47–59). https://doi.org/10.1007/11945918_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