Directed Acyclic Task Graphs is a formal computational model representing a finite set of tasks as nodes and precedence constraints as directed edges in a graph, distinguished by the absence of cycles to ensure a topologically ordered execution sequence.
108
Publications
7.6K
Citations
256
Authors
134
Institutions
Publications per year
2017–2026
15
Variants
Dag Task Graphs
Parents
Publications
108
Robert P. Dick, David L. Rhodes, Wayne Wolf · 1998 · 779 citations
Robert P. Dick, David L. Rhodes · 2002 · 464 citations
1–5 of 108
Authors
256
- OS
5
h-index
- AGApostolos Gerasoulis
Rutgers, The State University of New Jersey, United States
5 publications · 1K citations
5
h-index
- YK
3
h-index
- NK
3
h-index
- MJ
3
h-index
1–5 of 256
Institutions
134
Centre National de la Recherche Scientifique
Paris, France
7 h-index
16 publications
545 citations
Princeton University
Princeton, United States
6 h-index
13 publications
4.1K citations
École Normale Supérieure de Lyon
Lyon, France
5 h-index
14 publications
521 citations
University of Auckland
Auckland, New Zealand
5 h-index
7 publications
116 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
5 publications
160 citations
Laboratoire de l'Informatique du Parallélisme
Lyon, France
4 h-index
9 publications
369 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
4 h-index
9 publications
1.5K citations
University of Twente
Enschede, The Netherlands
3 h-index
7 publications
226 citations
1–8 of 134
Venues
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 16 publications · 2.6K citations
14
h-index
- Journal of Parallel and Distributed Computing
4 publications · 156 citations
4
h-index
- The Journal of Supercomputing
2 publications · 30 citations
2
h-index
- arXiv (Cornell University)
Repository · 2 publications · 30 citations
2
h-index
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
2 publications · 71 citations
2
h-index
1–5