Aperiodic Task Servers is a scheduling mechanism in real-time systems that belongs to the class of resource allocation protocols, distinguished by its dedicated provision of processing capacity to handle aperiodic tasks with unpredictable arrival times while ensuring temporal predictability and meeting hard deadlines.
7
Publications
443
Citations
12
Authors
9
Institutions
Publications per year
2017–2026
0
Parents
Publications
7
A hyperbolic bound for the rate monotonic algorithm
Enrico Bini, Giorgio Buttazzo, Giuseppe Buttazzo · 2001 · 110 citations · Full text
Proceedings International Conference on Autonomic Computing
2004 · 50 citations
1–5 of 7
Authors
12
- GB
2
h-index
- EB
2
h-index
- SAScott A. Banachowski
University of California, Santa Cruz, United States
1 publications · 20 citations
1
h-index
- NI
1
h-index
- GB
1
h-index
1–5 of 12
Institutions
9
University of Pisa
Pisa, Italy
2 h-index
4 publications
582 citations
University of Pavia
Pavia, Italy
2 h-index
4 publications
582 citations
Scuola Superiore Sant'Anna
Pisa, Italy
2 h-index
2 publications
291 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
3 publications
33 citations
Software Engineering Institute
Pittsburgh, United States
1 h-index
1 publications
32 citations
Fordham University
New York, United States
1 h-index
1 publications
32 citations
University of California, Santa Cruz
Santa Cruz, United States
1 h-index
3 publications
60 citations
Carnegie Mellon University
Pittsburgh, United States
1 h-index
1 publications
32 citations
1–8 of 9
Venues
- IEEE Transactions on Computers
1 publications · 181 citations
1
h-index
- Real-Time Systems
1 publications · 39 citations
1–2