The Token Distribution Problem
From MaRDI portal
Publication:3833622
DOI10.1137/0218015zbMath0677.68054OpenAlexW2047680997MaRDI QIDQ3833622
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25) Theory of software (68N99)
Related Items
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling ⋮ Towards worst-case churn resistant peer-to-peer systems ⋮ Strongly adaptive token distribution ⋮ Near‐perfect token distribution ⋮ Implementing shared memory on multi-dimensional meshes and on the fat-tree ⋮ Unnamed Item ⋮ Representing shared data on distributed-memory parallel computers ⋮ A note on the token distribution problem ⋮ Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance ⋮ The complexity of deterministic PRAM simulation on distributed memory machines ⋮ On the stability of dynamic diffusion load balancing ⋮ Unnamed Item ⋮ Near-perfect token distribution ⋮ Local algorithms for sparse spanning graphs ⋮ Constructing disjoint paths on expander graphs ⋮ Optimal Construction of Edge-Disjoint Paths in Random Graphs ⋮ Rapid convergence of a local load balancing algorithm for asynchronous rings ⋮ AN EXTENDED DIMENSION ORDER TOKEN DISTRIBUTION ALGORITHM ON k-Ary d-CUBES AND ITS COMPLEXITY
