Speculative Scheduling
Speculative Scheduling is an optimization technique in instruction scheduling that belongs to the class of compiler-based code transformation methods, distinguished by its execution of instructions before it is definitively known whether their results will be required, thereby exploiting available processor resources under the assumption of future computational needs.
173
Publications
7.4K
Citations
374
Authors
125
Institutions
Publications per year
2017–2026
19
Parents
173
Jamison D. Collins, Hong Wang, Dean M. Tullsen et al. · 2001 · 321 citations
Dynamic speculative precomputation
Jamison D. Collins, Dean M. Tullsen, Hong Wang et al. · 2001 · 204 citations
Reducing indirect function call overhead in C++ programs
Brad Calder, Dirk Grunwald · 1994 · 182 citations
1–5 of 173
374
8
h-index
7
h-index
6
h-index
6
h-index
6
h-index
1–5 of 374
125
University of Illinois Urbana-Champaign
Urbana, United States
15 h-index
39 publications
2.7K citations
Intel (United States)
Santa Clara, United States
14 h-index
41 publications
3K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
11 h-index
36 publications
2.2K citations
University of California San Diego
San Diego, United States
7 h-index
12 publications
1.5K citations
University of Michigan
Ann Arbor, United States
7 h-index
17 publications
597 citations
University of Southern California
Los Angeles, United States
7 h-index
9 publications
507 citations
Universidad de Valladolid
Valladolid, Spain
7 h-index
13 publications
301 citations
University of Wisconsin–Madison
Madison, United States
6 h-index
10 publications
630 citations
1–8 of 125
6 publications · 184 citations
6
h-index
TACO · 4 publications · 91 citations
4
h-index
4 publications · 160 citations
4
h-index
4 publications · 217 citations
4
h-index
4 publications · 76 citations
4
h-index
1–5