Mapping and Compiled Communication on the Connection Machine System

Large processing speeds may be achieved by coordinating the work of many processors in a distributed memory architecture. FOT most applications, this approach mandates the communication of data amongst the distributed memories, and the cost of this communication can offset the advantage brought by massively parallel processing. We describe an optimization strategy that addresses this problem by dramatically reducing communication costs on the Connection Machine system.