How to assign votes in a distributed system
Journal of the ACM (JACM)
Efficient decentralized consensus protocols
IEEE Transactions on Software Engineering
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A Geometric Approach for Constructing Coteries and k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Combinatorial theory (2nd ed.)
Combinatorial theory (2nd ed.)
IEEE Transactions on Computers
Designing Efficient Distributed Algorithms Using Sampling Techniques
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A new distributed algorithm for implementation of LOTOS
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Unifying Themes for Network Selection
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Efficient Distributed Ranking and Sorting Schemes for a Coterie
ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Hi-index | 0.00 |
In this paper, we develop efficient selection and sorting schemes for processing large files distributed over a network. The efficiencies of the schemes are expressed in terms of message count and communication delay. The schemes are developed using the concept of coteries which is a class of communication structures widely used in the development of some classical distributed algorithms, namely mutual exclusion, multiway rendezvous, etc. The development of the schemes is carried out as follows. First, we develop a ranking scheme. Second, using the ranking scheme, we develop a restricted version of sorting, where each node of the network contains exactly one key, and the sorting leads to the ith node holding the ith key of the sorted list. Third, using this restricted sorting, a selection scheme is developed. Given n keys evenly distributed among p nodes, selection of the kth key means identifying the value of the key. Finally, using the idea of selection, we sort the n keys distributed among p nodes. Both the ranking and the restricted sorting steps need O(p√p) messages and suffer a two-round communication delay. The selection step needs Op3/2 log n) messages with communication delay of O(τ log p), where τ is the maximum of the times taken by a message to be sent to all the members of a quorum. The sorting scheme needs O(n) messages and its communication delay is O(τn/p). Both of these complexities are optimal provided n is polynomial in p and n = Ω(p5/2 log n).