Visualizing PRAM Algorithm for Mergesort

Undergraduate algorithms courses are a natural setting for teaching many of the theoretical ideas of parallel computing. Mergesort is a fundamental sequential divide-and-conquer algorithm often analyzed in such courses. In this work, we present a visualization tool to help demonstrate a novel PRAM a...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) s. 365 - 368
Hlavní autori: Wiley, Cade, Ballard, Grey
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 27.05.2024
Predmet:
animation
Distributed processing
Education
Forestry
Instruction sets
Merging
multithreaded programming
OpenMP
Parallel processing
pedagogical tools
sorting
Visualization
work/span analysis
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Undergraduate algorithms courses are a natural setting for teaching many of the theoretical ideas of parallel computing. Mergesort is a fundamental sequential divide-and-conquer algorithm often analyzed in such courses. In this work, we present a visualization tool to help demonstrate a novel PRAM algorithm for mergesort that is work efficient and has polylogarithmic span. Our implementation uses the Thread -Safe Graphics Library, which has an existing visualization of parallel mergesort. We demonstrate that our proposed algorithm has better work and span than the one currently visualized.
DOI:10.1109/IPDPSW63119.2024.00083