Deadline Monotonic is a priority assignment protocol in real-time scheduling where tasks are assigned priorities inversely proportional to their deadlines, such that shorter deadlines receive higher priority.
40
Publications
2.6K
Citations
76
Authors
47
Institutions
Publications per year
2017–2026
5
Variants
Deadline Monotonic SchedulingDm Scheduling
Publications
40
Hard Real-Time Scheduling: The Deadline-Monotonic Approach
Neil Audsley, Alan Burns, Mike Richardson et al. · IFAC Proceedings Volumes · 1991 · 485 citations
Multiprocessor EDF and deadline monotonic schedulability analysis
T. P. Baker · 2004 · 269 citations
Analysis of hierar hical fixed-priority scheduling
S. Saewong, Ragunathan Rajkumar, John P. Lehoczky et al. · 2005 · 160 citations
1–5 of 40
Authors
76
- AB
6
h-index
- NA
4
h-index
- AW
4
h-index
- JC
4
h-index
- SC
3
h-index
1–5 of 76
Institutions
47
University of York
York, United Kingdom
5 h-index
15 publications
2.8K citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
6 publications
639 citations
Polytechnic Institute of Porto
Porto, Portugal
3 h-index
5 publications
55 citations
TU Dortmund University
Dortmund, Germany
3 h-index
5 publications
93 citations
University of Virginia
Charlottesville, United States
2 h-index
4 publications
400 citations
Purdue University West Lafayette
West Lafayette, United States
1 h-index
1 publications
19 citations
Universidade do Porto
Porto, Portugal
1 h-index
1 publications
11 citations
Shiraz University
Shiraz, Iran
1 h-index
2 publications
34 citations
1–8 of 47
Venues
- IEEE Transactions on Computers
2 publications · 130 citations
2
h-index
- The Journal of Supercomputing
2 publications · 40 citations
2
h-index
- IFAC Proceedings Volumes
2 publications · 511 citations
2
h-index
- International Journal of Computer Applications
1 publications · 16 citations
1
h-index
- ACM SIGAda Ada Letters
1 publications · 10 citations
1
h-index
1–5