Name
Abstract | ||
|---|---|---|
Communication networks stress the distinction between classical and massively parallel architectures. The network is the key for the whole architecture efficiency, while severe technological constraints limit the possible choices. This paper presents forced routing, which is the routing strategy of the MEGA massively parallel architecture. Forced routing is a trade-off between deterministic and randomized routing. In the absence of contention, messages follow one shortest path. As the contention increases, messages are randomly spread in the network. Moreover, the algorithm is quite simple and it only needs minor buffering capacity at each node; thus it is well adapted to hardwired implementation. In this paper, we test the performance of the forced and greedy strategies on a variety of communication patterns representing synchronous and asynchronous algorithms. Finally, we sketch a description of the circuit implementing the forced routing, in order to prove the technical feasibility of this appealing algorithm upon the constraint of a mono-chip node. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1006/jpdc.1993.1116 | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
communication architecture,message-passing multicomputer,message passing | Equal-cost multi-path routing,Multipath routing,Link-state routing protocol,Dynamic Source Routing,Computer science,Policy-based routing,Static routing,Parallel computing,Destination-Sequenced Distance Vector routing,Computer network,Geographic routing,Distributed computing | Journal |
Volume | Issue | ISSN |
19 | 4 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cécile Germain | 1 | 122 | 17.50 |
| Jean-Luc Béchennec | 2 | 56 | 11.21 |
| Daniel Etiemble | 3 | 300 | 42.43 |
| Jean-Paul Sansonnet | 4 | 130 | 24.44 |