Issue No. 12 - December (2002 vol. 13)
<p><b>Abstract</b>—A new methodology named CALMANT (<it>CC-cube Algorithms on Meshes and Tori</it>) for mapping a kind of algorithms that we call CC-cube algorithm onto multicomputers with hypercube, mesh, or torus interconnection topology is proposed. This methodology is suitable when the initial problem can be expressed as a set of processes that communicate through a hypercube topology (<it>a CC-cube</it> algorithm). There are many important algorithms that fit into the CC-cube type. CALMANT is based on three different techniques: a) the <it>standard embedding</it> to assign the processes of the algorithm to the nodes of the mesh multicomputer; b) the <it>communication pipelining technique</it> to increase the level of communication parallelism inherent in the CC-cube algorithms; and c) <it>optimal message-scheduling algorithms</it> proposed in this work in order to avoid conflicts and minimizing in this way the communication time. Although CALMANT is proposed for multicomputers with different interconnection network topologies, this paper only focuses on the particular case of meshes.</p>
Mapping algorithms, hypercube algorithms, mesh interconnected multicomputers, standard embedding, communication pipelining, message-scheduling algorithms, complete exchange.
A. González, M. Valero-García and L. Díaz de Cerio, "Hypercube Algorithms on Mesh Connected Multicomputers," in IEEE Transactions on Parallel & Distributed Systems, vol. 13, no. , pp. 1247-1260, 2002.