15 citations · 36 across the 17 of their papers we have counts for
19 papers
Bipartite matching under communication constraints
Moonmoon Mohanty, Gautham Bolar, Preetam Patil +3
In modern data center networks, thousands of hosts contend for shared link capacity; the scale of these systems makes centralized scheduling impractical. This article models such s…
A Model of Job Parallelism for Latency Reduction in Large-Scale Systems
Ayalvadi Ganesh, Arpan Mukhopadhyay
Processing computation-intensive jobs at multiple processing cores in parallel is essential in many real-world applications. In this paper, we consider an idealised model for job p…
The Distribution of the Number of Isolated Nodes in the 1-Dimensional Soft Random Geometric Graph
Michael Wilsher, Carl Dettmann, Ayalvadi Ganesh
We study the number of isolated nodes in a soft random geometric graph whose vertices constitute a Poisson process on the torus of length L (the line segment [0,L] with periodic bo…
Asymptotic Optimality for Decentralised Bandits
Conor Newton, Ayalvadi Ganesh, Henry W. J. Reeve
We consider a large number of agents collaborating on a multi-armed bandit problem with a large number of arms. The goal is to minimise the regret of each agent in a communication-…
Low latency allcast over broadcast erasure channels
Mark A. Graham, Ayalvadi J. Ganesh, Robert J. Piechocki
Consider n nodes communicating over an unreliable broadcast channel. Each node has a single packet that needs to be communicated to all other nodes. Time is slotted, and a time slo…
Connectivity in One-Dimensional Soft Random Geometric Graphs
Michael Wilsher, Carl P. Dettmann, Ayalvadi Ganesh
In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and co…