Scheduling Algorithms
Scheduling Algorithms is a computational method within real-time operating systems that determines the order and timing of task execution on a processor to meet timing constraints and optimize system performance metrics in embedded environments.
2.5K
Publications
139.5K
Citations
5.1K
Authors
1.3K
Institutions
Publications per year
2017–2026
361
2.5K
Benchmarks for basic scheduling problems
Éric D. Taillard · European Journal of Operational Research · 1993 · 2.4K citations
Providing quality of service over a shared wireless link
Matthew Andrews, Krishnan Kumaran, Kavita Ramanan et al. · IEEE Communications Magazine · 2001 · 1.2K citations
1–5 of 2.5K
5.1K
University of North Carolina at Chapel Hill, United States
38 publications · 3.1K citations
28
h-index
20
h-index
19
h-index
19
h-index
19
h-index
1–5 of 5.1K
1.3K
University of North Carolina at Chapel Hill
Chapel Hill, United States
36 h-index
118 publications
9.6K citations

Scuola Superiore Sant'Anna
Pisa, Italy
34 h-index
149 publications
10.2K citations
University of California, Berkeley
Berkeley, United States
34 h-index
95 publications
7.2K citations
University of Illinois Urbana-Champaign
Urbana, United States
34 h-index
132 publications
21.1K citations
Carnegie Mellon University
Pittsburgh, United States
31 h-index
110 publications
12.1K citations
Princeton University
Princeton, United States
25 h-index
67 publications
4K citations
North Carolina State University
Raleigh, United States
25 h-index
56 publications
3.3K citations

University of York
York, United Kingdom
22 h-index
56 publications
2.2K citations
1–8 of 1.3K
TPDS · 64 publications · 7.5K citations
39
h-index
69 publications · 5.1K citations
35
h-index
TECS · 30 publications · 1.1K citations
19
h-index
22 publications · 2.1K citations
19
h-index
23 publications · 966 citations
19
h-index
1–5