5 pages matching SHARESORT in this book
Results 1-3 of 5
What people are saying - Write a review
We haven't found any reviews in the usual places.
Networks for Sorting
The Perfect Shuffle
8 other sections not shown
0(n log 2r block Algorithm 3.3 analysis assume binary representation Bitonic Merger bitonic sequence Bitonic Sort Chapter column comparators Computer Science connected cube cube-connected cube-connected cycles described end for end end if end Enumeration Sort external sorting Heapsort Hence IEEE IEEE Trans illustrated in Fig implementation initially input and output input sequence integer Kung leaf processors Leiserson length n/p log2 lower bound Mergesort merging algorithm mesh mesh-connected parallel computer MIMD model of computation Nassimi number of processors odd-even operations optimal output lines parallel algorithm parallel sorting algorithms perfect shuffle performed pipeline Preparata problem Proc processor at level Quicksort register-exchange rithm route steps row-major indexing row-major order Rr registers running Sahni Section sequence of length shared memory SHARESORT shown in Fig simultaneously smallest element sors sorted sequence sorted subsequence sorting network sorting the sequence stage storage modules stored subse subsequences of length tape Theorem tree machine units VLSI