Pricing computer services: queueing effects
Communications of the ACM
Dynamic control structures for cooperating processes
Dynamic control structures for cooperating processes
Mathematical modeling and Ada simulation of some synchronization processes
ANSS '87 Proceedings of the 20th annual symposium on Simulation
Simulation of a market model for distributed control
ANSS '88 Proceedings of the 21st annual symposium on Simulation
The Operational Analysis of Queueing Network Models
ACM Computing Surveys (CSUR)
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.
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
| Hi-index | 0.02 |
The allocation of computing resources and the scheduling of tasks in a multitasking environment are simulated using a distributed control model. The tasks compete for computing resources in a decentralized manner through sealed bid auctions to improve their schedules, rather than having resources centrally administered by a host controller. Funds used for bidding are endowed to the tasks upon arrival at the computing system. The effects on completion times of three endowment strategies and two machine sizes are analyzed using a range of system capacities. Within each capacity class, an apparent cost, derived from the run parameters, is contrasted with an implied price generated by the auction process. Performance is examined in terms of congestion at various capacities. At optimal (lowest cost per successful completion) rates of occurrence of these capacity classes, an implied price arises that exceeds the “free access” price. This internally generated price appears to ration resources and time, thus discouraging congestion. Implementing such a distributed control algorithm suggests that determining a price schedule for allocating computing resources can be moved “to the left” in the system life cycle.