4 papers
Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling
Javad Maheri, K. K. Krishnan Namboodiri, Petros Elia
Hypergraph edge partitioning is a central problem in theoretical and applied computer science, with broad impact on distributed computation, communications, optimization, and machi…
Universal and Asymptotically Optimal Data and Task Allocation in Distributed Computing
Javad Maheri, K. K. Krishnan Namboodiri, Petros Elia
We study the joint minimization of communication and computation costs in distributed computing, where a master node coordinates workers to evaluate a function over a library o…
Fundamental Limits of Distributed Computing for Linearly Separable Functions
K. K. Krishnan Namboodiri, Elizabath Peter, Derya Malak +1
This work addresses the problem of distributed computation of linearly separable functions, where a master node with access to datasets, employs servers to compute user…
Placement Delivery Arrays for Coded Caching with Shared and Private Caches
K. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan
We consider a coded caching network consisting of a server with a library of files connected to users, where each user is equipped with a dedicated cache of size unit…