PPT-Dominant Resource Fairness: Fair Allocation of Multiple Resource Types

Author : HappyHippo | Published Date : 2022-08-01

Ali Ghodsi Matei Zaharia Benjamin Hindman Andy Konwinski Scott Shenker Ion Stoica University of California Berkeley Resource Sharing Multiple users share

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 Resource Types: Transcript

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. Fair . Allocation of Multiple Resource Types. Ali . Ghodsi. , . Matei. . Zaharia. , Benjamin . Hindman. , Andy . Konwinski. , Scott . Shenker. , Ion . Stoica. University . of California, . Berkeley. 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. Qingyang. Wang, . Simon . Malkowski. , Yasuhiko . Kanemasa. , . Deepal. . Jayasinghe. , . Pengcheng. . Xiong. , . Motoyuki. . Kawaba. , . Lilian. Harada, . Calton. . Pu. 25th IEEE International Parallel & Distributed Processing Symposium. for . Cluster Schedulers. Robert Grandl. Aditya Akella. Srikanth Kandula. Ganesh Ananthanarayanan. Sriram Rao. Diverse Resource Requirements. Tasks need varying amounts of each resource. E.g., Memory [100MB to 17GB]. 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 . Ali . Ghodsi. , . Matei. . Zaharia. , Benjamin . Hindman. , Andy . Konwinski. , Scott . Shenker. , Ion . Stoica. University of California, Berkley. EECS 582 – W16. 1. Outlines. Introduction. Motivation. 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.”. The Impact of Soft Resource Allocation on n-tier Application Scalability Qingyang Wang, Simon Malkowski , Yasuhiko Kanemasa , Deepal Jayasinghe , Pengcheng Xiong , Motoyuki Kawaba , Lilian 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. 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 Resource Types"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.