Deadlock (Indonesian Wikipedia)

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

Last modified:

Ref.Un. Ref.Website
Global rank Indonesian rank
1st place
1st place
3rd place
4th place
2nd place
2nd place
6th place
3rd place
2,336th place
1,791st place
6,212th place
4,809th place
low place
low place
1,369th place
1,648th place
low place
low place
299th place
372nd place
4th place
5th place

archive.org (Global: 6th place; Indonesian: 3rd place)

books.google.com (Global: 3rd place; Indonesian: 4th place)

doi.org (Global: 2nd place; Indonesian: 2nd place)

  • Falsafi, Babak; Midkiff, Samuel; Dennis, JackB; Dennis, JackB; Ghoting, Amol; Campbell, Roy H; Klausecker, Christof; Kranzlmüller, Dieter; Emer, Joel (2011). "Deadlocks". Encyclopedia of Parallel Computing. Boston, MA: Springer US. hlm. 524–527. doi:10.1007/978-0-387-09766-4_282. ISBN 978-0-387-09765-7. 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.
  • Ashcroft, E.A. (1975). "Proving assertions about parallel programs". Journal of Computer and System Sciences. 10: 110–135. doi:10.1016/S0022-0000(75)80018-3.
  • Kwong, Y. S. (1979). "On the absence of livelocks in parallel programs". Semantics of Concurrent Computation. Lecture Notes in Computer Science. Vol. 70. hlm. 172–190. doi:10.1007/BFb0022469. ISBN 3-540-09511-X.
  • Zöbel, Dieter (Oktober 1983). "The Deadlock problem: a classifying bibliography". ACM SIGOPS Operating Systems Review. 17 (4): 6–15. doi:10.1145/850752.850753. ISSN 0163-5980.{{cite journal}}: Pemeliharaan CS1: Tanggal diterjemahkan otomatis (link)

electronicsmind.com (Global: low place; Indonesian: low place)

ibm.com (Global: 1,369th place; Indonesian: 1,648th place)

psu.edu (Global: 299th place; Indonesian: 372nd place)

citeseer.ist.psu.edu

rtic.rs (Global: low place; Indonesian: low place)

ucdavis.edu (Global: 2,336th place; Indonesian: 1,791st place)

nob.cs.ucdavis.edu

uic.edu (Global: 6,212th place; Indonesian: 4,809th place)

cs.uic.edu

  • "Operating Systems: Deadlocks". www.cs.uic.edu. Diarsipkan dari versi aslinya tanggal 28 Mei 2020. Diakses tanggal 2020-04-25. 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:{{cite web}}: Pemeliharaan CS1: Tanggal diterjemahkan otomatis (link)

web.archive.org (Global: 1st place; Indonesian: 1st place)

worldcat.org (Global: 4th place; Indonesian: 5th place)

search.worldcat.org