Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/846
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorCao, J-
dc.creatorZhou, J-
dc.creatorChen, D-
dc.creatorWu, J-
dc.date.accessioned2014-12-11T08:24:11Z-
dc.date.available2014-12-11T08:24:11Z-
dc.identifier.isbn0-7695-2132-0-
dc.identifier.urihttp://hdl.handle.net/10397/846-
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.rights© 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_US
dc.rightsThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.en_US
dc.subjectAlgorithmsen_US
dc.subjectComputational methodsen_US
dc.subjectComputer simulationen_US
dc.subjectProblem solvingen_US
dc.subjectSynchronizationen_US
dc.subjectTopologyen_US
dc.titleAn efficient distributed mutual exclusion algorithm based on relative consensus votingen_US
dc.typeConference Paperen_US
dcterms.abstractMany algorithms for achieving mutual exclusion in distributed computing systems have been proposed. The three most often used performance measures are the number of messages exchanged between the nodes per Critical Section (CS) execution, the response time, and the synchronization delay. In this paper, we present a new fully distributed mutual exclusion algorithm. A node requesting the CS sends out the request message which will roam in the network The message will be forwarded among the nodes until the requesting node obtains enough permissions to decide its order to enter the CS. The decision is made by using Relative Consensus Voting (RCV), which is a variation of the well-known Majority Consensus Voting (MCV) scheme. Unlike existing algorithms which determine the node to enter the CS one by one, in our algorithm, several nodes can be decided and ordered for executing the CS. The synchronization delay is minimal. Although the message complexity can be up to O(N) in the worst case in a system with N nodes, our simulation results show that, on average, the algorithm needs less number of messages and has less response time than most of those existing algorithms which do not require a logical topology imposed on the nodes. This is especially true when the system is under heavy demand. Another feature of the proposed algorithm is that it does not require the FIFO property of the underlying message passing mechanism.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIPDPS 2004 : 18th International Parallel & Distributed Processing Symposium : 26-30 April 2004, Santa Fe, New Mexico, p. 711-720-
dcterms.issued2004-
dc.identifier.scopus2-s2.0-12444304463-
dc.relation.ispartofbookIPDPS 2004 : 18th International Parallel & Distributed Processing Symposium : 26-30 April 2004, Santa Fe, New Mexico-
dc.relation.conferenceIEEE International Parallel and Distributed Processing Symposium [IPDPS]-
dc.identifier.rosgroupidr18313-
dc.description.ros2003-2004 > Academic research: refereed > Refereed conference paper-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
consensus-voting_04.pdf187.68 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

85
Last Week
2
Last month
Citations as of Mar 24, 2024

Downloads

73
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

6
Last Week
0
Last month
1
Citations as of Mar 29, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.