An approach to dominant resource fairness in distributed environment

8Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study the multi-type resource allocation problem in distributed computing environment. Current approaches that guarantee the conditions of Dominant Resource Fairness (DRF) are centralized algorithms. However, as P2P cloud systems gain more popularity, distributed algorithms that satisfy conditions of DRF are in demand. So we propose a distributed algorithm that mostly satisfies DRF conditions. According to our simulation results, our distributed dominant resource fairness algorithm outperforms a naive distributed extension of DRF.

Cite

CITATION STYLE

APA

Zhu, Q., & Oh, J. C. (2015). An approach to dominant resource fairness in distributed environment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9101, pp. 141–150). Springer Verlag. https://doi.org/10.1007/978-3-319-19066-2_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free