Sliver, a Fast Distributed Slicing Algorithm
Vincent Gramoli, Ýmir Vigfússon, Ken Birman, Anne-Marie Kermarrec · 2008
Slicing a distributed system involves partitioning the nodes into k equal-size subsets using a onedimensional attribute. A new gossip-based slicing algorithm that we call Sliver is proposed here; relative to alternatives, it converges more rapidly to an accurate solution and does a better job of tolerating churn. The low cost and simplicity of the solution makes it appropriate for use in a wide range of practical settings.