{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T06:10:57Z","timestamp":1697955057780},"reference-count":5,"publisher":"Wiley","issue":"11","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":7749,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1986,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The detection of deadlock is one of the important problems in the database system. This paper proposes an efficient algorithm for detecting the deadlock in the concentrated database system, and demonstrates its correctness. The algorithm works as follows. When a process makes an access to a resource which is locked by another process, the process must wait for the resource. The algorithm detects the deadlock by tracing the edges of the resource graph, starting from the waiting process. By attaching the level number to each node, the number of edge tracings can be reduced, which helps to reduce the overhead for deadlock detection. To evaluate the efficiency of the proposed algorithm, an experiment was performed by computer simulation. The cases of the algorithm with and without the proposed level number are compared, indicating the effectiveness of the proposed method.<\/jats:p>","DOI":"10.1002\/scj.4690171105","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T10:51:43Z","timestamp":1183805503000},"page":"42-50","source":"Crossref","is-referenced-by-count":2,"title":["Deadlock detection algorithm with level number"],"prefix":"10.1002","volume":"17","author":[{"given":"Yoshikazu","family":"Eguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsunehiro","family":"Yoshinaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/356603.356607"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(75)90009-5"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1980.1653786"},{"key":"e_1_2_1_5_2","first-page":"64","article-title":"Deadlock detection algorithm","volume":"84","author":"Eguchi Y.","year":"1985","journal-title":"Tech. Rep. I.E.C.E., Japan"},{"key":"e_1_2_1_6_2","volume-title":"Computer Simulation","author":"Neyler T. H.","year":"1971"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690171105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690171105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T13:36:53Z","timestamp":1697895413000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690171105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":5,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["10.1002\/scj.4690171105"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690171105","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}