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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Foster, I.: Internet Computing And The Emerging Grid. Nature Web Matters (2000)
Berman, F., Fox, G., Hey, T.: Grid Computing: Making the Global Infrastructure a Reality. John Wiley and Sons, Chichester (2003)
Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)
OPTIPUTER: http://www.optiputer.net/
Foster, I.: The Challenges of Grid Computing. Condor Week Presentation at via Access Grid (2002)
Vandy Berten, J.l.G., Jeannot, E.: On the Distribution of Sequential Jobs in Random Brokering for Heterogeneous Computational Grids. IEEE Transactions On Parallel And Distributed Systems 17(2) (2006)
Hui, C.C., Chanson, S.T.: Hydrodynamic Load Balancing. IEEE Transactions On Parallel And Distributed Systems 10(11) (1999)
Ross, S.M.: Introduction to Probability Models. Harcourt Brace and Company (1993)
Douligeris, C., Mazumdar, R.: A game theoretic perspective to flow control in telecommunication networks. Journal of the Franklin Institute 329, 383–402 (1992)
Atsushi Inoie., H.K., Touati, C.: A paradox in optimal flow control of M/M/n queues. Computers and Operations Research 33, 356–368 (2006)
Lee HL, C.M.: A note on the convexity of performance measures of M/M/c queueing systems. Journal of Applied Probability 20, 920C3 (1983)
Harel, A.Z.P.: Strong convexity result for queueing systems. Operations Research 35, 405–418 (1987)
Lee HL, C.M.: An interior-point ℓ1-penalty method for nonlinear optimization. In: International Conference on Continuous Optimization (ICCOPT I) (2004)
Miller, E.R.: Optimization: Foundation and Applications. John Wiley and Sons, Chichester (2000)
Galstyan, A., Czajkowski, K., Lerman, K.: Resource Allocation in the Grid Using Reinforcement Learning. In: Third International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 3, pp. 1314–1315 (2004)
Casanova, H., Hayes, J., Yang, Y.: Algorithms and Software to Schedule and Deploy Independent Tasks in Grid Environments. In: Proc. Workshop Distributed Computing, Metacomputing, and Resource Globalization (2002)
Li, J., Kameda, H.: Load Balancing Problems for Multiclass Jobs in Distributed/Parallel Computer Systems. IEEE Transactions On Computers 47(3) (1998)
Zeng, Z., Veeravalli, B.: Rate-Based and Queue-Based Dynamic Load Balancing Algorithms in Distributed Systems. In: Proceedings of the Tenth International Conference on Parallel and Distributed Systems (ICPADS 2004) (2004)
Hassin, R., Haviv, M.: To Queue Or Not To Queue: Equilibrium Behavior In Queueing Systems. Kluwer Academic Publishers, Dordrecht (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, J., Klefstad, R. (2006). Minimizing Average Response Time for Scheduling Stochastic Workload in Heterogeneous Computational Grids. In: Robert, Y., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing - HiPC 2006. HiPC 2006. Lecture Notes in Computer Science, vol 4297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945918_11
Download citation
DOI: https://doi.org/10.1007/11945918_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68039-0
Online ISBN: 978-3-540-68040-6
eBook Packages: Computer ScienceComputer Science (R0)