Minimizing Average Response Time for Scheduling Stochastic Workload in Heterogeneous Computational Grids

  • Jie Hu
  • Raymond Klefstad
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4297)


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.


Load Balance Utilization Rate Service Rate System Load Grid Environment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Foster, I.: Internet Computing And The Emerging Grid. Nature Web Matters (2000)Google Scholar
  2. 2.
    Berman, F., Fox, G., Hey, T.: Grid Computing: Making the Global Infrastructure a Reality. John Wiley and Sons, Chichester (2003)Google Scholar
  3. 3.
    Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)Google Scholar
  4. 4.
  5. 5.
    Foster, I.: The Challenges of Grid Computing. Condor Week Presentation at via Access Grid (2002)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Hui, C.C., Chanson, S.T.: Hydrodynamic Load Balancing. IEEE Transactions On Parallel And Distributed Systems 10(11) (1999)Google Scholar
  8. 8.
    Ross, S.M.: Introduction to Probability Models. Harcourt Brace and Company (1993)Google Scholar
  9. 9.
    Douligeris, C., Mazumdar, R.: A game theoretic perspective to flow control in telecommunication networks. Journal of the Franklin Institute 329, 383–402 (1992)MATHCrossRefGoogle Scholar
  10. 10.
    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)CrossRefMathSciNetGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Harel, A.Z.P.: Strong convexity result for queueing systems. Operations Research 35, 405–418 (1987)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Lee HL, C.M.: An interior-point ℓ1-penalty method for nonlinear optimization. In: International Conference on Continuous Optimization (ICCOPT I) (2004)Google Scholar
  14. 14.
    Miller, E.R.: Optimization: Foundation and Applications. John Wiley and Sons, Chichester (2000)Google Scholar
  15. 15.
    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)Google Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    Li, J., Kameda, H.: Load Balancing Problems for Multiclass Jobs in Distributed/Parallel Computer Systems. IEEE Transactions On Computers 47(3) (1998)Google Scholar
  18. 18.
    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)Google Scholar
  19. 19.
    Hassin, R., Haviv, M.: To Queue Or Not To Queue: Equilibrium Behavior In Queueing Systems. Kluwer Academic Publishers, Dordrecht (2003)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jie Hu
    • 1
  • Raymond Klefstad
    • 1
  1. 1.Department of Electrical Engineering and Computer ScienceUniversity of CaliforniaIrvineUSA

Personalised recommendations