By Topic

Network partition and its application to distributed selection problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jyun-Jy Hu ; Inst. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Shi-Nine Yang ; Chern, M.-S.

The authors discuss the network partition and the distributed selection problems for a general tree network. The distributed selection problem is to select the k-th smallest element of a set N of elements distributed among nodes of a point-to-point asynchronous communication network. The distributed algorithms considered are primarily message driven. All the messages have a fixed length, and may carry only a limited amount of information. The authors assume the network is sufficiently reliable so that the messages sent in a link are received error free by the receiver node in first-in-first-out (FIFO) order with finite but totally unpredictable delays. The authors present an improved selection algorithm for general tree networks. Based on the conventional reduction strategy, they introduce a tree partition technique to localize the message passing and therefore to reduce the total message complexity

Published in:

Computers and Communications, 1991. Conference Proceedings., Tenth Annual International Phoenix Conference on

Date of Conference:

27-30 Mar 1991