Simulation and Visualization Tools for Teaching Parallel Merge Sort

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This paper describes tools [4] which simulate and visualize the CREW PRAM optimal parallel merge sort algorithm by Cole [1]. These tools can be used to run simulations of the algorithm for diflerent data and sampling strategies, to gather statistics during the simulations, to animate the flow of data and the processor allocations during the execution of the algom thm, and most importantly to aid in understanding the algorithm. These tools can be used in conjunction with a discussion of the algorithm in a course on algorithms or parallel algorithms at the senior undergraduate or graduate level. © 1993, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Trahan, R., & Rodger, S. (1993). Simulation and Visualization Tools for Teaching Parallel Merge Sort. ACM SIGCSE Bulletin, 25(1), 237–241. https://doi.org/10.1145/169073.169461

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free