Pith. sign in

REVIEW

A note on the dynamic dominant resource fairness mechanism

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1509.07935 v2 pith:EZNMK3VW submitted 2015-09-26 cs.GT cs.DCcs.DS

A note on the dynamic dominant resource fairness mechanism

classification cs.GT cs.DCcs.DS
keywords dynamicresourceallocationmechanismdominantfairfairnessmulti-resource
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Multi-resource fair allocation has beena hot topic of resource allocation. Most recently, a dynamic dominant resource fairness (DRF) mechanism is proposed for dynamic multi-resource fair allocation. In this paper, we prove that the competitive ratio of the dynamic DRF mechanism is the reciprocal of the number of resource types, for two different objectives. Moreover, we develop a linear-time algorithm to find a dynamic DRF solution at each step.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.