The move-to-partner rule for self-organizing task allocation on a linear array
From MaRDI portal
Publication:4532399
DOI10.1081/STM-120002777zbMath0999.68028MaRDI QIDQ4532399
Publication date: 22 July 2002
Published in: Stochastic Models (Search for Journal in Brave)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Cites Work
- Unnamed Item
- Quadratic assignment problems
- Dynamic load balancing by random matchings
- Optimal parameters for load balancing using the diffusion method in \(k\)- ary \(n\)-cube network
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Random walks and hyperplane arrangements
- Task assignment in Cayley interconnection topologies
- An exact formula for the move-to-front rule for self-organizing lists
- On the matrix occurring in a linear search problem
- Self-organizing lists and independent references: A statistical synergy
- Stochastic reversibility in self-organizing systems
- Self-Organizing Doubly-Linked Lists
- An Account of Self-Organizing Systems
- A generalized abel's partial summation formula and its application in self-organizing systems
- Convergence to stationary state for a Markov move-to-front scheme