Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems

This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem and study the performance of the proposed algorithm under different conditions. The simulation results indicate that the wide-area scheduling algorithm is sensitive to several parameters including machine failure rates, the local queuing policies, and arrival rates.

• Type: Conference
• Year: 2002
• Where: IPPS
• Authors: Hongtu Chen, Muthucumaru Maheswaran
• Keywords: Distributed And Parallel Computing, IPPS 2002, Wide-area Network, Wide-area Scheduling Algorithm, Wide-area Task Allocation