Deadlock (English Wikipedia)

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

refsWebsite
Global rank English rank
1st place
1st place
3rd place
3rd place
2nd place
2nd place
11th place
8th place
1,873rd place
1,347th place
5,752nd place
3,776th place
low place
low place
1,131st place
850th place
low place
low place
207th place
136th place
5th place
5th place

books.google.com

doi.org

electronicsmind.com

ibm.com

psu.edu

citeseer.ist.psu.edu

rtic.rs

semanticscholar.org

api.semanticscholar.org

  • Falsafi, Babak; Midkiff, Samuel; Dennis, JackB; Dennis, JackB; Ghoting, Amol; Campbell, Roy H; Klausecker, Christof; Kranzlmüller, Dieter; Emer, Joel; Fossum, Tryggve; Smith, Burton; Philippe, Bernard; Sameh, Ahmed; Irigoin, François; Feautrier, Paul; Praun, Christoph von; Bocchino, Robert L.; Snir, Marc; George, Thomas; Sarin, Vivek; Jann, Joefon (2011). "Deadlocks". Encyclopedia of Parallel Computing. Boston, MA: Springer US. pp. 524–527. doi:10.1007/978-0-387-09766-4_282. ISBN 978-0-387-09765-7. S2CID 241456017. A deadlock is a condition that may happen in a system composed of multiple processes that can access shared resources. A deadlock is said to occur when two or more processes are waiting for each other to release a resource. None of the processes can make any progress.
  • Zöbel, Dieter (October 1983). "The Deadlock problem: a classifying bibliography". ACM SIGOPS Operating Systems Review. 17 (4): 6–15. doi:10.1145/850752.850753. ISSN 0163-5980. S2CID 38901737.

ucdavis.edu

nob.cs.ucdavis.edu

uic.edu

cs.uic.edu

  • "Operating Systems: Deadlocks". www.cs.uic.edu. Archived from the original on 28 May 2020. Retrieved 25 April 2020. If a resource category contains more than one instance then the presence of a cycle in the resource-allocation graph indicates the possibility of a deadlock, but does not guarantee one. Consider, for example, Figures 7.3 and 7.4 below:

web.archive.org

worldcat.org