Tree-based Algorithm to Find the k-th Value in Distributed Systems Cheon, Yoonsik Wong, Johnny Wong, Johnny
dc.contributor.department Computer Science 2018-02-13T22:20:37.000 2020-06-30T01:56:45Z 2020-06-30T01:56:45Z 1994-04-24
dc.description.abstract <p>In this paper, we study distributed algorithms for finding the k-th value in the decentralized systems. First we consider the case of circular configuration of processors where no processor knows the total number of participants. Later a network of arbitrary configuration is examined and a tree-based algorithm is proposed. The proposed algorithm requires O(N) messages and O(log N) rounds of message passing, where N is the number of nodes in the network.</p>
dc.identifier archive/
dc.identifier.articleid 1047
dc.identifier.contextkey 5281234
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath cs_techreports/33
dc.source.bitstream archive/|||Fri Jan 14 23:37:25 UTC 2022
dc.subject.disciplines Theory and Algorithms
dc.title Tree-based Algorithm to Find the k-th Value in Distributed Systems
dc.type article
dc.type.genre article
dspace.entity.type Publication
relation.isAuthorOfPublication 5b8e3e14-3847-4a36-aa1e-0782ced64a70
relation.isOrgUnitOfPublication f7be4eb9-d1d0-4081-859b-b15cee251456
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
136.02 KB
Adobe Portable Document Format