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

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.

[1]  Christos Douligeris,et al.  A game theoretic perspective to flow control in telecommunication networks , 1992 .

[2]  Francine Berman,et al.  Grid Computing: Making the Global Infrastructure a Reality , 2003 .

[3]  Bharadwaj Veeravalli,et al.  Rate-based and queue-based dynamic load balancing algorithms in distributed systems , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

[4]  Jie Li,et al.  Load Balancing Problems for Multiclass Jobs in Distributed/Parallel Computer Systems , 1998, IEEE Trans. Computers.

[5]  Refael Hassin,et al.  To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems , 2002 .

[6]  Hau L. Lee,et al.  A note on the convexity of performance measures of M/M/c queueing systems , 1983 .

[7]  Samuel T. Chanson,et al.  Hydrodynamic Load Balancing , 1999, IEEE Trans. Parallel Distributed Syst..

[8]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[9]  Kristina Lerman,et al.  Resource allocation in the grid using reinforcement learning , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[10]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[11]  Ronald E. Miller.  Optimization: Foundations and Applications , 1999 .

[12]  Ian Foster.  Internet Computing and the Emerging Grid , 2000 .

[13]  Hisao Kameda,et al.  A paradox in optimal flow control of M/M/m queues , 2006, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[14]  Paul H. Zipkin,et al.  Strong Convexity Results for Queueing Systems , 1987, Oper. Res..

[15]  Emmanuel Jeannot,et al.  On the distribution of sequential jobs in random brokering for heterogeneous computational grids , 2006, IEEE Transactions on Parallel and Distributed Systems.