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
Parents
34
1–5 of 34
80
3
h-index
3
h-index
University of North Carolina at Chapel Hill, United States
3 publications · 126 citations
3
h-index
3
h-index
3
h-index
1–5 of 80
43

Scuola Superiore Sant'Anna
Pisa, Italy
3 h-index
11 publications
171 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
3 h-index
9 publications
378 citations
Florida International University
Miami, United States
3 h-index
6 publications
126 citations
Indian Institute of Technology Guwahati
Guwahati, India
2 h-index
4 publications
46 citations
Université Libre de Bruxelles
Brussels, Belgium
2 h-index
3 publications
63 citations

Keio University
Tokyo, Japan
2 h-index
3 publications
295 citations
École Centrale d'Électronique
Paris, France
2 h-index
3 publications
53 citations
Indian Institute of Information Technology Guwahati
Guwahati, India
2 h-index
3 publications
72 citations
1–8 of 43
JSA · 2 publications · 50 citations
2
h-index
Conference · 2 publications · 48 citations
2
h-index
Repository · 1 publications · 29 citations
1
h-index
ITETBT · 1 publications · 19 citations
1
h-index
1 publications · 12 citations
1
h-index
1–5