(R) A Load - Balancing Algorithm for N-Cubes

Authors:
Affiliations:
Venue:
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 3
Year:
1996

Citing 0
Cited 2

The hybrid dynamic parallel scheduling algorithm for load balancing on Chained-Cubic Tree interconnection networks

The Journal of Supercomputing
An empirical comparative study of decentralized load balancing algorithms in clustered storage environment

ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: A parallel scheduling algorithm for N-cube networks is presented in this paper. This algorithm can fully balance the load and maximize locality by using global load information. Communication costs are significantly reduced compared to other existing algorithms.