11 citations · 29 across the 22 of their papers we have counts for
6 papers · 1 filter
Information Spreading in Dynamic Networks under Oblivious Adversaries
John Augustine, Chen Avin, Mehraneh Liaee +2
We study the problem of gossip in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always…
Asymptotically Optimal Approximation Algorithms for Coflow Scheduling
Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman
Many modern datacenter applications involve large-scale computations composed of multiple data flows that need to be completed over a shared set of distributed resources. Such a co…
Global Information Sharing under Network Dynamics
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman +2
We study how to spread tokens of information to every node on an -node dynamic network, the edges of which are changing at each round. This basic {\em gossip problem} can be…
Discovery through Gossip
Bernhard Haeupler, Gopal Pandurangan, David Peleg +2
We study randomized gossip-based processes in dynamic networks that are motivated by discovery processes in large-scale distributed networks like peer-to-peer or social networks. A…
Information Spreading in Dynamic Networks
Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman +1
We study the fundamental problem of information spreading (also known as gossip) in dynamic networks. In gossip, or more generally, -gossip, there are pieces of information…
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Guolong Lin, Rajmohan Rajaraman
Motivated by applications in grid computing and project management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs w…