๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Parallel Sorting Algorithm Using Multiwa
โœ Bhabani P. Sinha; Amar Mukherjee ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 288 KB

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+

Free sorting of images: Attributes used
โœ Abebe Rorissa; Samantha K. Hastings ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 731 KB

## 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

Performance modelling of three parallel
โœ Narasimhan, V. Lakshmi; Armstrong, J. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 961 KB

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.