The Token Distribution Problem
From MaRDI portal
Recommendations
Cited in
(27)- Dimension-exchange token distribution on the mesh and the torus
- A note on the token distribution problem
- Constructing disjoint paths on expander graphs
- Rapid convergence of a local load balancing algorithm for asynchronous rings
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
- Predicting speedup for distributed computing on a token ring network
- Dimension-exchange algorithms for token distribution on tree-connected architectures
- Strongly adaptive token distribution
- Local algorithms for sparse spanning graphs
- Towards worst-case churn resistant peer-to-peer systems
- On the stability of dynamic diffusion load balancing
- Optimal Construction of Edge-Disjoint Paths in Random Graphs
- scientific article; zbMATH DE number 1267563 (Why is no real title available?)
- Near‐perfect token distribution
- Strongly adaptive token distribution
- scientific article; zbMATH DE number 2156276 (Why is no real title available?)
- Representing shared data on distributed-memory parallel computers
- Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance
- scientific article; zbMATH DE number 7376014 (Why is no real title available?)
- scientific article; zbMATH DE number 7561459 (Why is no real title available?)
- Near-perfect token distribution
- An extended dimension order token distribution algorithm on k-ary d-cubes and its complexity
- Structural Information and Communication Complexity
- Implementing shared memory on multi-dimensional meshes and on the fat-tree
- Dimension-exchange token distribution on the mesh and the torus
- The complexity of deterministic PRAM simulation on distributed memory machines
- Cubical token systems
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)