Dynamic Load Balancing Algorithm for $\textsc{k}$-ary n-cubes

$\textsc{k}$-ary n-큐브 상에서의 동적 부하 균등 알고리즘

In parallel system, the execution times of tasks cannot be accurately estimated and tasks may arrive at any time. In case, processors are overweighted with workload, the system utilization deteriorates. To solve this problem, dynamic load balancing that rearranges tasks in overloaded processors is required. We prospose the improved dynamic load balancing algorithm for $\textsc{k}-ary$ n-cubes using the property of ring and MWA which is the dynamic load balancing one for mesh. The proposed algorithm which uses the global load information has less communication cost than GDE, DDE and load difference within 1.