Issue No. 04 - April (1989 vol. 38)

ISSN: 0018-9340

pp: 567-581

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.21149

ABSTRACT

It is shown that the binary de Bruijn multiprocessor network (BDM) can solve a wide variety of classes of problems. The BDM admits an N-node linear array, an N-node ring, (N-1)-node complete binary trees, ((3N/4)-2)-node tree machines, and an N-node one-step shuffle-exchange network, where N (=2/sup k/, k an integer) is the total number of nodes. The de Bruijn multiprocessor networks are proved

INDEX TERMS

de Bruijn multiprocessor network; versatile parallel processing; sorting network; VLSI; N-node linear array; N-node ring; binary trees; one-step shuffle-exchange network; tight lower bound; layout area; fault tolerant computing; multiprocessor interconnection networks; parallel processing; VLSI.

CITATION

M.R. Samatham, D.K. Pradhan, "The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI",

*IEEE Transactions on Computers*, vol. 38, no. , pp. 567-581, April 1989, doi:10.1109/12.21149