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

Authors

374

  1. MC
    Marcelo Cintra

    University of Edinburgh, United Kingdom

    8 publications · 474 citations

    8

    h-index

  2. DR
    Diego R. Llanos

    Universidad de Valladolid, Spain

    7 publications · 225 citations

    7

    h-index

  3. DM
    Dean M. Tullsen

    University of California San Diego, United States

    6 publications · 857 citations

    6

    h-index

  4. WH
    Wen‐mei Hwu

    University of Illinois Urbana-Champaign, United States

    6 publications · 344 citations

    6

    h-index

  5. AG
    Antonio González

    Universitat Politècnica de Catalunya, Spain

    6 publications · 493 citations

    6

    h-index

1–5 of 374

Venues

  1. IEEE Transactions on Computers

    6 publications · 184 citations

    6

    h-index

  2. ACM Transactions on Architecture and Code Optimization

    TACO · 4 publications · 91 citations

    4

    h-index

  3. ACM SIGARCH Computer Architecture News

    4 publications · 160 citations

    4

    h-index

  4. ACM SIGPLAN Notices

    4 publications · 217 citations

    4

    h-index

  5. International Journal of Parallel Programming

    4 publications · 76 citations

    4

    h-index

1–5