Tree-based Algorithm to Find the k-th Value in Distributed Systems

Thumbnail Image
Date
1994-04-24
Authors
Cheon, Yoonsik
Wong, Johnny
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Authors
Person
Research Projects
Organizational Units
Organizational Unit
Journal Issue
Is Version Of
Versions
Series
Department
Computer Science
Abstract

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.

Comments
Description
Keywords
Citation
DOI
Source
Subject Categories
Copyright
Collections