Sciweavers

142 search results - page 2 / 29
» Near-perfect Token Distribution
Sort
View
EUROPAR
2000
Springer
13 years 11 months ago
A Combinatorial Characterization of Properties Preserved by Antitokens
Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distr...
Costas Busch, Neophytos Demetriou, Maurice Herlihy...
ISPDC
2008
IEEE
14 years 1 months ago
Token Loss Detection for Random Walk based Algorithm
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
Thibault Bernard, Alain Bui, Devan Sohier
ICALP
1992
Springer
13 years 11 months ago
Near-perfect Token Distribution
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...
COMCOM
1998
95views more  COMCOM 1998»
13 years 7 months ago
Correlation properties of the token leaky bucket departure process
In this paper we focus on the behavior of the token leaky bucket mechanism with respect to second-order statistics of the departure process under various correlated cell arrival a...
Kenneth Mitchell, Appie van de Liefvoort, Jerry Pl...