Note that throughout this paper, the rate of ''MB/s'' will always represent 10 6 bytes per second.
A Randomized Parallel Sorting Algorithm with an Experimental Study
✍ Scribed by David R. Helman; David A. Bader; Joseph JáJá
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 524 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Connected component labeling is a fundamental task in computer vision. This paper presents parallel implementations of connected component labeling for grey level images on the iPSC/2 and iPSC \(/ 860\) hypercubes, the CM-5, and on the shared memory Encore Multimax multiprocessor. Several partitioni
A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (≤n) processors are used for a problem with n variables and a globally optimal solution is fo
The main real-coded genetic algorithm (RCGA) research effort has been spent on developing efficient crossover operators. This study presents a taxonomy for this operator that groups its instances in different categories according to the way they generate the genes of the offspring from the genes of