Fort Lauderdale, Florida
Apr. 15, 2002 to Apr. 19, 2002
Hongtu Chen , University of Manitoba
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.
dynamic scheduling, Grid computing, task allocation
Hongtu Chen, "Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems", IPDPS, 2002, Parallel and Distributed Processing Symposium, International, Parallel and Distributed Processing Symposium, International 2002, pp. 0088b, doi:10.1109/IPDPS.2002.1015664