8 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…
Multi-User Non-Linearly Separable Distributed Computing
Ali Khalesi, Ahmad Tanha, Derya Malak +1
This paper considers an -server distributed computing setting with users requesting functions that are arbitrary multivariable polynomial evaluations of real (potentiall…
Secure Multi-User Linearly-Separable Distributed Computing
Amir Masoud Jafarpisheh, Ali Khalesi, Petros Elia
The introduction of the new multi-user linearly-separable distributed computing framework, has recently revealed how a parallel treatment of users can yield large parallelization g…
Order Optimal Task Allocation in Distributed Computing via Interweaved Cliques
Javad Maheri, K. K. Krishnan Namboodiri, Petros Elia
We consider a distributed computing system in which a master node coordinates workers to evaluate a function over input files, where this function accepts general decomposi…
Fundamental Limits of Multi-User Distributed Computing of Linearly Separable Functions
K. K. Krishnan Namboodiri, Elizabath Peter, Derya Malak +1
This work establishes the fundamental limits of the classical problem of multi-user distributed computing of linearly separable functions. In particular, we consider a distributed…
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…