.png){kind=icon}
返回
Efficient distributed algorithms for holistic aggregation functions on random regular graphs
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-020-2996-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose efficient distributed algorithms for three holistic aggregation functions on random regular graphs that are good candidates for network topology in next-generation data centers. The three holistic aggregation functions include SELECTION (select the k-th largest or smallest element), DISTINCT (query the count of distinct elements), MODE (query the most frequent element). We design three basic techniques - Pre-order Network Partition, Pairwise-independent Random Walk, and Random Permutation Delivery, and devise the algorithms based on the techniques. The round complexity of the distributed SELECTION is Theta (log N) which meets the lower bound where N is the number of nodes and each node holds a numeric element. The round complexity of the distributed DISTINCT and MODE algorithms are O(log(3)N / log log N) and O(log(2)N log log N) respectively. All of our results break the lower bounds obtained on general graphs and our distributed algorithms are all based on the CONGEST model, which restricts each node to send only O(log N) bits on each edge in one round under synchronous communications.
Keyword:
distributed algorithms
holistic aggregation function
random regular graph
CONGEST model
communication complexity
round complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
Multiple Polypeptide Hormone Expression in Pancreatic Islet Cell Carcinomas Derived from Phosphoenolpyruvatecarboxykinase-SV40 T Antigen Transgenic Rats.png)
Pancreas
PancreasIF0
PREAI
分享收藏Palladium-Catalyzed Asymmetric Decarboxylative Cycloaddition of Vinylethylene Carbonates with Electrophiles: Construction of Quaternary StereocentersSynlett
SynlettIF0
PREAI
分享收藏
查看更多内容