Abstract:
The authors investigate the asymptotic efficiency of certain combinatorial networks called halvers, which are basic building blocks of many parallel algorithms. They impr...Show MoreMetadata
Abstract:
The authors investigate the asymptotic efficiency of certain combinatorial networks called halvers, which are basic building blocks of many parallel algorithms. They improve the efficiency of halvers in terms of their depth. The novelty is the use of combinatorial circuits whose basic units are k-sorter switches.<>
Date of Conference: 24-27 October 1992
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-8186-2900-2
