TY - JOUR
T1 - Embedding classical communication topologies in the scalable OPAM architecture
AU - Barak, Amnon
AU - Schenfeld, Eugen
PY - 1996
Y1 - 1996
N2 - This paper presents novel embeddings of various classical topologies into the OPAM multicomputer. OPAM consists of a large number of processors that are connected by a two level, crossbar based interconnection network. The network combines a large, optical circuit-switched crossbar (reconfigurable network), with many small, packet-switching crossbars. The needed embedding is very different than the classical approaches. The goal in our case is to minimize routing decisions, so that communication requests can be satisfied by passing through two small crossbars. We show how to map parallel programs to this architecture using graph contraction notations. The family of parallel programs that we consider consists of multiple processes and communication links that are represented by connected, regular graphs such as rings, trees, two dimensional grids, cube connected cycles and hypercubes. In each case we show how to partition the vertex set of the program's graph to subsets, and how to assign each subset a cluster of processors in order to realize the topology of the given problem. In some of the cases we also prove that our partition and assignment algorithms are optimal.
AB - This paper presents novel embeddings of various classical topologies into the OPAM multicomputer. OPAM consists of a large number of processors that are connected by a two level, crossbar based interconnection network. The network combines a large, optical circuit-switched crossbar (reconfigurable network), with many small, packet-switching crossbars. The needed embedding is very different than the classical approaches. The goal in our case is to minimize routing decisions, so that communication requests can be satisfied by passing through two small crossbars. We show how to map parallel programs to this architecture using graph contraction notations. The family of parallel programs that we consider consists of multiple processes and communication links that are represented by connected, regular graphs such as rings, trees, two dimensional grids, cube connected cycles and hypercubes. In each case we show how to partition the vertex set of the program's graph to subsets, and how to assign each subset a cluster of processors in order to realize the topology of the given problem. In some of the cases we also prove that our partition and assignment algorithms are optimal.
KW - Graph contractions
KW - Graph embeddings
KW - Interconnection networks
KW - Mapping algorithms
KW - Parallel programs
UR - http://www.scopus.com/inward/record.url?scp=0030247233&partnerID=8YFLogxK
U2 - 10.1109/71.536941
DO - 10.1109/71.536941
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0030247233
SN - 1045-9219
VL - 7
SP - 979
EP - 992
JO - IEEE Transactions on Parallel and Distributed Systems
JF - IEEE Transactions on Parallel and Distributed Systems
IS - 9
ER -