|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
| |
3
|
Gagliano~ R. A., M. D. Fraser and M. E. Schaefer. 1987. "A Market Model for Distributed Control: The Role of Algorithms for the Initial Endowment of Wealth," Presented at (and to appear in the Proceedings of) the International Symposium on Systems Research, Informatics and Cybernetics, Baden-Baden, West Germany (Aug.).
|
| |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
Zimmerman, W.F. (Jet Propulsion Laboratory). 1988. Personal communication, 21st Annual Simulation Symposium, Tampa, FL, (March).
|
|