The move-to-partner rule for self-organizing task allocation on a linear array
From MaRDI portal
Publication:4532399
DOI10.1081/STM-120002777zbMATH Open0999.68028OpenAlexW2007403873MaRDI QIDQ4532399FDOQ4532399
Authors: Walter J. Gutjahr
Publication date: 22 July 2002
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/stm-120002777
Recommendations
Cites Work
- Random walks and hyperplane arrangements
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Quadratic assignment problems
- An exact formula for the move-to-front rule for self-organizing lists
- On the matrix occurring in a linear search problem
- Stochastic reversibility in self-organizing systems
- Convergence to stationary state for a Markov move-to-front scheme
- Dynamic load balancing by random matchings
- Optimal parameters for load balancing using the diffusion method in \(k\)- ary \(n\)-cube network
- Self-organizing lists and independent references: A statistical synergy
- An Account of Self-Organizing Systems
- Title not available (Why is that?)
- Self-Organizing Doubly-Linked Lists
- Task assignment in Cayley interconnection topologies
- A generalized abel's partial summation formula and its application in self-organizing systems
Cited In (1)
This page was built for publication: The move-to-partner rule for self-organizing task allocation on a linear array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4532399)