ACM Home Page
Please provide us with feedback. Feedback
Modeling the cost of resource allocation in distributed control
Full text PdfPdf (1.18 MB)
Source Annual Simulation Symposium archive
Proceedings of the 23rd annual symposium on Simulation table of contents
Nashville, Tennessee, United States
Pages: 151 - 164  
Year of Publication: 1990
ISBN:0-8186-2067-6
Also published in ...
Authors
Martin D. Fraser  Department of Mathematics and Computer Science, Georgia State University, Atlanta, Georgia
Ross A. Gagliano  Department of Mathematics and Computer Science, Georgia State University, Atlanta, Georgia
Mark E. Schaefer  Department of Economics, Georgia State University, Atlanta, Georgia
Sponsor
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/99633.99657
What is a DOI?

ABSTRACT

Modifying our previously developed simulation model [FRA89], we study in this paper the costs associated with distributed allocation of computing resources in a multitasking environment. Using funds endowed upon arrival, computing tasks compete for necessary resources through sealed-bid auctions to improve their processing schedules. The costs and times dedicated to auctioning are compared to the costs and times allowed for task processing. Measuring computing resources in terms of processing rates allows the task management, in the form of an auction, algorithm, to have its requirements specified in the same way as the requirements for the simulated mission processing. Machine capacity is computed for and assigned to each completing task. Data are then compiled by segmented capacity classes. A unifying theme of past and current research is the efficiency of auctioning to allocate reconfigurable computing resources in a variable capacity machine. We observed that at optimal rates of occurrence of capacity classes which minimize the total costs per successful completion, congestion was resolved through auctions generating endogenously implied prices which substantially exceeded the exogenously imposed price.


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.

 
FRA87
 
FRA89
 
GAG88
 
GAG87
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," to appear in the Proceedings of the 4th International Symposium on Systems Research, Informatics and Cybernetics, The International Institute for Advanced Studies in Systems Research and Cybernetics.
 
GAG90
Gagliano, R. A. and M. E. Schaefer. 1990. "Decentralized Control of Access to Resources in a Network: Interdependence of Strategies in a Challenge Ring Model," (in press) Advances i__nnControl Networks and Large Scale Parallel Distributed Processing Models, M. D. Fraser (ed.), Ablex Publishing Co.
 
HOC81
MEN85
 
RAI86
 
RAS87
Rashid, R. F. 1987. "Designs for Parallel Architectures," UNIX Review, Vol. 5, No. 4, April.
 
WHI89


Collaborative Colleagues:
Martin D. Fraser: colleagues
Ross A. Gagliano: colleagues
Mark E. Schaefer: colleagues

Peer to Peer - Readers of this Article have also read: