A comparison between mechanisms for sequential compute resource auctions

Authors:
Andrew Byde
Affiliations:
HP Labs, Stoke Gifford, Bristol
Venue:
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Year:
2006

Citing 4
Cited 4

Spawn: A Distributed Computational Economy

IEEE Transactions on Software Engineering
A Microeconomic Scheduler for Parallel Computers

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Market-based Proportional Resource Sharing for Clusters

Market-based Proportional Resource Sharing for Clusters
Exploring bidding strategies for market-based scheduling

Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce

Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty

Journal of Artificial Intelligence Research
Expressive power-based resource allocation for data centers

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Coordinating learning agents for multiple resource job scheduling

ALA'09 Proceedings of the Second international conference on Adaptive and Learning Agents
Market mechanisms for managing datacenters with heterogeneous microarchitectures

ACM Transactions on Computer Systems (TOCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes simulations designed to test the relative efficiency of two different sequential auction mechanisms for allocating compute resources between users in a shared data-center. 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.