Tag Archives: sorting algorithms

Sorting Processor Design to Sort a Serial Stream

Till now the sorting architectures discussed are based on the accessing of data elements in parallel. In real time situation the data streams are serial and serial to parallel conversion is costly as well as time consuming. On the other hand, parallel sorting architectures are very costly in terms of comparators. Thus alternate sorting architectures… Read More »

Sorting Architectures

Parallel Sorting Architectures Bitonic Sorter An alternative parallel Sorter Merge Parallel Sorter Serial Sorting Architectures Bubble Sorter Insertion Sorter Serial Sort Architecture Bubble Sort Behavioral Insertion Sort Behavioral Selection Sort Behavioral Design of a Sorting Processor to Sort Serial Data Stream 00

Bitonic Sorter

Batcher’s Bitonic sorter is a parallel sorting algorithm whose main operation is a technique for merging two Bitonic sequences. A Bitonic sequence is the concatenation of an ascending and a descending sequence of numbers. For example, 2, 4, 6, 8, 9, 24, 6, 3, 2, 0 is a Bitonic sequence. To sort a sequence of… Read More »