The Community for Technology Leaders
Green Image
<p>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.</p>
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. , pp. 1393-1395, November 1990, doi:10.1109/12.61049
88 ms
(Ver 3.3 (11022016))