DagSemProc.06461.4.pdf
- Filesize: 195 kB
- 5 pages
Document
A Comparison Between Mechanisms for Sequential Compute Resource Auctions
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 6461
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2007-05-10
Cite AsGet BibTex
Andrew Byde. A Comparison Between Mechanisms for Sequential Compute Resource Auctions. In Negotiation and Market Engineering. Dagstuhl Seminar Proceedings, Volume 6461, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/DagSemProc.06461.4
https://doi.org/10.4230/DagSemProc.06461.4
Abstract
This paper describes simulations designed to test the relative efficiency of two di®erent sequential auction mechanisms for allocating compute resources between users in a shared data-center. Specifically we model the environment of a data center dedicated to CGI rendering in which animators delegate responsibility for acquiring adequate compute resources to bidding agents that automously bid on their behalf. For each of two possible auction types we apply a genetic algorithm to a broad class of bidding strategies to determine a near-optimal bidding strategy for a specified auction type, and use statistics of the performance of these strategies to determine the most suitable auction type for this domain.
Keywords
- Auction resource allocation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads