Priority Scheduling
Priority Scheduling is a preemptive or non-preemptive CPU scheduling algorithm in which the selection of the next process to execute is determined by a priority value assigned to each process, distinguishing it from other scheduling algorithms by its reliance on externally or internally defined priority levels rather than execution characteristics such as burst time or arrival order.
596
Publications
32.2K
Citations
1.4K
Authors
537
Institutions
Publications per year
2017–2026
123
596
S. S. Panwalkar, Wafik H. Iskander · Operations Research · 1977 · 1.3K citations
Mohammad Alizadeh, Shuang Yang, Milad Sharif et al. · 2013 · 681 citations
Scheduling real-time transactions
Robert Abbott, Héctor García-Molina · ACM Transactions on Database Systems · 1992 · 574 citations · Full text
1–5 of 596
1.4K
18
h-index
University of North Carolina at Chapel Hill, United States
18 publications · 1.5K citations
16
h-index
16
h-index
12
h-index
9
h-index
1–5 of 1.4K
537

Scuola Superiore Sant'Anna
Pisa, Italy
23 h-index
46 publications
2.7K citations

University of York
York, United Kingdom
23 h-index
71 publications
6.5K citations
Carnegie Mellon University
Pittsburgh, United States
20 h-index
52 publications
4K citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
14 h-index
25 publications
2.3K citations
University of Illinois Urbana-Champaign
Urbana, United States
14 h-index
38 publications
1.7K citations
University of California, Berkeley
Berkeley, United States
11 h-index
27 publications
3.1K citations
Mälardalen University
Västerås, Sweden
9 h-index
21 publications
553 citations

City University of Hong Kong
Hong Kong, Hong Kong
8 h-index
14 publications
357 citations
1–8 of 537
17 publications · 1.3K citations
16
h-index
13 publications · 1.2K citations
13
h-index
9 publications · 558 citations
9
h-index
10 publications · 451 citations
9
h-index
TPDS · 8 publications · 171 citations
8
h-index
1–5