EFFICIENT ALGORITHM FOR EVALUATING THE AVAILABILITY OF MULTIDIMENSIONAL VOTING

dc.citation.epage	24	en_US
dc.citation.issue	1	en_US
dc.citation.spage	21	en_US
dc.citation.volume	9	en_US
dc.citation.woscount	0
dc.contributor.author	CHANG, HK	en_US
dc.contributor.author	YUAN, SM	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.date.accessioned	2014-12-08T15:04:12Z
dc.date.available	2014-12-08T15:04:12Z
dc.date.issued	1994-01-01	en_US
dc.description.abstract	Voting is a fault-tolerant technique to synchronize conflict operations on shared resources in a faulty distributed system. Multidimensional voting is a generalization of traditional weighted voting. The availability of a voting system is determined by the vote and quorum assignments. In this paper, we present an O(n(k)+1) efficient algorithm for evaluating the availability of any given k-multidimensional vote and quorum assignments, where n is the number of sites in the system and k is the number of dimensions.	en_US
dc.identifier.issn	0267-6192	en_US
dc.identifier.journal	COMPUTER SYSTEMS SCIENCE AND ENGINEERING	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/2701
dc.identifier.wosnumber	WOS:A1994NB36000003
dc.language.iso	en_US	en_US
dc.subject	DISTRIBUTED SYSTEMS	en_US
dc.subject	FAULT TOLERANCE	en_US
dc.subject	MULTIDIMENSIONAL VOTING	en_US
dc.subject	VOTE AND QUORUM ASSIGNMENTS	en_US
dc.subject	AVAILABILITY	en_US
dc.title	EFFICIENT ALGORITHM FOR EVALUATING THE AVAILABILITY OF MULTIDIMENSIONAL VOTING	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1