Fixed-Priority Response Time Analysis is a formal analytical method within real-time systems theory that determines the worst-case response times of tasks scheduled under fixed-priority preemptive scheduling by iteratively accounting for higher-priority task interferences.
68
Publications
3.6K
Citations
136
Authors
67
Institutions
Publications per year
2017–2026
9
Variants
Fprta
Parents
Publications
68
Hierarchical Fixed Priority Pre-Emptive Scheduling
Robert I. Davis, Alan Burns · 2006 · 251 citations
Scheduling within temporal partitions
Paulo Pedreiras · 2004 · 179 citations
1–5 of 68
Authors
136
- RI
9
h-index
- GB
6
h-index
- AB
6
h-index
- RJ
5
h-index
- EB
5
h-index
1–5 of 136
Institutions
67
University of York
York, United Kingdom
11 h-index
18 publications
2.1K citations
Scuola Superiore Sant'Anna
Pisa, Italy
11 h-index
26 publications
1.1K citations
Eindhoven University of Technology
Eindhoven, The Netherlands
5 h-index
10 publications
586 citations
Uppsala University
Uppsala, Sweden
5 h-index
12 publications
1.2K citations
Polytechnic Institute of Porto
Porto, Portugal
4 h-index
9 publications
334 citations
Technische Universität Braunschweig
Braunschweig, Germany
4 h-index
10 publications
167 citations
Universidad de Cantabria
Santander, Spain
3 h-index
9 publications
256 citations
Saarland University
Saarbrücken, Germany
3 h-index
3 publications
230 citations
1–8 of 67
Venues
- Real-Time Systems
8 publications · 489 citations
8
h-index
- IEEE Transactions on Computers
4 publications · 453 citations
3
h-index
- The Computer Journal
1 publications · 29 citations
1
h-index
- Journal of Systems and Software
JSS · 1 publications · 10 citations
1
h-index
- IEEE Access
1 publications · 14 citations
1
h-index
1–5