The problem of sorting n elements using VLSI chips that can sort only q(q less than n) elements at a time is considered. The proposed VLSI chip consists of a mesh of trees. Two classical algorithms, i. e. , merge sort and bitonic sort, are modified to efficiently solve the external sorting problem using this chip.
EXTERNAL SORTING IN VLSI
BONUCCELLI, MAURIZIO ANGELO;PAGLI, LINDA
1984-01-01
Abstract
The problem of sorting n elements using VLSI chips that can sort only q(q less than n) elements at a time is considered. The proposed VLSI chip consists of a mesh of trees. Two classical algorithms, i. e. , merge sort and bitonic sort, are modified to efficiently solve the external sorting problem using this chip.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
