Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/856
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorWang, X-
dc.creatorCao, J-
dc.creatorTeo, YM-
dc.date.accessioned2014-12-11T08:24:23Z-
dc.date.available2014-12-11T08:24:23Z-
dc.identifier.isbn0-7695-2135-5-
dc.identifier.issn1087-4089-
dc.identifier.urihttp://hdl.handle.net/10397/856-
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.subjectCommunication complexityen_US
dc.subjectDistributed processingen_US
dc.subjectProtocolsen_US
dc.titleAn approach to achieve message efficient early-stopping uniform consensus protocolsen_US
dc.typeConference Paperen_US
dcterms.abstractExisting consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t + 1 processes engaging in sending messages in each round.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationISPAN 2004: 7th International Symposium on Parallel Architectures, Algorithms and Networks: proceedings, May 10–12, 2004, Hong Kong, SAR, China, p. 300-305-
dcterms.issued2004-
dc.identifier.scopus2-s2.0-3543079933-
dc.identifier.rosgroupidr20364-
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 
early-stopping_04.pdf132.79 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

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

Downloads

55
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Mar 22, 2024

Google ScholarTM

Check


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