article

Free access

Simulation and visualization tools for teaching parallel merge sort

Authors:

Robin Trahan,

Susan RodgerAuthors Info & Claims

ACM SIGCSE Bulletin, Volume 25, Issue 1

Pages 237 - 241

https://doi.org/10.1145/169073.169461

Published: 01 March 1993 Publication History

PDF eReader

References

[1]

R. Cole. "Parallel Merge Sort," SIAM Journal on Computing, 17(4):770-785, August 1988.

Digital Library

Google Scholar

[2]

M. Ajtai, J. Koml6s, and E. Szemer~di. "Sorting in clog n Parallel Steps," Combinatorica, vol. 3, 1983, pp. 1-19.

Digital Library

Google Scholar

[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

Cited By

View all

Sears AWolfe R(1995)Visual analysisACM SIGCSE Bulletin10.1145/199691.19977827:1(195-198)Online publication date: 15-Mar-1995
https://dl.acm.org/doi/10.1145/199691.199778
Sears AWolfe RLaxer C(1995)Visual analysisProceedings of the twenty-sixth SIGCSE technical symposium on Computer science education10.1145/199688.199778(195-198)Online publication date: 15-Mar-1995
https://dl.acm.org/doi/10.1145/199688.199778
Rodger S(2018)Reflections on SIGCSE from the past 30 yearsACM Inroads10.1145/32306959:4(22-26)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1145/3230695
Show More Cited By

Recommendations

Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
IPDPS '02: Proceedings of the 16th International Parallel and Distributed Processing Symposium

Sort 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 ...
Tools for DEVS modeling, simulation and 3D visualization
Simutools '09: Proceedings of the 2nd International Conference on Simulation Tools and Techniques

Cell-DEVS is an extension of the DEVS formalism which combines DEVS with Cellular Automata. It is particularly useful for defining spaces by decomposing them into individual cells. The CD++ Toolkit enables one to model and simulate a real or artificial ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGCSE Bulletin Volume 25, Issue 1

March 1993

307 pages

ISSN:0097-8418

DOI:10.1145/169073

Editor:
James E. Miller
Univ. of Southern Mississippi, Hattiesburg

Issue’s Table of Contents

SIGCSE '93: Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education
April 1993
311 pages
ISBN:0897915658
DOI:10.1145/169070
Chairmen:
Bruce J. Klein
Grand Valley State Univ., Allendale, MI
,
Cary Laxer
Rose-Hulman Institute of Technology, Terre Haute, IN
,
Frank H. Young
Rose-Hulman Institute of Technology, Terre Haute, IN

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1993

Published in SIGCSE Volume 25, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
752
Total Downloads

Downloads (Last 12 months)99
Downloads (Last 6 weeks)25

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sears AWolfe R(1995)Visual analysisACM SIGCSE Bulletin10.1145/199691.19977827:1(195-198)Online publication date: 15-Mar-1995
https://dl.acm.org/doi/10.1145/199691.199778
Sears AWolfe RLaxer C(1995)Visual analysisProceedings of the twenty-sixth SIGCSE technical symposium on Computer science education10.1145/199688.199778(195-198)Online publication date: 15-Mar-1995
https://dl.acm.org/doi/10.1145/199688.199778
Rodger S(2018)Reflections on SIGCSE from the past 30 yearsACM Inroads10.1145/32306959:4(22-26)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1145/3230695
Poon J(2000)Java meets teletubbiesProceedings of the Australasian conference on Computing education10.1145/359369.359399(195-202)Online publication date: 1-Dec-2000
https://dl.acm.org/doi/10.1145/359369.359399

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Recommendations

Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers

Parallel Merge Sort with Load Balancing

Tools for DEVS modeling, simulation and 3D visualization

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations