Synchronizing Arbitrary Processor Groups in Dynamically Partitioned 2-D Meshes

A general purpose synchronization mechanism for a parallel computershould allow arbitrary, data-dependent, dynamically partitioned groups ofprocessors to remain internally synchronized, while proceeding asynchronouslywith respect to other groups. We present an algorithm which cansupport such a scheme. The algorithm constructs binary synchronizationtrees for the sub-groups, given a group of processors and a f0; 1g label foreach processor, and is valid for any network. We provide a general...