{"title":"分布式系统中防止死锁的算法","authors":"A. Datta, R. D. Javagal, S. Ghosh","doi":"10.1109/PCCC.1992.200545","DOIUrl":null,"url":null,"abstract":"The authors deal with a new method for preventing deadlocks in resource sharing for distributed systems. The algorithm is based on the notion of coloring the nodes of the waitfor graph and is built on a signaling mechanism which can be implemented on an underlying routing protocol. This algorithm supports multiple resources and multiple outstanding requests. The proof of correctness of the algorithm is also presented.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An algorithm for preventing deadlocks in distributed systems\",\"authors\":\"A. Datta, R. D. Javagal, S. Ghosh\",\"doi\":\"10.1109/PCCC.1992.200545\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors deal with a new method for preventing deadlocks in resource sharing for distributed systems. The algorithm is based on the notion of coloring the nodes of the waitfor graph and is built on a signaling mechanism which can be implemented on an underlying routing protocol. This algorithm supports multiple resources and multiple outstanding requests. The proof of correctness of the algorithm is also presented.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200545\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200545","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An algorithm for preventing deadlocks in distributed systems
The authors deal with a new method for preventing deadlocks in resource sharing for distributed systems. The algorithm is based on the notion of coloring the nodes of the waitfor graph and is built on a signaling mechanism which can be implemented on an underlying routing protocol. This algorithm supports multiple resources and multiple outstanding requests. The proof of correctness of the algorithm is also presented.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
