Process Contention Scope (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Process Contention Scope" in English language version.

refsWebsite

Global rank English rank

5web.archive.org

1^st place

2apple.com

67^th place

64^th place

2lwn.net

4,423^rd place

2,925^th place

2phoronix.com

4,683^rd place

3,096^th place

2ibm.com

1,131^st place

850^th place

1doi.org

2^nd place

1semanticscholar.org

11^th place

8^th place

1archive.org

6^th place

1huji.ac.il

3,903^rd place

3,632^nd place

1rutgers.edu

1,999^th place

1,355^th place

1yumpu.com

3,980^th place

3,718^th place

1psu.edu

207^th place

136^th place

1handle.net

102^nd place

76^th place

1sriramk.com

low place

1microsoft.com

153^rd place

151^st place

1gabefrost.com

low place

1happyli.org

low place

1opensolaris.org

low place

apple.com

developer.apple.com

"Technical Note TN2028: Threading Architectures". developer.apple.com. Retrieved 2019-01-15.
"Mach Scheduling and Thread Interfaces". developer.apple.com. Retrieved 2019-01-15.

archive.org

Kleinrock, Leonard (1976). Queueing Systems, Vol. 2: Computer Applications (1 ed.). Wiley-Interscience. p. 171. ISBN 047149111X. For a customer requiring x sec of service, his response time will equal his service time x plus his waiting time.

doi.org

C. L., Liu; James W., Layland (January 1973). "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment". Journal of the ACM. 20 (1). ACM: 46–61. doi:10.1145/321738.321743. S2CID 207669821. We define the response time of a request for a certain task to be the time span between the request and the end of the response to that request.

gabefrost.com

blog.gabefrost.com

"Archived copy". blog.gabefrost.com. Archived from the original on 19 February 2008. Retrieved 15 January 2022.{{cite web}}: CS1 maint: archived copy as title (link)

handle.net

hdl.handle.net

Robert Kroeger (2004). "Admission Control for Independently-authored Realtime Applications". UWSpace. http://hdl.handle.net/10012/1170 . Section "2.6 Admission Control". p. 33.

happyli.org

Tong Li; Dan Baumberger; Scott Hahn. "Efficient and Scalable Multiprocessor Fair Scheduling Using Distributed Weighted Round-Robin" (PDF). Happyli.org. Retrieved 2016-12-09.

huji.ac.il

cs.huji.ac.il

Feitelson, Dror G. (2015). Workload Modeling for Computer Systems Performance Evaluation. Cambridge University Press. Section 8.4 (Page 422) in Version 1.03 of the freely available manuscript. ISBN 9781107078239. Retrieved 2015-10-17. if we denote the time that a job waits in the queue by t_w, and the time it actually runs by t_r, then the response time is r = t_w + t_r.

ibm.com

[1] Archived 2011-08-11 at the Wayback Machine

developer.ibm.com

Jones, M. (2018-09-18) [first published on 2009-12-14]. "Inside the Linux 2.6 Completely Fair Scheduler". developer.ibm.com. Retrieved 2024-02-07.

lwn.net

Molnár, Ingo (2007-04-13). "[patch] Modular Scheduler Core and Completely Fair Scheduler [CFS]". linux-kernel (Mailing list).
"An EEVDF CPU scheduler for Linux [LWN.net]". LWN.net. Retrieved 2023-08-31.

microsoft.com

technet.microsoft.com

"Windows Administration: Inside the Windows Vista Kernel: Part 1". Technet.microsoft.com. 2016-11-14. Retrieved 2016-12-09.

opensolaris.org

cn.opensolaris.org

"Comparison of Solaris, Linux, and FreeBSD Kernels" (PDF). Archived from the original (PDF) on August 7, 2008.

phoronix.com

"EEVDF Scheduler May Be Ready For Landing With Linux 6.6". Phoronix. Retrieved 2023-08-31.
"EEVDF Scheduler Merged For Linux 6.6, Intel Hybrid Cluster Scheduling Re-Introduced". www.phoronix.com. Retrieved 2024-02-07.

psu.edu

citeseerx.ist.psu.edu

Robert Kroeger (2004). "Admission Control for Independently-authored Realtime Applications". UWSpace. http://hdl.handle.net/10012/1170 . Section "2.6 Admission Control". p. 33.

rutgers.edu

cs.rutgers.edu

Paul Krzyzanowski (2014-02-19). "Process Scheduling: Who gets to run next?". cs.rutgers.edu. Retrieved 2023-06-19.

semanticscholar.org

api.semanticscholar.org

C. L., Liu; James W., Layland (January 1973). "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment". Journal of the ACM. 20 (1). ACM: 46–61. doi:10.1145/321738.321743. S2CID 207669821. We define the response time of a request for a certain task to be the time span between the request and the end of the response to that request.

sriramk.com

Sriram Krishnan. "A Tale of Two Schedulers Windows NT and Windows CE". Archived from the original on July 22, 2012.

web.archive.org

Early Windows at the Wayback Machine (archive index)
Sriram Krishnan. "A Tale of Two Schedulers Windows NT and Windows CE". Archived from the original on July 22, 2012.
"Archived copy". blog.gabefrost.com. Archived from the original on 19 February 2008. Retrieved 15 January 2022.{{cite web}}: CS1 maint: archived copy as title (link)
[1] Archived 2011-08-11 at the Wayback Machine
"Comparison of Solaris, Linux, and FreeBSD Kernels" (PDF). Archived from the original (PDF) on August 7, 2008.

yumpu.com

Raphael Finkel (1988). "Chapter 2: Time Management". An Operating Systems Vade Mecum. Prentice Hall. p. 27.