A Price-Anticipating Resource Allocation Mechanism for Distributed Shared Clusters

Details A Price-Anticipating Resource Allocation Mechanism for Distributed Shared Clusters A Price-Anticipating Resource Allocation Mechanism for Distributed Shared Clusters

2005-02-04

arxiv.org/abs/cs/0502019v1

Proceedings of the ACM Conference on Electronic Commerce 2005

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed market-based resource allocation system. Multiple users decide how to distribute their budget (bids) among multiple machines according to their individual preferences to maximize their individual utility. We look at both the efficiency and the fairness of the allocation at the equilibrium, where fairness is evaluated through the measures of utility uniformity and envy-freeness. We show analytically and through simulations that despite being highly decentralized, such a system converges quickly to an equilibrium and unlike the social optimum that achieves high efficiency but poor fairness, the proposed allocation scheme achieves a nice balance of high degrees of efficiency and fairness at the equilibrium.

Affiliated with

Also associated with

No associations

Rating

A Price-Anticipating Resource Allocation Mechanism for Distributed Shared Clusters does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Price-Anticipating Resource Allocation Mechanism for Distributed Shared Clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Price-Anticipating Resource Allocation Mechanism for Distributed Shared Clusters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527955