Dynamic Priority Queues is a dynamic data structure that generalizes the priority queue abstraction by supporting efficient insertion, deletion, and priority updates of elements in response to changing priorities during execution.
108
Publications
4.2K
Citations
304
Authors
154
Institutions
Publications per year
2017–2026
27
Publications
108
Scheduling aperiodic tasks in dynamic priority systems
Marco Spuri, Giorgio Buttazzo · Real-Time Systems · 1996 · 359 citations
Dynamic priority allocation via restless bandit marginal productivity indices
José Niño‐Mora · Top · 2007 · 139 citations · Full text
1–5 of 108
Authors
304
- OT
3
h-index
- AX
3
h-index
- JHJames H. Anderson
University of North Carolina at Chapel Hill, United States
2 publications · 152 citations
2
h-index
- SRSrikanth Ramamurthy
University of North Carolina at Chapel Hill, United States
2 publications · 152 citations
2
h-index
- RF
2
h-index
1–5 of 304
Institutions
154
Carnegie Mellon University
Pittsburgh, United States
4 h-index
6 publications
184 citations
Universidad Carlos III de Madrid
Madrid, Spain
3 h-index
3 publications
199 citations
University of Science and Technology of China
Hefei, China
3 h-index
7 publications
160 citations
City University of Hong Kong
Hong Kong, Hong Kong
3 h-index
6 publications
260 citations
Texas Instruments (United States)
Dallas, United States
2 h-index
2 publications
110 citations
COMSATS University Islamabad
Islamabad, Pakistan
2 h-index
5 publications
64 citations
Politecnico di Milano
Milan, Italy
2 h-index
7 publications
176 citations
Indian Institute of Technology Hyderabad
Sangāreddi, India
2 h-index
7 publications
250 citations
1–8 of 154
Venues
- Operations Research
3 publications · 119 citations
3
h-index
- IEEE Transactions on Vehicular Technology
3 publications · 84 citations
3
h-index
- Real-Time Systems
2 publications · 581 citations
2
h-index
- Information Processing Letters
2 publications · 36 citations
2
h-index
- Top
2 publications · 153 citations
2
h-index
1–5