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…
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…
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…
Constructing Hamiltonian Decompositions of Complete -Uniform Hypergraphs
Javad Maheri, Petros Elia
Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance,…