
- 1 R. Cole. "Parallel Merge Sort," SIAM Journal on Computing, 17(4):770-785, August 1988. Google Scholar
Digital Library
- 2 M. Ajtai, J. Koml6s, and E. Szemer~di. "Sorting in clog n Parallel Steps," Combinatorica, vol. 3, 1983, pp. 1-19. Google Scholar
Digital Library
- 3 K. E. Batcher. "Sorting Networks and Their Applications," Proc. AFIPS Spring joint Summer Computer Conference, 307-314, 1968.Google Scholar
- 4 It. Trahan. "Simulation, Study, and Visualization of Cole's Parallel Merge Sort." Master's Projects Itensselaer Polytechnic Institute, 1991.Google Scholar
Index Terms
Simulation and visualization tools for teaching parallel merge sort
Recommendations
Using Scientific Visualization Techniques to Visualize Parallel Network Simulations
SIGSIM-PADS '19: Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete SimulationAlthough parallel discrete event simulation has been used to simulate and study the performance of various network topologies, little effort has been spent on visualizing the time series data that result from these simulations. Visualization can be ...
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
IPDPS '02: Proceedings of the 16th International Parallel and Distributed Processing SymposiumSort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implemented on distributed memory computers has poor performance due to the ...
Parallel Merge Sort with Load Balancing
Parallel merge sort is useful for sorting a large quantity of data progressively. The merge sort should be parallelized carefully since the conventional algorithm has poor performance due to the successive reduction of the number of participating ...






Comments