Towards Economic Fairness for Big Data Processing in Pay-as-you-go Cloud Computing Nanyang Technological University Shanjiang Tang, Bu-Sung Lee, Bingsheng.

Slides:



Advertisements
Similar presentations
Pricing for Utility-driven Resource Management and Allocation in Clusters Chee Shin Yeo and Rajkumar Buyya Grid Computing and Distributed Systems (GRIDS)
Advertisements

1 Capacity mechanisms - IFIEC position June 12 th 2012.
Evaluating the Cost-Benefit of Using Cloud Computing to Extend the Capacity of Clusters Presenter: Xiaoyu Sun.
Public Goods and Tax Policy
Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
SLA-Oriented Resource Provisioning for Cloud Computing
Sharing Cloud Networks Lucian Popa, Gautam Kumar, Mosharaf Chowdhury Arvind Krishnamurthy, Sylvia Ratnasamy, Ion Stoica UC Berkeley.
A Prior-Free Revenue Maximizing Auction for Secondary Spectrum Access Ajay Gopinathan and Zongpeng Li IEEE INFOCOM 2011, Shanghai, China.
Locality-Aware Dynamic VM Reconfiguration on MapReduce Clouds Jongse Park, Daewoo Lee, Bokyeong Kim, Jaehyuk Huh, Seungryoul Maeng.
Module 7 Pricing. Objective for Module 7 Gain a sound understanding of the psychological effects of pricing strategies. Differentiate between the economic.
Cloud Computing Resource provisioning Keke Chen. Outline  For Web applications statistical Learning and automatic control for datacenters  For data.
Copyright © 2015 Open iT, Inc. All rights reserved. A Chargeback Methodology for Cutting Costs & Increasing Asset Efficiency Linda Cole Director of Sales,
Enabling High-level SLOs on Shared Storage Andrew Wang, Shivaram Venkataraman, Sara Alspaugh, Randy Katz, Ion Stoica Cake 1.
Service Level Agreement based Allocation of Cluster Resources: Handling Penalty to Enhance Utility Chee Shin Yeo and Rajkumar Buyya Grid Computing and.
SLA Basics Describes a set of non functional requirements of the service. Example : RTO time – Return to Operation Time if case of failure SLO – Service.
Reciprocal Resource Fairness: Towards Cooperative Multiple-Resource Fair Sharing in IaaS Clouds School of Computer Engineering Nanyang Technological University,
Xavier León PhD defense
Efficient Autoscaling in the Cloud using Predictive Models for Workload Forecasting Roy, N., A. Dubey, and A. Gokhale 4th IEEE International Conference.
A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks John C.S. Lui The Chinese University of Hong Kong Joint work.
1 A General Auction-Based Architecture for Resource Allocation Weidong Cui, Matthew C. Caesar, and Randy H. Katz EECS, UC Berkeley {wdc, mccaesar,
UC Berkeley Improving MapReduce Performance in Heterogeneous Environments Matei Zaharia, Andy Konwinski, Anthony Joseph, Randy Katz, Ion Stoica University.
Competitive Analysis of Incentive Compatible On-Line Auctions Ron Lavi and Noam Nisan SISL/IST, Cal-Tech Hebrew University.
Efficient agent-based selection of DiffServ SLAs over MPLS networks Thanasis G. Papaioannou a,b, Stelios Sartzetakis a, and George D. Stamoulis a,b presented.
Cluster Scheduler Reference: Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center NSDI’2011 Multi-agent Cluster Scheduling for Scalability.
Network Sharing Issues Lecture 15 Aditya Akella. Is this the biggest problem in cloud resource allocation? Why? Why not? How does the problem differ wrt.
Department of Computer Science Engineering SRM University
Bargaining Towards Maximized Resource Utilization in Video Streaming Datacenters Yuan Feng 1, Baochun Li 1, and Bo Li 2 1 Department of Electrical and.
Towards a Contract-based Fault-tolerant Scheduling Framework for Distributed Real-time Systems Abhilash Thekkilakattil, Huseyin Aysan and Sasikumar Punnekkat.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
Dynamic Resource Allocation Using Virtual Machines for Cloud Computing Environment.
COLLABORATIVE SPECTRUM MANAGEMENT FOR RELIABILITY AND SCALABILITY Heather Zheng Dept. of Computer Science University of California, Santa Barbara.
L14. Fair networks and topology design D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
SLA-based Resource Allocation for Software as a Service Provider (SaaS) in Cloud Computing Environments Author Linlin Wu, Saurabh Kumar Garg and Rajkumar.
An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing Weijie Shi*, Linquan Zhang +, Chuan Wu*, Zongpeng Li +, Francis C.M. Lau*
1 Time & Cost Sensitive Data-Intensive Computing on Hybrid Clouds Tekin Bicer David ChiuGagan Agrawal Department of Compute Science and Engineering The.
E VALUATION OF F AIRNESS IN ICN X. De Foy, JC. Zuniga, B. Balazinski InterDigital
1 A Framework for Data-Intensive Computing with Cloud Bursting Tekin Bicer David ChiuGagan Agrawal Department of Compute Science and Engineering The Ohio.
Dominant Resource Fairness: Fair Allocation of Multiple Resource Types Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion.
Strategyproof Auctions For Balancing Social Welfare and Fairness in Secondary Spectrum Markets Ajay Gopinathan, Zongpeng Li University of Calgary Chuan.
TRUST:A General Framework for Truthful Double Spectrum Auctions Xia Zhou and Heather Zheng Department of Computer Science, University of California, Santa.
Demand Response Workshop September 15, Definitions are important Demand response –“Changes in electricity usage by end-use customers from their.
October 18, 2005 Charm++ Workshop Faucets A Framework for Developing Cluster and Grid Scheduling Solutions Presented by Esteban Pauli Parallel Programming.
Using Map-reduce to Support MPMD Peng
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
MROrder: Flexible Job Ordering Optimization for Online MapReduce Workloads School of Computer Engineering Nanyang Technological University 30 th Aug 2013.
Shanjiang Tang, Bu-Sung Lee, Bingsheng He, Haikun Liu School of Computer Engineering Nanyang Technological University Long-Term Resource Fairness Towards.
Dynamic Slot Allocation Technique for MapReduce Clusters School of Computer Engineering Nanyang Technological University 25 th Sept 2013 Shanjiang Tang,
DynamicMR: A Dynamic Slot Allocation Optimization Framework for MapReduce Clusters Nanyang Technological University Shanjiang Tang, Bu-Sung Lee, Bingsheng.
CS223: Software Engineering Lecture 2: Introduction to Software Engineering.
NC STATE UNIVERSITY / MCNC Protecting Network Quality of Service Against Denial of Service Attacks Douglas S. Reeves  S. Felix Wu  Fengmin Gong Talk:
Algorithmic Mechanism Design Shuchi Chawla 11/7/2001.
Using Map-reduce to Support MPMD Peng
Presented by Qifan Pu With many slides from Ali’s NSDI talk Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion Stoica.
Dominant Resource Fairness: Fair Allocation of Multiple Resource Types Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion.
Spark on Entropy : A Reliable & Efficient Scheduler for Low-latency Parallel Jobs in Heterogeneous Cloud Huankai Chen PhD Student at University of Kent.
Optimization of Resources in Clouds using Virtualization Department of Computer Science Punjabi University, Patiala Supervisor Name: Submitted By: Dr.
Online Parameter Optimization for Elastic Data Stream Processing Thomas Heinze, Lars Roediger, Yuanzhen Ji, Zbigniew Jerzak (SAP SE) Andreas Meister (University.
Near-Optimal Spectrum Allocation for Cognitive Radios: A Frequency-Time Auction Perspective Xinyu Wang Department of Electronic Engineering Shanghai.
Aaron Harlap, Alexey Tumanov*, Andrew Chung, Greg Ganger, Phil Gibbons
CS 425 / ECE 428 Distributed Systems Fall 2016 Nov 10, 2016
CS 425 / ECE 428 Distributed Systems Fall 2017 Nov 16, 2017
Software Engineering Introduction to Apache Hadoop Map Reduce
EECS 582 Final Review Mosharaf Chowdhury EECS 582 – F16.
Omega: flexible, scalable schedulers for large compute clusters
COS 518: Advanced Computer Systems Lecture 14 Michael Freedman
Elastic Task Model For Adaptive Rate Control
Shanjiang Tang1, Bingsheng He2, Shuhao Zhang2,4, Zhaojie Niu3
Creating a Dynamic HPC Infrastructure with Platform Computing
Cloud Computing Large-scale Resource Management
Presentation transcript:

Towards Economic Fairness for Big Data Processing in Pay-as-you-go Cloud Computing Nanyang Technological University Shanjiang Tang, Bu-Sung Lee, Bingsheng He School of Computer Engineering Nanyang Technological University 5/12/2015

Pay-as-You-Go Cloud Computing is Pervasive and Popular Charge users based on the amount of resources used over time (e.g., Hourly). Advantages – Elasticity – Flexibility – Cost efficiency Big data processing on the cloud – E.g., product recommendation, user’s behavior analysis, log analysis – Processing Frameworks: MapReduce, Spark. 2Nanyang Technological University5/12/2015

Twitter’s Cluster One week data from Twitter production cluster [Delimitrou et. Al. ASPLOS’14] Resource Utilization = User resource demands are heterogeneous. – Users have different demands. – A user’s demand is changing over time.  Static provisioning/partitioning causes underutilization. Resource utilization is a critical problem in such pay-as-you-use environments. – Providers waste resources (  waste investment and lose profit). – Users waste money. 3Nanyang Technological University5/12/2015

Resource Sharing can improve resource utilization. – Allow underloaded users to release resources to other users. – Allow overloaded users to temporarily use more resources (from others).  Reduce the idle resources at runtime. What about fairness? – If the fairness is not solved, resource sharing is unlikely to achieve in pay-as-you-use environments. To Share or Not To Share? 4Nanyang Technological University5/12/2015

Pay-as-you-go Fairness: Resource-as-you-pay The total resources a user gained should be proportional to her payment. This is a Service-Level Agreement (SLA). 60 $ 40 $ A: B: 60% 40% Resource Service A A B B Resource Service = Resources-per-time X service time 5Nanyang Technological University5/12/2015

Fair Policy in Existing Systems State-of-the-art: Max-min fairness – Select the user with the minimum allocation/share ratio every time. – Consider the present requirement only (memoryless). Memoryless fairness has severe problems in pay-as-you-use environments, violating the following properties: – Resource-as-you-pay fairness guarantee. – Cost-efficient workload incentive. (Users should be better not to submit dirty workload) – Truthfulness (Users should not get benefits by cheating). 6Nanyang Technological University5/12/2015

Problems with MemoryLess Fairness Resource-as-you-pay Fairness Problem – E.g., A, B equally pay for total resource of 100 units. Time New Demand AB t A A B B Accumulate Resource Usage: Accumulate Resource Usage: Unsatisfied Demand A A B B Current Allocation at t1: Nanyang Technological University5/12/2015

Problems with MemoryLess Fairness Resource-as-you-pay Fairness Problem – E.g., A, B equally pay for total resource of 100 units. Time New Demand AB t t A A B B Accumulate Resource Usage: Accumulate Resource Usage: A A B B Unsatisfied Demand Current Allocation at t2: Nanyang Technological University5/12/2015

Problems with MemoryLess Fairness Resource-as-you-pay Fairness Problem – E.g., A, B equally pay for total resource of 100 units. Time New Demand AB t t t A A B B Accumulated resource usage: A A B B Unsatisfied Demand Current Allocation at t3: Nanyang Technological University5/12/2015

Problems with MemoryLess Fairness Resource-as-you-pay Fairness Problem – E.g., A, B equally pay for total resource of 100 units. Time New Demand AB t t t t A A B B Accumulated resource usage: A A B B Unsatisfied Demand Existing Fair Policy fails to satisfy Resource-as-you-pay fairness!!! 10 Current Allocation at t4: Nanyang Technological University5/12/2015

Other Problems for MemoryLess Fairness Cost-inefficient workload incentive Problem – Selfish users might possess unneeded resources by submitting dirty workloads. Untruthfulness Problem – Cheating users can get benefit under memoryless policy. 11Nanyang Technological University5/12/2015 Proof sketches are in the paper.

Our Work Challenges: can we find a fair sharing policy that satisfies the following properties? – Resource-as-you-pay fairness – Cost-efficient workload incentives – Truthfulness Our Solution: Long-Term Resource Fairness – Ensure resource fairness over a period of time. – With historical information considered. 12Nanyang Technological University5/12/2015

Long-Term Resource Fairness Basic Concept: Loan agreement (Lending w/o interests) – When resources are not needed, users can lend the resources to others. – When more resources are needed, others should give back.  Benefit others and user herself. 13Nanyang Technological University5/12/2015

Long-Term Resource Fairness Satisfy Pay-as-you-use Fairness Time New Demand AB t A A B B Accumulated resource usage: Unsatisfied Demand A A B B Current Allocation at t1: A A B B Lend Resources: Nanyang Technological University5/12/2015

Long-Term Resource Fairness Satisfy Pay-as-you-use Fairness Time New Demand AB t t A A B B Accumulated resource usage: A A B B Unsatisfied Demand Current Allocation at t2: A A B B Lend Resources: Nanyang Technological University5/12/2015

Long-Term Resource Fairness Satisfy Pay-as-you-use Fairness Time New Demand AB t t A A B B Accumulated resource usage: A A B B Unsatisfied Demand Current Allocation at t2: A A B B Lend Resources: t Nanyang Technological University5/12/2015

Long-Term Resource Fairness Satisfy Pay-as-you-use Fairness Time New Demand AB t t t A A B B Accumulated resource usage: A A B B Unsatisfied Demand Current Allocation at t3: A A B B Lend Resources: Nanyang Technological University5/12/2015

Long-Term Resource Fairness Satisfy Pay-as-you-use Fairness Time New Demand AB t t t A A B B Accumulated resource usage: A A B B Unsatisfied Demand Current Allocation at t3: A A B B Lend Resources: t Nanyang Technological University5/12/2015

Long-Term Resource Fairness Satisfy Pay-as-you-use Fairness Time New Demand AB t t t t A A B B Accumulated resource usage: A A B B Unsatisfied Demand Long-Term Resource Fairness satisfy Resource-as-you-pay fairness. 19 Current Allocation at t4: A A B B Lend Resources: Nanyang Technological University5/12/2015

Properties of Long-Term Resource Fairness Satisfy resource-as-you-pay fairness Satisfy cost-efficient workload incentives – Running dirty/cost-inefficient workload can waste money. Users cannot get benefits by lying (strategy- proof). – A robust policy should avoid cheating users get benefit. Otherwise, nobody is willing to share resources. 20 Proof sketches are in the paper. Nanyang Technological University5/12/2015

LTYARN Implement Long-Term Resource Fairness in YARN – Extend memoryless max-min fairness to long-term max- min fairness. – Add a few components into resource manager Support full long-term and time window-based requirements. Currently support a single resource type (main memory). The experimental Results demonstrates the effectiveness of our approach. 21Nanyang Technological University5/12/2015 Detailed design and experimental results are in the paper.

Future Work Plan Consider Multi-resource fairness – Different types of resources, e.g.,. Move to Heterogeneous pricing plans and instance types – On-demand price plan, reserved price plan – t2.micro, t2.small, t2.medium, and m3.large 22Nanyang Technological University5/12/2015

23Nanyang Technological University5/12/2015