Global Code Motion is an optimization technique in compiler back ends that belongs to the class of code scheduling methods, distinguished by its ability to relocate instructions across basic block boundaries to improve performance while preserving program semantics.
14
Publications
626
Citations
25
Authors
12
Institutions
Publications per year
2017–2026
0
Parents
Publications
14
Global code motion/global value numbering
Cliff Click · 1995 · 107 citations
Nancy J. Warter, Scott Mahlke, Wen‐mei Hwu et al. · 1993 · 88 citations
Optimal versus Heuristic Global Code Scheduling
Sebastian Winkel · 2007 · 63 citations
1–5 of 14
Authors
25
- SM
3
h-index
- SW
3
h-index
- CC
2
h-index
- BR
2
h-index
- WH
2
h-index
1–5 of 25
Institutions
12
Hewlett-Packard (United States)
Palo Alto, United States
2 h-index
2 publications
136 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
8 publications
489 citations
Intel (United States)
Santa Clara, United States
2 h-index
2 publications
78 citations
University of California, Irvine
Irvine, United States
1 h-index
4 publications
268 citations
University of Wisconsin System
Madison, United States
1 h-index
3 publications
114 citations
Saarland University
Saarbrücken, Germany
1 h-index
1 publications
17 citations
Indian Institute of Technology Bombay
Mumbai, India
1 h-index
2 publications
90 citations
Cytel (United States)
Cambridge, United States
1 h-index
2 publications
28 citations
1–8 of 12
Venues
- ACM SIGPLAN Notices
3 publications · 53 citations
3
h-index
- IEEE Transactions on Computers
1 publications · 45 citations
1
h-index
- IEEE Transactions on Very Large Scale Integration (VLSI) Systems
1 publications · 38 citations
1
h-index
- ACM Transactions on Programming Languages and Systems
1 publications · 76 citations
1
h-index
- International Journal of Computer Mathematics
1 publications · 45 citations
1
h-index
1–5