{"title":"分布式系统中有效的死锁检测和解决算法","authors":"ShouHan Wang, G. Vossen","doi":"10.1109/ICDE.1989.47228","DOIUrl":null,"url":null,"abstract":"A theoretical framework for wait-for systems is provided, and general characteristics of a correct algorithm for deadlock detection and resolution are presented. It is shown that the computational upper bounds (number of messages) for deadlock detection and resolution are both O(n/sup 3/) in the worst case when n transactions are involved. This result is better than previous ones, which often are even exponential. Two correct deadlock detection and resolution algorithms are described which both achieve these upper bounds.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"1402 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Towards efficient algorithms for deadlock detection and resolution in distributed systems\",\"authors\":\"ShouHan Wang, G. Vossen\",\"doi\":\"10.1109/ICDE.1989.47228\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A theoretical framework for wait-for systems is provided, and general characteristics of a correct algorithm for deadlock detection and resolution are presented. It is shown that the computational upper bounds (number of messages) for deadlock detection and resolution are both O(n/sup 3/) in the worst case when n transactions are involved. This result is better than previous ones, which often are even exponential. Two correct deadlock detection and resolution algorithms are described which both achieve these upper bounds.<<ETX>>\",\"PeriodicalId\":329505,\"journal\":{\"name\":\"[1989] Proceedings. Fifth International Conference on Data Engineering\",\"volume\":\"1402 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-02-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings. Fifth International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1989.47228\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings. Fifth International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1989.47228","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Towards efficient algorithms for deadlock detection and resolution in distributed systems
A theoretical framework for wait-for systems is provided, and general characteristics of a correct algorithm for deadlock detection and resolution are presented. It is shown that the computational upper bounds (number of messages) for deadlock detection and resolution are both O(n/sup 3/) in the worst case when n transactions are involved. This result is better than previous ones, which often are even exponential. Two correct deadlock detection and resolution algorithms are described which both achieve these upper bounds.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1989] Proceedings. Fifth International Conference on Data Engineering](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
