论文标题
无线MapReduce的新干扰计划
A New Interference-Alignment Scheme for Wireless MapReduce
论文作者
论文摘要
我们考虑MAPREDUCE框架下的全简洁无线分布式计算（DC）系统。提出了标准化交付时间（NDT）和计算负载之间最佳权衡的新上限和下限。上限严格改善了先前报道的上限，并基于针对MapReduce节点的干扰取消能力量身定制的新型干扰比对（IA）方案。下限是通过信息理论匡威论证证明的。
We consider a full-duplex wireless Distributed Computing (DC) system under the MapReduce framework. New upper and lower bounds on the optimal tradeoff between Normalized Delivery Time (NDT) and computation load are presented. The upper bound strictly improves over the previous reported upper bounds and is based on a novel interference alignment (IA) scheme tailored to the interference cancellation capabilities of MapReduce nodes. The lower bound is proved through information-theoretic converse arguments.
