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
Parents
10
1–5 of 10
30
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 30
18

City University of Hong Kong
Hong Kong, Hong Kong
3 h-index
6 publications
277 citations
National University of Singapore
Singapore, Singapore
2 h-index
6 publications
204 citations
Suzhou University of Science and Technology
Suzhou, China
1 h-index
1 publications
16 citations
University of Connecticut
Storrs, United States
1 h-index
1 publications
29 citations
Google (United States)
Mountain View, United States
1 h-index
1 publications
29 citations
Emerson School District
Emerson, United States
1 h-index
1 publications
29 citations
Dalian University of Technology
Dalian, China
1 h-index
1 publications
35 citations
Universitat de València
Valencia, Spain
1 h-index
3 publications
72 citations
1–8 of 18
1 publications · 72 citations
1
h-index
Conference · 1 publications · 35 citations
1
h-index
1 publications · 12 citations
1
h-index
1 publications · 29 citations
1
h-index
JNCA · 1 publications · 14 citations
1
h-index
1–5