Semi-partitioned Scheduling

Semi-Partitioned Scheduling is a real-time scheduling strategy in mixed-criticality systems where the majority of tasks are strictly allocated to dedicated processors, while a subset of tasks is allowed to migrate across processors according to a predefined schedule, thereby combining the predictability of partitioned scheduling with the resource efficiency of global scheduling.

34

Publications

1K

Citations

80

Authors

43

Institutions

Publications per year

2017–2026

13

Authors

80

  1. MF
    Ming Fan

    Xi'an Jiaotong University, China

    3 publications · 63 citations

    3

    h-index

  2. GQ
    Gang Quan

    Florida International University, United States

    3 publications · 63 citations

    3

    h-index

  3. JH
    James H. Anderson

    University of North Carolina at Chapel Hill, United States

    3 publications · 126 citations

    3

    h-index

  4. AB
    Alessandro Biondi

    Scuola Superiore Sant'Anna, Italy

    3 publications · 49 citations

    3

    h-index

  5. SK
    Shinpei Kato

    The University of Tokyo, Japan

    3 publications · 216 citations

    3

    h-index

1–5 of 80

Venues

  1. Journal of Systems Architecture

    JSA · 2 publications · 50 citations

    2

    h-index

  2. Design, Automation, and Test in Europe

    Conference · 2 publications · 48 citations

    2

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 29 citations

    1

    h-index

  4. IEEE Transactions on Emerging Topics in Computing

    ITETBT · 1 publications · 19 citations

    1

    h-index

  5. Information and Software Technology

    1 publications · 12 citations

    1

    h-index

1–5