Scheduling Algorithms

Scheduling Algorithms is a computational method within real-time operating systems that determines the order and timing of task execution on a processor to meet timing constraints and optimize system performance metrics in embedded environments.

2.5K

Publications

139.5K

Citations

5.1K

Authors

1.3K

Institutions

Publications per year

2017–2026

361

Authors

5.1K

  1. JH
    James H. Anderson

    University of North Carolina at Chapel Hill, United States

    38 publications · 3.1K citations

    28

    h-index

  2. ZP
    Zebo Peng

    Linköping University, Sweden

    32 publications · 1.2K citations

    20

    h-index

  3. JA
    John A. Stankovic

    University of Virginia, United States

    23 publications · 2.4K citations

    19

    h-index

  4. JC
    Jian-Jia Chen

    TU Dortmund University, Germany

    25 publications · 1.2K citations

    19

    h-index

  5. LT
    Lothar Thiele

    ETH Zurich, Switzerland

    22 publications · 1.1K citations

    19

    h-index

1–5 of 5.1K

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 64 publications · 7.5K citations

    39

    h-index

  2. IEEE Transactions on Computers

    69 publications · 5.1K citations

    35

    h-index

  3. ACM Transactions on Embedded Computing Systems

    TECS · 30 publications · 1.1K citations

    19

    h-index

  4. Real-Time Systems

    22 publications · 2.1K citations

    19

    h-index

  5. IEEE Transactions on Vehicular Technology

    23 publications · 966 citations

    19

    h-index

1–5