Processor sharing (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Processor sharing" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

2semanticscholar.org

11^th place

8^th place

207^th place

136^th place

488^th place

374^th place

782^nd place

585^th place

9,054^th place

6,363^rd place

low place

low place

columbia.edu

dna-pubs.cs.columbia.edu

Aalto, S.; Ayesta, U.; Borst, S.; Misra, V.; Núñez-Queija, R. (2007). "Beyond processor sharing" (PDF). ACM SIGMETRICS Performance Evaluation Review. 34 (4): 36. doi:10.1145/1243401.1243409. S2CID 7692913.

doi.org

Aalto, S.; Ayesta, U.; Borst, S.; Misra, V.; Núñez-Queija, R. (2007). "Beyond processor sharing" (PDF). ACM SIGMETRICS Performance Evaluation Review. 34 (4): 36. doi:10.1145/1243401.1243409. S2CID 7692913.
Kleinrock, L. (1967). "Time-shared Systems: A theoretical treatment" (PDF). Journal of the ACM. 14 (2): 242–261. CiteSeerX 10.1.1.74.3945. doi:10.1145/321386.321388.
Borst, S.; Núñez-Queija, R.; Zwart, B. (2006). "Sojourn time asymptotics in processor-sharing queues" (PDF). Queueing Systems. 53 (1–2): 31–51. doi:10.1007/s11134-006-7585-9. S2CID 7704706.
Li, T.; Baumberger, D.; Hahn, S. (2009). "Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin" (PDF). ACM SIGPLAN Notices. 44 (4): 65. CiteSeerX 10.1.1.567.2170. doi:10.1145/1594835.1504188.

happyli.org

Li, T.; Baumberger, D.; Hahn, S. (2009). "Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin" (PDF). ACM SIGPLAN Notices. 44 (4): 65. CiteSeerX 10.1.1.567.2170. doi:10.1145/1594835.1504188.

psu.edu

citeseerx.ist.psu.edu

Kleinrock, L. (1967). "Time-shared Systems: A theoretical treatment" (PDF). Journal of the ACM. 14 (2): 242–261. CiteSeerX 10.1.1.74.3945. doi:10.1145/321386.321388.
Li, T.; Baumberger, D.; Hahn, S. (2009). "Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin" (PDF). ACM SIGPLAN Notices. 44 (4): 65. CiteSeerX 10.1.1.567.2170. doi:10.1145/1594835.1504188.

semanticscholar.org

api.semanticscholar.org

Aalto, S.; Ayesta, U.; Borst, S.; Misra, V.; Núñez-Queija, R. (2007). "Beyond processor sharing" (PDF). ACM SIGMETRICS Performance Evaluation Review. 34 (4): 36. doi:10.1145/1243401.1243409. S2CID 7692913.
Borst, S.; Núñez-Queija, R.; Zwart, B. (2006). "Sojourn time asymptotics in processor-sharing queues" (PDF). Queueing Systems. 53 (1–2): 31–51. doi:10.1007/s11134-006-7585-9. S2CID 7704706.

tue.nl

alexandria.tue.nl

Borst, S.; Núñez-Queija, R.; Zwart, B. (2006). "Sojourn time asymptotics in processor-sharing queues" (PDF). Queueing Systems. 53 (1–2): 31–51. doi:10.1007/s11134-006-7585-9. S2CID 7704706.

ucla.edu

lk.cs.ucla.edu

Kleinrock, L. (1967). "Time-shared Systems: A theoretical treatment" (PDF). Journal of the ACM. 14 (2): 242–261. CiteSeerX 10.1.1.74.3945. doi:10.1145/321386.321388.