Sciweavers

142 search results - page 9 / 29
» Near-perfect Token Distribution
Sort
View
ESA
2004
Springer
127views Algorithms» more  ESA 2004»
14 years 3 months ago
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of nearest...
Robert Elsässer, Burkhard Monien, Stefan Scha...
GLOBECOM
2008
IEEE
14 years 4 months ago
Queuing Performance of Long-Range Dependent Traffic Regulated by Token-Bucket Policers
 Long-range dependence (LRD) is a widely verified property of Internet traffic, which severely affects network performance yielding longer queuing delays. Token-bucket policers ...
Stefano Bregni, Roberto Cioffi, Paolo Giacomazzi
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 10 months ago
Tight Bounds for Blind Search on the Integers
We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...
HPCA
2005
IEEE
14 years 10 months ago
Improving Multiple-CMP Systems Using Token Coherence
Improvements in semiconductor technology now enable Chip Multiprocessors (CMPs). As many future computer systems will use one or more CMPs and support shared memory, such systems ...
Michael R. Marty, Jesse D. Bingham, Mark D. Hill, ...
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 1 months ago
Finding Mobile Data: Efficiency vs. Location Inaccuracy
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
Amotz Bar-Noy, Joanna Klukowska