REVIEW 1 cited by
Coded Federated Computing in Wireless Networks with Straggling Devices and Imperfect CSI
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Distributed computing platforms typically assume the availability of reliable and dedicated connections among the processors. This work considers an alternative scenario, relevant for wireless data centers and federated learning, in which the distributed processors, operating on generally distinct coded data, are connected via shared wireless channels accessed via full-duplex transmission. The study accounts for both wireless and computing impairments, including interference, imperfect Channel State Information, and straggling processors, and it assumes a Map-Shuffle-Reduce coded computing paradigm. The total latency of the system, obtained as the sum of computing and communication delays, is studied for different shuffling strategies revealing the interplay between distributed computing, coding, and cooperative or coordinated transmission.
Forward citations
Cited by 1 Pith paper
-
Scheduling Policies for Federated Learning in Wireless Networks
The convergence rate of wireless federated learning is governed by a scheduling-and-decoding success probability, with proportional fair best at high SINR and round robin best at low SINR.
Discussion (0). Continue with ORCID to comment.