This Article 
 Bibliographic References 
 Add to: 
An Interconnection Network for Distributed Recursive Computations
November 1990 (vol. 39 no. 11)
pp. 1393-1395

Distributed computations may be viewed as a set of communicating processes. If such a computation is to be executed by a multiprocessor system, the processes have to be distributed over the processors, and the communications have to be distributed over a network. This leads to the questions of load balancing and message routing. The authors consider distributed recursive computations and propose a class of interconnection networks that admits a homogeneous distribution of processes and trivial routing. A subclass that admits a planar embedding of the network is identified.

[1] A. J. Martin, "A distributed implementation method for parallel programming," inProc. IFIP-Congress, Oct. 1980.
[2] J. L. A. van de Snepscheut, "Mapping a dynamic tree on a fixed graph, JAN 78a," Caltech Internal Memo., Feb. 1981.
[3] S. A. Browning, "The tree machine: A highly concurrent computing environment," Ph.D. dissertation, California Instit. of Technol., 1980.

Index Terms:
interconnection network; distributed recursive computations; communicating processes; multiprocessor system; load balancing; message routing; trivial routing; planar embedding; multiprocessor interconnection networks.
A.L. Martin, J.L.A. van de Snepscheut, "An Interconnection Network for Distributed Recursive Computations," IEEE Transactions on Computers, vol. 39, no. 11, pp. 1393-1395, Nov. 1990, doi:10.1109/12.61049
Usage of this product signifies your acceptance of the Terms of Use.