Randomized distributed access to mutually exclusive resources
Summary: Many systems consist of a set of agents which must acquire exclusive access to resources from a shared pool. Coordination of agents in such systems is often implemented in the form of a centralized mechanism. The intervention of this type of mechanism, however, typically introduces significant computational overhead and reduces the amount of concurrent activity. Alternatives to centralized mechanisms exist, but they generally suffer from the need for extensive interagent communication. In this paper, we develop a randomized approach to make multiagent resource-allocation decisions with the objective of maximizing expected concurrency measured by the number of the active agents. This approach does not assume a centralized mechanism and has no need for interagent communication. Compared to existing autonomous-decentralized-decision-making-based approaches for resource-allocation, our work emphasizes achieving the highest degree of agent autonomy and is able to handle more general resource requirements.
- Randomized mutual exclusion on a multiple access channel
- Sequential requests from randomly distributed shared resources
- Analysis of randomized protocols for conflict-free distributed access
- scientific article; zbMATH DE number 139935
- A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network
- Randomized mutual exclusion algorithms revisited
- Sharing resources at nonuniform access rates
- scientific article; zbMATH DE number 1304098
This page was built for publication: Randomized distributed access to mutually exclusive resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2498232)
