73 citations · 317 across the 29 of their papers we have counts for
10 papers · 1 filter
Coded Elastic Computing
Yaoqing Yang, Matteo Interlandi, Pulkit Grover +3
Cloud providers have recently introduced new offerings whereby spare computing resources are accessible at discounts compared to on-demand computing. Exploiting such opportunity is…
An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation
Utsav Sheth, Sanghamitra Dutta, Malhar Chaudhari +5
We propose a novel application of coded computing to the problem of the nearest neighbor estimation using MatDot Codes [Fahim. et.al. 2017], that are known to be optimal for matrix…
Straggler-Resilient and Communication-Efficient Distributed Iterative Linear Solver
Farzin Haddadpour, Yaoqing Yang, Malhar Chaudhari +2
We propose a novel distributed iterative linear inverse solver method. Our method, PolyLin, has significantly lower communication cost, both in terms of number of rounds as well as…
Coded Iterative Computing using Substitute Decoding
Yaoqing Yang, Malhar Chaudhari, Pulkit Grover +1
In this paper, we propose a new coded computing technique called "substitute decoding" for general iterative distributed computation tasks. In the first part of the paper, we use P…
Coding Method for Parallel Iterative Linear Solver
Yaoqing Yang, Pulkit Grover, Soummya Kar
Computationally intensive distributed and parallel computing is often bottlenecked by a small set of slow workers known as stragglers. In this paper, we utilize the emerging idea o…
Energy Efficient Distributed Coding for Data Collection in a Noisy Sparse Network
Yaoqing Yang, Soummya Kar, Pulkit Grover
We consider the problem of data collection in a two-layer network consisting of (1) links between distributed agents and a remote sink node; (2) a sparse network formed by thes…
Rate Distortion for Lossy In-network Function Computation: Information Dissipation and Sequential Reverse Water-Filling
Yaoqing Yang, Pulkit Grover, Soummya Kar
We consider the problem of distributed lossy linear function computation in a tree network. We examine two cases: (i) data aggregation (only one sink node computes) and (ii) consen…
Graph Codes for Distributed Instant Message Collection in an Arbitrary Noisy Broadcast Network
Yaoqing Yang, Soummya Kar, Pulkit Grover
We consider the problem of minimizing the number of broadcasts for collecting all sensor measurements at a sink node in a noisy broadcast sensor network. Focusing first on arbitrar…
Computing Linear Transformations with Unreliable Components
Yaoqing Yang, Pulkit Grover, Soummya Kar
We consider the problem of computing a binary linear transformation using unreliable components when all circuit components are unreliable. Two noise models of unreliable component…
How Much Frequency Can Be Reused in 5G Cellular Networks---A Matrix Graph Model
Yaoqing Yang, Bo Bai, Wei Chen
The 5th Generation cellular network may have the key feature of smaller cell size and denser resource employment, resulted from diminishing resource and increasing communication de…