scispace - formally typeset
Search or ask a question
Topic

Communication complexity

About: Communication complexity is a research topic. Over the lifetime, 3870 publications have been published within this topic receiving 105832 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: This work presents a distributed algorithm for solving the group mutual exclusion problem based on the notion of surrogate-quorum, which uses the quorum that has been successfully locked by a request as a surrogate to service other compatible requests for the same type of critical section.
Abstract: The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type (or a group) with each critical section. In this problem, processes requesting critical sections of the same type can execute their critical sections concurrently. However, processes requesting critical sections of different types must execute their critical sections in a mutually exclusive manner. We present a distributed algorithm for solving the group mutual exclusion problem based on the notion of surrogate-quorum. Intuitively, our algorithm uses the quorum that has been successfully locked by a request as a surrogate to service other compatible requests for the same type of critical section. Unlike the existing quorum-based algorithms for group mutual exclusion, our algorithm achieves a low message complexity of O(q) and a low (amortized) bit-message complexity of O(bqr), where q is the maximum size of a quorum, b is the maximum number of processes from which a node can receive critical section requests, and r is the maximum size of a request while maintaining both synchronization delay and waiting time at two message hops. As opposed to some existing quorum-based algorithms, our algorithm can adapt without performance penalties to dynamic changes in the set of groups. Our simulation results indicate that our algorithm outperforms the existing quorum-based algorithms for group mutual exclusion by as much as 45 percent in some cases. We also discuss how our algorithm can be extended to satisfy certain desirable properties such as concurrent entry and unnecessary blocking freedom.

33 citations

Journal ArticleDOI
TL;DR: A simple yet accurate analysis of the bit error rate performance for differential chaos shift keying communication system is proposed by using the non-central F distribution of the decision variable and assuming variable bit energy in the calculation.
Abstract: A simple yet accurate analysis of the bit error rate performance for differential chaos shift keying communication system is proposed for an additive white Gaussian noise channel by using the non-central F distribution of the decision variable and assuming variable bit energy in the calculation. The new method has much higher accuracy or much lower computational complexity than the existing methods in the literature. Numerical results show that in most cases, the predicted bit error rate from the new method is indistinguishable from the simulated bit error rate, showing the effectiveness of our result.

33 citations

Proceedings ArticleDOI
06 Jan 2013
TL;DR: It is shown that a (1−1/2e+e)-approximation for welfare maximization in combinatorial auctions with submodular valuations would require exponential communication, the first communication complexity lower bound for constant-factor approximation of the sub modular welfare problem.
Abstract: We prove the first communication complexity lower bound for constant-factor approximation of the submodular welfare problem. More precisely, we show that a (1−1/2e+e)-approximation (b 0.816) for welfare maximization in combinatorial auctions with submodular valuations would require exponential communication. We also show NP-hardness of (1−1/2e+e)-approximation in a computational model where each valuation is given explicitly by a table of constant size. Both results rule out better than (1−1/2e)-approximations in every oracle model with a separate oracle for each player, such as the demand oracle model.Our main tool is a new construction of monotone submodular functions that we call multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f with a high value f(S) for every set S e F (a "peak"), and a low value on every set that does not intersect significantly any set in F.We also study two other related problems: max-min allocation (for which we also get hardness of (1-1/2e+e)-approximation, in both models), and combinatorial public projects (for which we prove hardness of (3/4 + e)-approximation in the communication model, and hardness of (1−1 + e)-approximation in the computational model, using constant size valuations).

33 citations

Proceedings ArticleDOI
20 Nov 1994
TL;DR: This paper concerns the open problem of Lovasz and Saks (1988) regarding the relationship between the communication complexity of a Boolean function and the rank of the associated matrix and proves two related theorems.
Abstract: This paper concerns the open problem of Lovasz and Saks (1988) regarding the relationship between the communication complexity of a Boolean function and the rank of the associated matrix. We first give an example exhibiting the largest gap known. We then prove two related theorems. >

33 citations

Proceedings ArticleDOI
29 Nov 2004
TL;DR: In this paper, the architecture-aware regular and irregular repeat-accumulate (AARA) code design is proposed to achieve high-performance decoder design for RA codes of large block length.
Abstract: This paper investigates high-performance decoder design for regular and irregular repeat-accumulate (RA) codes of large block length. In order to achieve throughputs and bit-error rate performance that are inline with future trends in high-speed communications. high-throughput and low-power decoders of low complexity are needed. To meet such conflicting requirements for long codes, the concept of architecture-aware RA (AARA) code design is proposed. AARA code design decouples the complexity of the decoder from the owe structure by inducing structural regularity features that are amenable to efficient and scalable decoder implementations. Design methods of AARA codes with structured permuters for which an iterative decoding algorithm performs well under message-passing are analogous to those for AA LDPC codes. Algorithmic and architectural optimizations that address the latency, memory overhead, and complexity problems typical of iterative decoders for long RA codes are investigated, and a staggered decoding schedule is introduced. AARA decoders using the proposed schedule have substantial advantage over serial and parallel RA decoders.

33 citations


Network Information
Related Topics (5)
Upper and lower bounds
56.9K papers, 1.1M citations
84% related
Encryption
98.3K papers, 1.4M citations
82% related
Network packet
159.7K papers, 2.2M citations
81% related
Server
79.5K papers, 1.4M citations
81% related
Wireless network
122.5K papers, 2.1M citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202319
202256
2021161
2020165
2019149
2018141