Dynamic-priority Scheduling
Dynamic-Priority Scheduling is a CPU scheduling method in soft real-time systems that belongs to the class of priority-based scheduling algorithms, distinguished by its runtime adjustment of task priorities according to dynamic factors such as deadlines, remaining execution time, or system conditions.
190
Publications
10.2K
Citations
565
Authors
247
Institutions
Publications per year
2017–2026
51
Variants
Dynamic Priority Scheduling
190
Scheduling aperiodic tasks in dynamic priority systems
Marco Spuri, Giorgio Buttazzo · Real-Time Systems · 1996 · 359 citations
1–5 of 190
565
5
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 565
247

Scuola Superiore Sant'Anna
Pisa, Italy
7 h-index
14 publications
1.8K citations
Seoul National University
Seoul, South Korea
6 h-index
18 publications
1.5K citations
Tsinghua University
Beijing, China
4 h-index
17 publications
1.1K citations
The Ohio State University
Columbus, United States
4 h-index
7 publications
822 citations

City University of Hong Kong
Hong Kong, Hong Kong
4 h-index
7 publications
289 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
8 publications
751 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
4 h-index
11 publications
955 citations
Universitat Politècnica de València
Valencia, Spain
4 h-index
14 publications
434 citations
1–8 of 247
6 publications · 768 citations
6
h-index
4 publications · 653 citations
4
h-index
4 publications · 194 citations
4
h-index
3 publications · 139 citations
3
h-index
3 publications · 726 citations
3
h-index
1–5