{"title":"一种构建分布式系统信息互斥的新方法","authors":"Hsiou-Mien Lien, S.-M. Yuan","doi":"10.1109/ICPADS.1994.590396","DOIUrl":null,"url":null,"abstract":"We present a decentralized, symmetric mutual exclusion algorithm in a computer network. The proposed algorithm has the same message complexity as that of the Maekawa's O(/spl radic/(N)) mutual exclusion algorithm ( Maekawa, 1985) and can be applied to arbitrary sizes of distributed systems. It is more suitable than Maekawa's when the symmetry of a system is a criticism. In addition, our algorithm has smaller request set size than that of Gupta, Bruell and Ghosh's (1987) mutual exclusion algorithm on a system of size 2/sup n/ for some integer n.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A new approach of constructing information mutual exclusion in distributed systems\",\"authors\":\"Hsiou-Mien Lien, S.-M. Yuan\",\"doi\":\"10.1109/ICPADS.1994.590396\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a decentralized, symmetric mutual exclusion algorithm in a computer network. The proposed algorithm has the same message complexity as that of the Maekawa's O(/spl radic/(N)) mutual exclusion algorithm ( Maekawa, 1985) and can be applied to arbitrary sizes of distributed systems. It is more suitable than Maekawa's when the symmetry of a system is a criticism. In addition, our algorithm has smaller request set size than that of Gupta, Bruell and Ghosh's (1987) mutual exclusion algorithm on a system of size 2/sup n/ for some integer n.\",\"PeriodicalId\":154429,\"journal\":{\"name\":\"Proceedings of 1994 International Conference on Parallel and Distributed Systems\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 International Conference on Parallel and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS.1994.590396\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.1994.590396","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new approach of constructing information mutual exclusion in distributed systems
We present a decentralized, symmetric mutual exclusion algorithm in a computer network. The proposed algorithm has the same message complexity as that of the Maekawa's O(/spl radic/(N)) mutual exclusion algorithm ( Maekawa, 1985) and can be applied to arbitrary sizes of distributed systems. It is more suitable than Maekawa's when the symmetry of a system is a criticism. In addition, our algorithm has smaller request set size than that of Gupta, Bruell and Ghosh's (1987) mutual exclusion algorithm on a system of size 2/sup n/ for some integer n.