A New Interference-Alignment Scheme for Wireless MapReduce
Yue Bi, Mich\`ele Wigger, Yue Wu
TL;DR
This paper introduces a novel interference alignment scheme for full-duplex wireless MapReduce systems, improving the bounds on the tradeoff between delivery time and computation load.
Contribution
It presents a new interference alignment scheme specifically designed for MapReduce nodes, leading to tighter bounds on system performance.
Findings
New upper bounds on Normalized Delivery Time (NDT)
Tighter lower bounds established through information-theoretic arguments
Improved performance tradeoff analysis for wireless MapReduce systems
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Full-Duplex Wireless Communications · Energy Harvesting in Wireless Networks