Recursive construction of distributors by merging
Refereed conference paper presented and published in conference proceedings


Full Text

Times Cited

Other information
AbstractA distributor is a time-multiplexed switch that routes active input signals to output ports in the round-robin fashion. This paper presents the Merge-Distribute algorithm for the recursive construction of distributors in the form of parallel distributed-control networks, as analogous to the recursive construction of sorting networks by the Mergesort algorithm. The Merge-Distribute algorithm achieves the best known depths for distribution networks of all sizes within the practical range. The rigorous algebraic formulation AMkeeps the algorithmic construction transparent and affords many variations in the construction so as to flexibly cope with ad hoc engineering constraints in implementation.
All Author(s) ListLi S.-Y.R., Tan X.
Name of ConferenceIASTED International Conference on Parallel and Distributed Computing and Networks, as part of the 23rd IASTED International Multi-Conference on Applied Informatics
Start Date of Conference15/02/2005
End Date of Conference17/02/2005
Place of ConferenceInnsbruck
Country/Region of ConferenceAustria
Year2005
Month11
Day30
Pages680 - 685
ISSN1027-2666
LanguagesEnglish-United Kingdom
Keywords2-Stage interconnection network with input exchange, Automata, Circular unimodal function, Distributor, Merge-Distribute algorithm

Last updated on 2020-03-08 at 02:04