CS646: Assignment: 1) Odd-Even Merging Network
CS646: Assignment: 1) Odd-Even Merging Network
CS646: Assignment
=============================================================
3) Lexicographic Combination:
If the first m elements of the th lexicographic combination X() are a1,
a2, ...., am then show that satisfies the following:
n- am
6) Bitonic merge :
a) State and prove the theorem of Bitonic merge.
b) Write the Biotonic sort algorithm to sort 2n elements using a
Hypercube with 2n processors.
c) Derive its time complexity.
The Design and Analysis of Parallel Algorithms by Selim G. Akl (Apr 1989)
[B]
Parallel Sorting Algorithms (Notes and Reports in Computer Science and Applied Mathematics, 12)
by Selim G. Akl (Oct 1985)
[C]