临界区的容错k个表项

[1993] Proceedings. The 13th International Conference on Distributed Computing Systems Pub Date : 1993-05-25 DOI:10.1109/ICDCS.1993.287721

Shing-Tsaan Huang, Jehn-Ruey Jiang, Yu-Chen Kuo

{"title":"临界区的容错k个表项","authors":"Shing-Tsaan Huang, Jehn-Ruey Jiang, Yu-Chen Kuo","doi":"10.1109/ICDCS.1993.287721","DOIUrl":null,"url":null,"abstract":"The authors extend the concept of coterie into k-coterie for k entries to a critical section. A structure named Cohorts is proposed to construct quorums in a k-coterie. The solution is resilient to node failures and/or network partitioning and has a low communication cost. The Cohorts structure is further improved to increase the availabilities of 1-entry critical sections.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":"{\"title\":\"k-coteries for fault-tolerant k entries to a critical section\",\"authors\":\"Shing-Tsaan Huang, Jehn-Ruey Jiang, Yu-Chen Kuo\",\"doi\":\"10.1109/ICDCS.1993.287721\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors extend the concept of coterie into k-coterie for k entries to a critical section. A structure named Cohorts is proposed to construct quorums in a k-coterie. The solution is resilient to node failures and/or network partitioning and has a low communication cost. The Cohorts structure is further improved to increase the availabilities of 1-entry critical sections.<<ETX>>\",\"PeriodicalId\":249060,\"journal\":{\"name\":\"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"41\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.1993.287721\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.1993.287721","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 41

摘要

作者将小圈子的概念推广到k个临界区域的k个元素的小圈子。提出了一种名为Cohorts的结构来构建k-coterie中的群体。该解决方案对节点故障和/或网络分区具有弹性，并且具有较低的通信成本。队列结构进一步改进，以增加1入口临界区域的可用性

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

k-coteries for fault-tolerant k entries to a critical section

The authors extend the concept of coterie into k-coterie for k entries to a critical section. A structure named Cohorts is proposed to construct quorums in a k-coterie. The solution is resilient to node failures and/or network partitioning and has a low communication cost. The Cohorts structure is further improved to increase the availabilities of 1-entry critical sections.<>

求助全文

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

来源期刊

[1993] Proceedings. The 13th International Conference on Distributed Computing Systems

自引率

0.00%

发文量