A note on the token distribution problem

doi:10.1016/0020-0190(91)90090-5

Information Processing Letters

Volume 38, Issue 6, 28 June 1991, Pages 329-334

https://doi.org/10.1016/0020-0190(91)90090-5 Get rights and content

Under a Creative Commons license

open archive

Abstract

Consider a set of packets distributed unevenly among the nodes of a bounded degree network of processors. The Token Distribution Problem involves redistributing these packets so that each node holds the same number. Token distribution algorithms underlie several efficient routing algorithms. Peleg and Upfal formulated this problem and presented a communication-efficient solution. In this paper we refine their techniques to provide a solution that is efficient with respect to both communication and local computation.

Keywords

Parallel algorithms

routing

expander graphs

Cited by (0)

^∗: The author's current address is: Department of Computer Science, University College, Cork, Ireland, United Kingdom. This work was supported in part by the Joint Services Electronics Program under contract F49620-87-C-0044.