Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16051
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dua, Amit | - |
dc.date.accessioned | 2024-10-08T10:51:04Z | - |
dc.date.available | 2024-10-08T10:51:04Z | - |
dc.date.issued | 2022-03 | - |
dc.identifier.uri | https://link.springer.com/chapter/10.1007/978-981-16-9012-9_51 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16051 | - |
dc.description.abstract | A deadlock is a situation in which two processes which share the identical resource are dependent on one another and prevents each other from accessing resources, which results in both programs ceasing to function. The formation of deadlock reduces the system efficiency. Thus, to avoid performance degradation due to deadlock, it is necessary that a system should be exempted from deadlock or that deadlocks be quickly diagnosed and abolished. We propose a survey on different deadlock identification and resolution techniques. Various algorithms for identifying deadlocks and handling strategies have been proposed till now. In this paper, we represent a comparative study among different strategies used to diagnose and resolve deadlocks in various environments using different parameters. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Algorithm | en_US |
dc.title | A Survey of Deadlock Detection Algorithms | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Computer Science and Information Systems |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.