Embedding trees in massively parallel computers

Abstract Trees are a useful class of computational structures. In parallel processing, mapping problems arise when the tree structure differs from the processor interconnection of the parallel computer. The MasPar's MP-2 is a massively parallel computer where processors are interconnected via the X-Net neighborhood two-dimensional mesh and the global multistage crossbar router network. We present novel mapping schemes for trees on the MasPar's MP-2 two-dimensional mesh and on the two-dimensional mesh together with the MasPar's MP-2 multistage crossbar network. Appropriate algorithms of the mapping scheme on the two-dimensional mesh (or grid) are presented and are shown to be superior over known mappings on square arrays (or grids).