Token distribution on reconfigurable d-dimensional meshes

Abstract

We propose an algorithm to solve the Token Distribution problem, a static variant of the load balancing problem, on d-dimensional, reconfigurable meshes with toroidal connections and side length n. No other algorithms have been proposed under this model of computation. We show that for token size T, the discrepancy /spl Delta/ between the maximum and minimum number of tokens per PE can be reduced to 1 in at most 2n/spl Delta/(T+4d) steps.<>