1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.PR2021★ 1 cited
On the Persistent-Idle Load Distribution Policy Under Batch Arrivals and Random Service Capacity
Rami Atar, Isaac Keslassy, Gal Mendelson +2
The Persistent-Idle (PI) load distribution policy was recently introduced as an appealing alternative to current low-communication load balancing techniques. In PI, servers only up…
cs.PF2020
A Lower Bound on the stability region of Redundancy-d with FIFO service discipline
Gal Mendelson
Redundancy-d (R(d)) is a load balancing method used to route incoming jobs to K servers, each with its own queue. Every arriving job is replicated into 2<=d<=K tasks, which are the…
cs.DS2018
AnchorHash: A Scalable Consistent Hash
Gal Mendelson, Shay Vargaftik, Katherine Barabash +3
Consistent hashing (CH) is a central building block in many networking applications, from datacenter load-balancing to distributed storage. Unfortunately, state-of-the-art CH solut…