{"title":"两个以环为基础的k群的比较","authors":"S. Lang, L. Mao","doi":"10.1109/ICPADS.1998.741086","DOIUrl":null,"url":null,"abstract":"We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entries in a critical section. In the original coterie, the system nodes are logically arranged in a rectangle, called a torus, in which the last row (column) is followed by the first row (column) using end wraparound. A torus quorum consists of a head and a tail, where the head contains one entire row and the tail contains one node from each of the s succeeding rows, s/spl ges/1 is a system parameter. It has been shown that by setting s=[h/2], where h=the number of rows, the collection of torus quorums form an equal-sized, equal-responsibility coterie. In this paper we propose two extensions to k-coteries: the Div-Torus method divides the system nodes into k clusters and runs a separate instance of a torus coterie in each cluster; the k-Torus method uses quorums of tail s=[h/(k+1)]. We compare the quorum size and quorum availability of the two proposed methods, and against the DIV method which is based on the majority quorums in each of the k divided clusters, assuming the node reliability is a constant. Numerical data demonstrate that DIV and Div-Torus have similar system availability, better than that of the k-Torus, although all 3 methods' availability becomes comparable when the node reliability is higher than 0.9. However, Div-Torus has the smallest quorum size and k-Torus the second smallest, which has the potential of causing less network traffic when requesting permissions from a quorum.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"A comparison of two torus-based k-coteries\",\"authors\":\"S. Lang, L. Mao\",\"doi\":\"10.1109/ICPADS.1998.741086\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entries in a critical section. In the original coterie, the system nodes are logically arranged in a rectangle, called a torus, in which the last row (column) is followed by the first row (column) using end wraparound. A torus quorum consists of a head and a tail, where the head contains one entire row and the tail contains one node from each of the s succeeding rows, s/spl ges/1 is a system parameter. It has been shown that by setting s=[h/2], where h=the number of rows, the collection of torus quorums form an equal-sized, equal-responsibility coterie. In this paper we propose two extensions to k-coteries: the Div-Torus method divides the system nodes into k clusters and runs a separate instance of a torus coterie in each cluster; the k-Torus method uses quorums of tail s=[h/(k+1)]. We compare the quorum size and quorum availability of the two proposed methods, and against the DIV method which is based on the majority quorums in each of the k divided clusters, assuming the node reliability is a constant. Numerical data demonstrate that DIV and Div-Torus have similar system availability, better than that of the k-Torus, although all 3 methods' availability becomes comparable when the node reliability is higher than 0.9. However, Div-Torus has the smallest quorum size and k-Torus the second smallest, which has the potential of causing less network traffic when requesting permissions from a quorum.\",\"PeriodicalId\":226947,\"journal\":{\"name\":\"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS.1998.741086\",\"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 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.1998.741086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entries in a critical section. In the original coterie, the system nodes are logically arranged in a rectangle, called a torus, in which the last row (column) is followed by the first row (column) using end wraparound. A torus quorum consists of a head and a tail, where the head contains one entire row and the tail contains one node from each of the s succeeding rows, s/spl ges/1 is a system parameter. It has been shown that by setting s=[h/2], where h=the number of rows, the collection of torus quorums form an equal-sized, equal-responsibility coterie. In this paper we propose two extensions to k-coteries: the Div-Torus method divides the system nodes into k clusters and runs a separate instance of a torus coterie in each cluster; the k-Torus method uses quorums of tail s=[h/(k+1)]. We compare the quorum size and quorum availability of the two proposed methods, and against the DIV method which is based on the majority quorums in each of the k divided clusters, assuming the node reliability is a constant. Numerical data demonstrate that DIV and Div-Torus have similar system availability, better than that of the k-Torus, although all 3 methods' availability becomes comparable when the node reliability is higher than 0.9. However, Div-Torus has the smallest quorum size and k-Torus the second smallest, which has the potential of causing less network traffic when requesting permissions from a quorum.