Preemptive Scheduling Analysis
Preemptive Scheduling Analysis is a formal method in real-time systems analysis that determines the feasibility and timing correctness of task sets under preemptive scheduling, where higher-priority tasks may interrupt lower-priority ones at any point during execution.
65
Publications
5.2K
Citations
142
Authors
94
Institutions
Publications per year
2017–2026
4
Parents
65
Applying new scheduling theory to static priority pre-emptive scheduling
Neil Audsley, A. Burns, Mike Richardson et al. · Software Engineering Journal · 1993 · 1.1K citations
1–5 of 65
142
6
h-index
5
h-index
5
h-index
3
h-index
3
h-index
1–5 of 142
94

University of York
York, United Kingdom
7 h-index
17 publications
7.7K citations
Technische Universität Braunschweig
Braunschweig, Germany
6 h-index
16 publications
673 citations
University of Haifa
Haifa, Israel
4 h-index
4 publications
75 citations
Universitat Politècnica de València
Valencia, Spain
3 h-index
10 publications
232 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
5 publications
99 citations
Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti
Rome, Italy
2 h-index
4 publications
78 citations
Université Libre de Bruxelles
Brussels, Belgium
2 h-index
3 publications
117 citations
Technical University of Munich
Munich, Germany
2 h-index
6 publications
120 citations
1–8 of 94
7 publications · 1.4K citations
7
h-index
6 publications · 157 citations
6
h-index
3 publications · 75 citations
3
h-index
3 publications · 43 citations
3
h-index
2 publications · 423 citations
2
h-index
1–5