Dynamic control structures for cooperating processes
Dynamic control structures for cooperating processes
Parallel Computers Two: Architecture, Programming and Algorithms
Parallel Computers Two: Architecture, Programming and Algorithms
Minimization of supervisor conflict for multiprocessor computer systems.
Minimization of supervisor conflict for multiprocessor computer systems.
The simulation of a distributed control model for resource allocation and the implied pricing
ACM SIGSIM Simulation Digest
Modeling the cost of resource allocation in distributed control
ANSS '90 Proceedings of the 23rd annual symposium on Simulation
Auction allocation of computing resources
Communications of the ACM
The simulation of a distributed control model for resource allocation and the implied pricing
ANSS '89 Proceedings of the 22nd annual symposium on Simulation
| Hi-index | 0.02 |
Decentralized control in the allocation of computing resources to tasks in a multiprocessing environment is designed using a general concept of a market. Two different market models are developed: auction and barter. In both cases, the tasks compete among themselves for computing resources rather than having them assigned by a host. Definite relationships between market strategy and system performance were found. Moreover, the results varied with machine configuration and appear applicable to systems of distributed control.