The proportional-share allocation market for computational resources

Michal Feldman, Kevin Lai, Li Zhang

Research output: Contribution to journalArticlepeer-review

Abstract

We study the problem of allocating shared resources, such as bandwidth in computer networks and computational resources in shared clusters, among multiple users by the proportional-share market mechanism. Under this mechanism, each user partitions his budget among the multiple resources and receives a fraction of each resource proportional to his bid. We first formulate the resource allocation game under the proportional-share mechanism and study the efficiency and fairness of the equilibrium in this game. We present analytic and simulation results demonstrating that the proportional-share mechanism achieves a reasonable balance of high degrees of efficiency and fairness at the equilibrium.

Original languageEnglish
Pages (from-to)1075-1088
Number of pages14
JournalIEEE Transactions on Parallel and Distributed Systems
Volume20
Issue number8
DOIs
StatePublished - 2009
Externally publishedYes

Keywords

  • Game theory
  • Proportional-share mechanism
  • Resource allocation

Fingerprint

Dive into the research topics of 'The proportional-share allocation market for computational resources'. Together they form a unique fingerprint.

Cite this