Instruction Scheduling Algorithms

Instruction Scheduling Algorithms is a computational method within processor architecture that determines the optimal execution order of instructions to maximize parallelism and resource utilization while preserving program semantics, differing from other instruction-level optimization techniques by explicitly reordering operations to resolve data and control dependencies in out-of-order execution pipelines.

266

Publications

11K

Citations

542

Authors

181

Institutions

Publications per year

2017–2026

7

Authors

542

  1. SJ
    Susan J. Eggers

    University of Washington, United States

    9 publications · 352 citations

    9

    h-index

  2. JE
    James E. Smith

    University of Wisconsin–Madison, United States

    6 publications · 336 citations

    6

    h-index

  3. ES
    Edward S. Davidson

    University of Michigan, United States

    6 publications · 417 citations

    6

    h-index

  4. AG
    Antonio González

    Universitat Politècnica de Catalunya, Spain

    6 publications · 253 citations

    6

    h-index

  5. MS
    Michael Schlansker

    Hewlett-Packard (United States), United States

    5 publications · 278 citations

    5

    h-index

1–5 of 542

Venues

  1. ACM SIGPLAN Notices

    13 publications · 477 citations

    11

    h-index

  2. ACM SIGARCH Computer Architecture News

    7 publications · 483 citations

    7

    h-index

  3. 6

    h-index

  4. IEEE Transactions on Computers

    5 publications · 351 citations

    5

    h-index

  5. ACM Transactions on Design Automation of Electronic Systems

    TODAES · 4 publications · 140 citations

    4

    h-index

1–5