TY - GEN
T1 - TOKEN DISTRIBUTION PROBLEM.
AU - Peleg, David
AU - Upfal, Eli
PY - 1986
Y1 - 1986
N2 - The problem of routing simultaneously many packets on bounded-degree interconnection networks is fundamental to the theory of parallel and distributed computation. In the first part of this work we give an optimal solution for the general communication problem on bounded-degree networks. In the second part we attempt to achieve a similarly wide result for the exact K token distribution problem. We present a probabilistic algorithm that solves the (n, 1, 1)-routing problem, i. e. , executes any (n, 1, 1)-communication request in O(log n) steps on any d-regular expander. The algorithm is a variant of Valiant's two phase routing algorithm.
AB - The problem of routing simultaneously many packets on bounded-degree interconnection networks is fundamental to the theory of parallel and distributed computation. In the first part of this work we give an optimal solution for the general communication problem on bounded-degree networks. In the second part we attempt to achieve a similarly wide result for the exact K token distribution problem. We present a probabilistic algorithm that solves the (n, 1, 1)-routing problem, i. e. , executes any (n, 1, 1)-communication request in O(log n) steps on any d-regular expander. The algorithm is a variant of Valiant's two phase routing algorithm.
UR - http://www.scopus.com/inward/record.url?scp=0022900126&partnerID=8YFLogxK
U2 - 10.1109/SFCS.1986.55
DO - 10.1109/SFCS.1986.55
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0022900126
SN - 0818607408
SN - 9780818607400
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 418
EP - 427
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - IEEE
ER -