.png){kind=icon}
返回
Efficient distributed selection with bounded messages
.png){kind=icon}
PRE
AI
DOI：10.1109/71.588617.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of selecting the Kth smallest element of a set distributed among the sites of a communication network when the size of messages is bounded; that is, each message is a packet which contains at most c bits, where c greater than or equal to 1 is a constant. A general selection algorithm using packets is presented and its packet complexity is analyzed. Its complexity is shown to be a significant improvement for a large range of packet sizes over the existing bounds. The proposed technique is then instanciated for specific classes of network topologies; the resulting bounds either match or improve the ones of existing solutions for a large range of values of the packet size. Furthermore, it is bit optimal in star networks.
Keyword:
bounded-size messages
communication complexity
communication networks
distributed algorithms
distributed sets
K-selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
Atrial fibrillation in hypertrophic cardiomyopathy: prevalence, clinical impact, and management
PREAI
分享收藏
查看更多内容