分布式系统中防止死锁的算法

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings] Pub Date : 1992-04-01 DOI:10.1109/PCCC.1992.200545

A. Datta, R. D. Javagal, S. Ghosh

{"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}

引用次数: 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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]

自引率

0.00%

发文量