Dag-based Instruction Selection
DAG-Based Instruction Selection is an instruction selection method that uses directed acyclic graphs to represent intermediate program representations and enables optimal code generation by identifying and mapping maximal tree-shaped instruction patterns to target machine operations.
21
Publications
1.2K
Citations
57
Authors
28
Institutions
Publications per year
2017–2026
2
Parents
21
GraphGPT: Graph Instruction Tuning for Large Language Models
Jiabin Tang, Yuhao Yang, Wei Wei et al. · 2024 · 143 citations
Instruction selection using binate covering for code size optimization
Stan Liao, Srinivas Devadas, Kurt Keutzer et al. · 1995 · 80 citations
1–5 of 21
57
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 57
28
Hewlett-Packard (United States)
Palo Alto, United States
3 h-index
6 publications
648 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
4 publications
252 citations
Princeton University
Princeton, United States
2 h-index
4 publications
190 citations
Synopsys (United States)
Mountain View, United States
1 h-index
2 publications
92 citations
Institut de Recherche en Informatique et Systèmes Aléatoires
Rennes, France
1 h-index
2 publications
22 citations
RWTH Aachen University
Aachen, Germany
1 h-index
4 publications
48 citations
Carnegie Mellon University
Pittsburgh, United States
1 h-index
2 publications
46 citations
Politecnico di Milano
Milan, Italy
1 h-index
4 publications
320 citations
1–8 of 28
2 publications · 217 citations
2
h-index
2 publications · 65 citations
2
h-index
Conference · 1 publications · 46 citations
1
h-index
1 publications · 41 citations
1
h-index
Repository · 1 publications · 26 citations
1
h-index
1–5