The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1990 vol.39)
pp: 1393-1395
ABSTRACT
<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>
INDEX TERMS
interconnection network; distributed recursive computations; communicating processes; multiprocessor system; load balancing; message routing; trivial routing; planar embedding; multiprocessor interconnection networks.
CITATION
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, November 1990, doi:10.1109/12.61049
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool