processors. Two circle marks are for the ring network with

Abstract

will ignore this effect at the expense of some accuracy. Although the obtained expected performance improvement is an upper bound with uniform routing distribution, we expect to achieve as much improvement with other skewed distributions, in which a processor tends to communicate with a certain processors more heavily than with other processors. Our simulation results with some skewed distribution models shows that we achieve 15-20 % performance improvement (reduction of total message traffic density) compared with a random assignment, which by and large coincides with the analysis. On the other hand, unified partitioning and assignment leads to performance improvements as large as 50% in terms of the total c th 1.5 = c th 2.5 = c th 2.5 = c th 4.5 = c h c l c h c l 170 represen