Dynamic Scheduling Algorithms

Dynamic Scheduling Algorithms is a computational method in computer architecture that enables the reordering of instruction execution at runtime to exploit instruction-level parallelism, distinguished from static scheduling by its use of real-time data dependency analysis and hazard detection to optimize processor resource utilization.

667

Publications

31K

Citations

1.8K

Authors

697

Institutions

Publications per year

2017–2026

217

Authors

1.8K

  1. BV
    Bharadwaj Veeravalli

    National University of Singapore, Singapore

    7 publications · 122 citations

    7

    h-index

  2. IB
    Ioana Banicescu

    Mississippi State University, United States

    7 publications · 147 citations

    7

    h-index

  3. FM
    Florina M. Ciorba

    Technische Universität Dresden, Germany

    6 publications · 78 citations

    6

    h-index

  4. JA
    John A. Stankovic

    University of Virginia, United States

    6 publications · 1.1K citations

    6

    h-index

  5. KR
    Krithi Ramamritham

    University of Massachusetts Amherst, United States

    6 publications · 1.1K citations

    6

    h-index

1–5 of 1.8K

Venues

  1. International Journal of Production Research

    20 publications · 1K citations

    17

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 15 publications · 2K citations

    14

    h-index

  3. IEEE Access

    12 publications · 365 citations

    11

    h-index

  4. Computers & Industrial Engineering

    8 publications · 508 citations

    8

    h-index

  5. Operations Research

    8 publications · 1.1K citations

    8

    h-index

1–5