Task Graph Mapping
Task Graph Mapping is a computational optimization problem that belongs to the class of resource allocation and scheduling problems in reconfigurable computing, specifically defined as the process of assigning nodes of a task graph, representing computational operations, to processing elements of a Coarse-Grained Reconfigurable Architecture while satisfying data dependencies, timing constraints, and resource limitations to maximize performance or efficiency.
78
Publications
2.5K
Citations
224
Authors
119
Institutions
Publications per year
2017–2026
6
78
Executing task graphs using work-stealing
Kunal Agrawal, Charles E. Leiserson, Jim Sukha · 2010 · 67 citations · Full text
1–5 of 78
224
3
h-index
Rutgers, The State University of New Jersey, United States
3 publications · 98 citations
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 224
119

Centre National de la Recherche Scientifique
Paris, France
7 h-index
15 publications
315 citations

École Normale Supérieure de Lyon
Lyon, France
4 h-index
11 publications
318 citations
Politecnico di Milano
Milan, Italy
3 h-index
10 publications
150 citations
Princeton University
Princeton, United States
3 h-index
5 publications
137 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
5 publications
148 citations

Sharif University of Technology
Tehran, Iran
2 h-index
5 publications
68 citations
IMEC
Leuven, Belgium
2 h-index
4 publications
172 citations

National University of Defense Technology
Changsha, China
2 h-index
4 publications
148 citations
1–8 of 119
TPDS · 3 publications · 132 citations
3
h-index
2 publications · 65 citations
2
h-index
2 publications · 144 citations
2
h-index
2 publications · 67 citations
2
h-index
JSA · 1 publications · 13 citations
1
h-index
1–5