Title :
Halvers and expanders [switching]
Author :
Ajtai, Miklós ; Komlós, János ; Szemerédi, Endre
Author_Institution :
IBM San Jose, CA, USA
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
Keywords :
combinatorial switching; parallel algorithms; asymptotic efficiency; building blocks; combinatorial circuits; combinatorial networks; comparator switch; expanders; halvers; k-sorter switches; parallel algorithms; Binary trees; Bipartite graph; Delay effects; Parallel algorithms; Registers; Sorting; Switches; Switching circuits;
Conference_Titel :
Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on
Conference_Location :
Pittsburgh, PA
Print_ISBN :
0-8186-2900-2
DOI :
10.1109/SFCS.1992.267782
