Machine-dependent Scheduling

Machine-Dependent Scheduling is an instruction scheduling technique that belongs to the class of compile-time optimization methods and is distinguished by its explicit reliance on the target processor's architectural characteristics, such as pipeline structure, functional unit latencies, and resource constraints, to determine the optimal execution order of instructions.

28

Publications

1.1K

Citations

70

Authors

44

Institutions

Publications per year

2017–2026

4

Authors

70

  1. KP
    Keshav Pingali

    The University of Texas at Austin, United States

    2 publications · 55 citations

    2

    h-index

  2. AL
    Andrew Lenharth

    The University of Texas at Austin, United States

    2 publications · 55 citations

    2

    h-index

  3. DN
    Donald Nguyen

    The University of Texas at Austin, United States

    2 publications · 55 citations

    2

    h-index

  4. MP
    Michael Pinedo

    New York University, United States

    2 publications · 218 citations

    2

    h-index

  5. TC
    T.C.E. Cheng

    Hong Kong Polytechnic University, Hong Kong SAR China

    2 publications · 65 citations

    2

    h-index

1–5 of 70

Venues

  1. European Journal of Operational Research

    4 publications · 163 citations

    4

    h-index

  2. Computers & Operations Research

    4 publications · 89 citations

    4

    h-index

  3. International Journal of Production Research

    3 publications · 139 citations

    3

    h-index

  4. Discrete Applied Mathematics

    1 publications · 18 citations

    1

    h-index

  5. Production and Operations Management

    POMS · 1 publications · 207 citations

    1

    h-index

1–5