Parallel Communication Obliviousness: One Round and Beyond
Summary: Analyzes communication-oblivious MPC algorithms, emphasizing one-round behavior and obliviousness-based compilation. Skew-free hashing incurs Omega(N) load under obliviousness, yet one-round natural joins reach best MPC loads; a compiler converts an l-round MPC with load L into a 2l-round oblivious version with (1+δ)L load. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yufei Tao (Chinese University of Hong Kong)
- 2. Ru Wang (Chinese University of Hong Kong)
- 3. Shiyuan Deng (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{tao_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Parallel Communication Obliviousness: One Round and Beyond}},
url = {https://dl.acm.org/doi/10.1145/3695832},
doi = {10.1145/3695832},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Tao, Yufei and Wang, Ru and Deng, Shiyuan},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,242 | Communication Steps for Parallel Query Processing | 2013 | PODS | 0.00011372366 |
| 1,483 | Skew in Parallel Query Processing | 2014 | PODS | 0.00010500209 |
| 1,547 | Upper and Lower Bounds on the Cost of a Map-Reduce Computation | 2013 | VLDB | 0.00010268377 |
| 2,475 | Output-optimal Parallel Algorithms for Similarity Joins | 2017 | PODS | 8.3947133e-05 |
| 3,985 | Massively Parallel Algorithms for Personalized PageRank | 2021 | VLDB | 6.8649592e-05 |
| 4,487 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS | 6.5628751e-05 |
| 5,610 | Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins | 2021 | PODS | 6.0498245e-05 |
| 7,313 | Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries | 2020 | PODS | 5.5428538e-05 |
| 9,119 | Distributed and Streaming Linear Programming in Low Dimensions | 2019 | PODS | 5.208561e-05 |
| 11,992 | Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins | 2021 | PODS | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,643 | Parallel-Correctness and Transferability for Conjunctive Queries | 2015 | PODS |
| 2 | 4,357 | Algorithmic Aspects of Parallel Query Processing | 2018 | SIGMOD |
| 3 | 6,136 | The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication | 2015 | PODS |
| 4 | 2,052 | A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries | 2017 | PODS |
| 5 | 1,547 | Upper and Lower Bounds on the Cost of a Map-Reduce Computation | 2013 | VLDB |
| 6 | 11,992 | Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins | 2021 | PODS |
| 7 | 12,176 | Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice | 2020 | VLDB |
| 8 | 1,242 | Communication Steps for Parallel Query Processing | 2013 | PODS |
| 9 | 1,483 | Skew in Parallel Query Processing | 2014 | PODS |
| 10 | 12,320 | Communication Cost in Parallel Query Evaluation: A Tutorial | 2017 | PODS |