The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - October (1991 vol.2)
pp: 385-397
ABSTRACT
<p>The architecture and performance of binary shuffle-exchange networks of any size are investigated. It is established that a network with a shuffle-exchange stages whose number equals the least integer (or=log/sub 2/N) or a single recirculating stage can provide the connectivity between N inputs and N outputs using a distributed tag-based control algorithm. Control tags depend on both source and destination when N is not a power of two and can be computed in a simple manner. Several structural and dynamic properties of the network are established, contrasting the behavior of the power-of-two and composite sized systems. The performance of the network in a stochastic environment is investigated analytically. It is shown that the shuffle-exchange networks behave in much the same way with respect to traffic and buffer capacity regardless of whether the system size is a power of two or not.</p>
INDEX TERMS
Index Termscontrol tags; structural properties; traffic capacity; binary shuffle-exchange networks;multiprocessors; architecture; performance; connectivity; distributed tag-based controlalgorithm; source; destination; dynamic properties; stochastic environment; buffercapacity; multiprocessing systems; multiprocessor interconnection networks; parallelarchitectures; performance evaluation
CITATION
K. Padmanabhan, "Design and Analysis of Even-Sized Binary Shuffle-Exchange Networks for Multiprocessors", IEEE Transactions on Parallel & Distributed Systems, vol.2, no. 4, pp. 385-397, October 1991, doi:10.1109/71.97896
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool