An optimized reconfigurable architecture for transputer networks
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper presents the architecture of a fully reconfigurable distributed memory computing system. It is assumed that the processors communicate via message passing on an application specific regular network of degree four. To realize any network of this class, they use a special multistage Clos network which is built up by a minimal number of equal sized switches. These switches can be configured to realize any connection between input and output ports. To map a network onto the architecture, the process graph has to be partitioned into a number of subsets. The authors prove that the number of external edges between the subsets can be bounded. For that reason, it is possible to minimize the number of links and switches in the architecture without losing the ability to realize any regular network of degree four. Moreover, any user specific network can be mapped efficiently on the architecture. The practical relevance of this work was shown by the realization of the architecture by Parsytec. Their largest system has 320 processors.Keywords
This publication has 12 references indexed in Scilit:
- Performance benefits from locally adaptive interval routing in dynamically switched interconnection networksPublished by Springer Nature ,1991
- Embedding one Interconnection Network in AnotherPublished by Springer Nature ,1990
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987
- The torus routing chipDistributed Computing, 1986
- Classification Categories and Historical Development of Circuit Switching TopologiesACM Computing Surveys, 1983
- Algorithms for Edge Coloring Bipartite Graphs and MultigraphsSIAM Journal on Computing, 1982
- Universal schemes for parallel communicationPublished by Association for Computing Machinery (ACM) ,1981
- Very high-speed computing systemsProceedings of the IEEE, 1966
- A Study of Non-Blocking Switching NetworksBell System Technical Journal, 1953
- Die Theorie der regulären graphsActa Mathematica, 1891