An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes.
Manoj KumarDaniel S. HirschbergPublished in: IEEE Trans. Computers (1983)
Keyphrases
- computational cost
- parallel implementation
- dynamic programming
- improved algorithm
- cost function
- times faster
- experimental evaluation
- learning algorithm
- computational complexity
- theoretical analysis
- preprocessing
- significant improvement
- tree structure
- hardware implementation
- sorting algorithms
- worst case
- detection algorithm
- parallel processing
- ibm sp
- neural network
- linear programming
- data sets
- simulated annealing
- search space
- reinforcement learning
- cluster of workstations
- particle swarm optimization
- genetic algorithm
- multiprocessor systems
- memory efficient
- distributed memory
- parallel computation
- feature selection
- data structure
- video sequences
- np hard
- segmentation algorithm
- expectation maximization