Sorting using networks of deques
โ Scribed by A. Nozaki
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 372 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This algorithm, when implemented on a t dimensional mesh having n t nodes (t>2), sorts n t elements in O((t 2 &3t+2) n) time, thus offering a better order of time complexity than the [((t 2 &t) n log n)ร2+
## Abstract Categorization is crucial to human perception and cognition. Without the abilities to categorize, people would not be able to deal with the multitude of things they perceive daily. Past research has shown that categorization also facilitates effective and efficient browsing of both text
The implementation of three parallel sorting algorithms, namely binary sort, odd-even transposition sort and bitonic sort, on a network of transputers is analysedin the paper. The variation in the performance of these algorithms as the number of processors and sort size are changed is investigated.