A decentralized task scheduling algorithm and its performance modeling for computer networks

A dynamic task scheduling algorithm is presented. The algorithm is an extension of a nearest neighbor load balancing strategy with an enhanced degree of efficiency and it is intended for multicomputers connected by a store and forward communication network. The algorithm is modeled by a central server open queueing network. It is shown that the response time of a task consists of two parts. The first part comprises a task's settling time which consists of scheduling time, communication time, and waiting time. The second part comprises waiting time in the execution queue in the execution time itself. The algorithm is comprehensively evaluated through a simulation and analytical model, and is shown to be both stable and efficient. For performance evaluation, the task transfer cost and the scheduling overhead is also taken into account. Experimental results are also obtained for another nearest neighbor scheduling scheme and compared with the algorithm.<
>