PPT-Dominant Resource Fairness: Fair Allocation of Multiple Res

Author : luanne-stotts | Published Date : 2017-08-04

Ali Ghodsi Matei Zaharia Benjamin Hindman Andy Konwinski Scott Shenker Ion Stoica University of California Berkley EECS 582 W16 1 Outlines Introduction

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "Dominant Resource Fairness: Fair Allocat..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Dominant Resource Fairness: Fair Allocation of Multiple Res: Transcript

Ali Ghodsi Matei Zaharia Benjamin Hindman Andy Konwinski Scott Shenker Ion Stoica University of California Berkley EECS 582 W16 1 Outlines Introduction Motivation. Dynamic Fair Division of Multiple Resources . Ian Kash. 1. Ariel Procaccia. 2. Nisarg. Shah. 2. (Speaker). 1. MSR Cambridge. 2. Carnegie Mellon University. Allocation of Multiple Resources Without Money. MICROECONOMICS. Principles and Analysis. . Frank Cowell. . Almost essential . Welfare: Basics. Prerequisites. July 2015. 1. Fairness: some conceptual problems. Can fairness be reconciled with an individualistic approach to welfare?. Fair . Allocation of Multiple Resource Types. Ali . Ghodsi. , . Matei. . Zaharia. , Benjamin . Hindman. , Andy . Konwinski. , Scott . Shenker. , Ion . Stoica. University . of California, . Berkeley. Lecture 24. Aditya Akella. Performance Isolation and Fairness in Multi-Tenant Cloud Storage. , D. . Shue. , M. Freedman and A. . Shaikh. , OSDI 2012.. 3. Setting: Shared Storage in the Cloud. Z. Y. T. Advanced Topics in Computer Systems. Lecture 13. Resource allocation: . Lithe/DRF. October 16. th. . , 2012. John Kubiatowicz and Anthony D. Joseph. Electrical Engineering and Computer Sciences. University of California, Berkeley. Why did it rain this morning?. Why are you at this lecture?. Why did TCP give me throughput √2/(. rtt. . √p)?. Why did TCP give me throughput √2. /(. rtt. . √p)?. τελος. teleology. The doctrine or study of ends or final causes, especially as related to the evidences of design or purpose in nature; also . David Parkes (Harvard). Ariel Procaccia (CMU). Nisarg Shah (CMU). Motivation. Allocation of multiple resources (e.g., CPU, RAM, bandwidth) . Users have heterogeneous demands. Today: fixed bundles (slots). Why did it rain this morning?. Why are you at this lecture?. Why did TCP give me throughput √2/(. rtt. . √p)?. Why did TCP give me throughput √2. /(. rtt. . √p)?. τελος. teleology. The doctrine or study of ends or final causes, especially as related to the evidences of design or purpose in nature; also . Qingyang. Wang, . Simon . Malkowski. , Yasuhiko . Kanemasa. , . Deepal. . Jayasinghe. , . Pengcheng. . Xiong. , . Motoyuki. . Kawaba. , . Lilian. Harada, . Calton. . Pu. 25th IEEE International Parallel & Distributed Processing Symposium. David Parkes (Harvard). Ariel Procaccia (CMU). Nisarg Shah (CMU). Motivation. Allocation of multiple resources (e.g., CPU, RAM, bandwidth) . Users have heterogeneous demands. Today: fixed bundles (slots). Problem. What is it?. Implementation. Benefits. Experimentation. Findings. Other Scheduling Algorithms. Conclusion. . Outline. Problem. “Scheduling computations in multi-threaded systems is complex, and challenging problem.”. Ali . Ghodsi. , . Matei. . Zaharia. , Benjamin . Hindman. , Andy . Konwinski. , Scott . Shenker. , Ion . Stoica. What is Fair Sharing?. n users want to share a resource (e.g., CPU). Solution: . Allocate each 1/n of the shared resource. Ali . Ghodsi. , . Matei. . Zaharia. , Benjamin Hindman, Andy . Konwinski. , Scott . Shenker. , Ion . Stoica. . University of California, Berkeley . Resource Sharing. Multiple users share the resource from a system. Mingwei. Hu. . . F. airness criteria in network resource allocation. How do we achieve fairness between multiplexed packets traffic ?. By allocating rate among flows (flow rate fairness). Flow rate fairness has been the goal behind fair...

Download Document

Here is the link to download the presentation.
"Dominant Resource Fairness: Fair Allocation of Multiple Res"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.