Non-preemptive Scheduling
Non-Preemptive Scheduling is a CPU scheduling discipline in which a running process retains the processor until it terminates or voluntarily yields (e.g., by entering a waiting state), and is never forcibly preempted by the operating system in favor of another ready process.
361
Publications
15.9K
Citations
695
Authors
319
Institutions
Publications per year
2017–2026
60
361
1–5 of 361
695
University of North Carolina at Chapel Hill, United States
17 publications · 896 citations
16
h-index
University of North Carolina at Chapel Hill, United States
10 publications · 506 citations
10
h-index
Max Planck Institute for Software Systems, Germany
11 publications · 471 citations
10
h-index
10
h-index
10
h-index
1–5 of 695
319
University of North Carolina at Chapel Hill
Chapel Hill, United States
18 h-index
26 publications
1.7K citations

University of York
York, United Kingdom
11 h-index
11 publications
281 citations

Scuola Superiore Sant'Anna
Pisa, Italy
10 h-index
10 publications
578 citations
Max Planck Institute for Software Systems
Saarbrücken, Germany
10 h-index
11 publications
272 citations
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
8 publications
490 citations

Polytechnic Institute of Porto
Porto, Portugal
8 h-index
8 publications
175 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
7 publications
353 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
7 h-index
7 publications
346 citations
1–8 of 319
9 publications · 868 citations
9
h-index
9 publications · 496 citations
9
h-index
7 publications · 331 citations
7
h-index
PER · 7 publications · 278 citations
7
h-index
5 publications · 296 citations
5
h-index
1–5