Computer networks
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
The power of multimedia: combining point-to point and multi-access networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
LoGPC: modeling network contention in message-passing programs
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
LoGPC: Modeling Network Contention in Message-Passing Programs
IEEE Transactions on Parallel and Distributed Systems
Broadcast Communications and Distributed Algorithms
IEEE Transactions on Computers
| Hi-index | 0.00 |
In this paper, we investigate the power of such broadcast in solving a paradigmatic problem in distributed computing. Imagine a network in which each node machine Ni (1-&-le;i-&-le;n) keeps a Boolean value vi in local memory. The vi 's determine a set S-&-equil;{i: vi-&-equil;1}. The non-emptiness problem on n nodes is to find some i in S, or else find that S is empty. In practice, a problem of this type arises in two ways: 1. Consensus testing: Has any node voted -&-ldquo;no-&-rdquo;, where vi-&-equil;1 means node i votes -&-ldquo;no-&-rdquo;, and vi-&-equil;O means node i votes -&-ldquo;yes-&-rdquo;? 2. Establishing a distinguished node: S specifies a set of candidates, and solving non-emptiness selects one. For example, the nodes may be bidding for a Job or a resource. In section 2, we introduce an idealistic broadcast communication scheme which abstracts certain features of the CSMA technology.