Processor Sharing with Priorities is a scheduling discipline within queueing theory where a shared processor allocates service capacity simultaneously to multiple jobs, differentially prioritizing their access to processing time according to assigned priority levels.
9
Publications
727
Citations
19
Authors
12
Institutions
Publications per year
2017–2026
1
Variants
Priority Processor Sharing
Parents
Publications
9
Leonard Kleinrock · Journal of the ACM · 1967 · 368 citations · Full text
Modeling and Analysis of Real-Time Ada Tasking Programs*
James C. Corbett · 1994 · 29 citations
1–5 of 9
Authors
19
- JV
1
h-index
- MH
1
h-index
- RJ
1
h-index
- AB
1
h-index
- JJ
1
h-index
1–5 of 19
Institutions
12
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
5 publications
84 citations
University of California, Los Angeles
Los Angeles, United States
1 h-index
1 publications
368 citations
Belarusian State University
Minsk, Belarus
1 h-index
2 publications
28 citations
The University of Sydney
Sydney, Australia
1 h-index
1 publications
36 citations
The University of Texas at Arlington
Arlington, United States
1 h-index
1 publications
204 citations
Vrije Universiteit Amsterdam
Amsterdam, The Netherlands
1 h-index
1 publications
17 citations
University of Amsterdam
Amsterdam, The Netherlands
1 h-index
1 publications
17 citations
University of Toronto
Toronto, Canada
1 h-index
2 publications
408 citations
1–8 of 12
Venues
- IEEE/ACM Transactions on Networking
TON · 1 publications · 204 citations
1
h-index
- Probability in the Engineering and Informational Sciences
1 publications · 36 citations
1
h-index
- Journal of Ambient Intelligence and Humanized Computing
1 publications · 14 citations
1
h-index
- IEEE Journal on Selected Areas in Communications
1 publications · 27 citations
1
h-index
- Stochastic Models
1 publications · 17 citations
1
h-index
1–5