Parallel Algorithm Mapping
Parallel Algorithm Mapping is a systematic process in parallel computing that assigns algorithmic tasks to specific processing units within a parallel architecture, differentiating itself from related scheduling and load-balancing techniques by focusing on the structural and temporal optimization of task-to-resource allocations to maximize concurrency and minimize communication overhead.
170
Publications
5.3K
Citations
466
Authors
189
Institutions
Publications per year
2017–2026
15
170
Mapping parallelism to multi-cores
Zheng Wang, Michael O’Boyle · 2009 · 189 citations
A Mapping Strategy for Parallel Processing
Soo-Young Lee, Aggarwal · IEEE Transactions on Computers · 1987 · 183 citations
Mapping Applications to Tiled Multiprocessor Embedded Systems
Lothar Thiele, Iuliana Bacivarov, Wolfgang Haid et al. · Proceedings · 2007 · 178 citations
Bart Kienhuis, E. Rijpkema, E. Deprettere · 2000 · 170 citations
1–5 of 170
466
5
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 466
189
University of Illinois Urbana-Champaign
Urbana, United States
7 h-index
16 publications
511 citations

École Normale Supérieure de Lyon
Lyon, France
6 h-index
13 publications
356 citations
IBM (United States)
Armonk, United States
5 h-index
6 publications
194 citations
University of Southern California
Los Angeles, United States
5 h-index
10 publications
263 citations
University of Washington
Seattle, United States
4 h-index
6 publications
239 citations
ETH Zurich
Zurich, Switzerland
4 h-index
10 publications
812 citations
Michigan State University
East Lansing, United States
4 h-index
5 publications
175 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
7 publications
339 citations
1–8 of 189
TPDS · 8 publications · 350 citations
8
h-index
4 publications · 280 citations
4
h-index
4 publications · 208 citations
4
h-index
3 publications · 194 citations
3
h-index
3 publications · 170 citations
3
h-index
1–5