We discuss iterative nearest neighbor load balancing schemes on processor networks which are represented by a cartesian product of graphs like e.g. tori or hypercubes.By the use of hte Alternating-Direction loadbalsncing scheme,the number of load balance iterations decreases by a factor of 2 for this type of graphs.The resulting flow is analyzed theoretically and it can be very high for certain cases.There fore,we furthermore present the Mixed-Direction scheme which needs the same number of iterations but results in a much smaller flow.
展开▼
