Using Parallel Merge Sort to Teach Fundamental Concepts in Distributed Parallelism

Autor:	G. Michael Schneider
Rok vydání:	1999
Předmět:	General Computer Science Workstation Computer science Parallel algorithm Parallel computing Load balancing (computing) Telecommunications network Education law.invention law Merge algorithm Granularity Latency (engineering) Merge sort
Zdroj:	Computer Science Education. 9:148-161
ISSN:	1744-5175 0899-3408
DOI:	10.1076/csed.9.2.148.3810
Popis:	This paper describes how the algorithm called parallel merge sort can be used to teach fundamental concepts in the design of parallel algorithms for a network of workstations (NOW). First, the basic algorithm is introduced and its performance studied. Then, through a series of improvements based on a close examination of the algorithm and the underlying communication network, students are shown how performance can be significantly enhanced. This incremental approach lets students observe, first-hand, the critical importance of communication overhead, granularity, latency, and load balancing in designing efficient distributed parallel algorithms for a NOW environment.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::d482fac9f286c48cee2720d09adc1487 https://doi.org/10.1076/csed.9.2.148.3810 Zobrazit plný text záznamu