scispace - formally typeset
Search or ask a question

Showing papers on "Bitonic sorter published in 1981"


Journal ArticleDOI
TL;DR: A method for parallel sorting in vector machines is described and it is shown that it has complexityO(N(logN)2).
Abstract: A method for parallel sorting in vector machines is described. It is shown that it has complexityO(N(logN)2).

14 citations


01 Dec 1981
TL;DR: The authors of this report have conducted research in external parallel sorting algorithms and made some important contributions and their findings are also reported herein.
Abstract: : A rather comprehensive survey of parallel sorting algorithms is included herein Parallel sorting algorithms are considered in two major categories - the internal parallel sorting algorithms and the external parallel sorting algorithms Because external sorting algorithms are important to the database applications, considerable emphases are made in the motivation and analysis of the external parallel sorting algorithms surveyed in the report In particular, the authors of this report have conducted research in external parallel sorting algorithms and made some important contributions Their findings are also reported herein (Author)

1 citations