Publication:3833622

DOI10.1137/0218015zbMATH Open0677.68054OpenAlexW2047680997MaRDI QIDQ3833622FDOQ3833622

David Peleg, Eli Upfal

Publication date: 1989

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0218015

zbMATH Keywords

communicationexpander graphsparallel and distributed computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99) Theory of operating systems (68N25)

Cited In (21)

• Near‐perfect token distribution
• Title not available (Why is that?)
• Title not available (Why is that?)
• AN EXTENDED DIMENSION ORDER TOKEN DISTRIBUTION ALGORITHM ON k-Ary d-CUBES AND ITS COMPLEXITY
• Title not available (Why is that?)
• Rapid convergence of a local load balancing algorithm for asynchronous rings
• Towards worst-case churn resistant peer-to-peer systems
• On the stability of dynamic diffusion load balancing
• Strongly adaptive token distribution
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• A note on the token distribution problem
• Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
• Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance
• Implementing shared memory on multi-dimensional meshes and on the fat-tree
• Near-perfect token distribution
• Representing shared data on distributed-memory parallel computers
• Constructing disjoint paths on expander graphs
• Local algorithms for sparse spanning graphs
• Structural Information and Communication Complexity
• Cubical token systems
• The complexity of deterministic PRAM simulation on distributed memory machines

This page was built for publication: The Token Distribution Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833622)