Dynamic-priority Scheduling Analysis

Dynamic-Priority Scheduling Analysis is a formal method in real-time systems analysis that belongs to the class of scheduling analysis techniques and specifically determines the feasibility and timing correctness of task sets under dynamic priority assignment, where task priorities are adjusted at runtime based on scheduling policies such as earliest deadline first.

10

Publications

281

Citations

30

Authors

18

Institutions

Publications per year

2017–2026

2

Authors

30

  1. SC
    Samarjit Chakraborty

    Technical University of Munich, Germany

    2 publications · 68 citations

    2

    h-index

  2. LJ
    Lei Ju

    Shandong University, China

    2 publications · 68 citations

    2

    h-index

  3. CZ
    Changan Zhu

    University of Science and Technology of China, China

    2 publications · 88 citations

    2

    h-index

  4. DS
    Dong Sun

    City University of Hong Kong, Hong Kong SAR China

    2 publications · 88 citations

    2

    h-index

  5. AR
    Abhik Roychoudhury

    National University of Singapore, Singapore

    2 publications · 68 citations

    2

    h-index

1–5 of 30

Venues

  1. 1

    h-index

  2. Proceedings of the 59th ACM/IEEE Design Automation Conference

    Conference · 1 publications · 35 citations

    1

    h-index

  3. 1

    h-index

  4. IEEE Transactions on Computers

    1 publications · 29 citations

    1

    h-index

  5. Journal of Network and Computer Applications

    JNCA · 1 publications · 14 citations

    1

    h-index

1–5