Uppsala, April 12-16th 2010EGEE 5th User Forum1 A Business-Driven Cloudburst Scheduler for Bag-of-Task Applications Francisco Brasileiro, Ricardo Araújo,

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

L3S Research Center University of Hanover Germany
1 Bogotá, EELA-2 1 st Conference, On the Co-existence of Service and Opportunistic Grids Francisco Brasileiro Universidade Federal.
MyGrid: A User-Centric Approach for Grid Computing Walfredo Cirne Universidade Federal da Paraíba.
Dynamic Thread Assignment on Heterogeneous Multiprocessor Architectures Pree Thiengburanathum Advanced computer architecture Oct 24,
SLA-Oriented Resource Provisioning for Cloud Computing
Bag-of-Tasks Scheduling under Budget Constraints Ana-Maria Oprescu, Thilo Kielman Presented by Bryan Rosander.
Building Campus HTC Sharing Infrastructures Derek Weitzel University of Nebraska – Lincoln (Open Science Grid Hat)
1 Distributed Systems Meet Economics: Pricing in Cloud Computing Hadi Salimi Distributed Systems Lab, School of Computer Engineering, Iran University of.
A Computation Management Agent for Multi-Institutional Grids
Coordinated Workload Scheduling A New Application Domain for Mechanism Design Elie Krevat.
The OurGrid Project Walfredo Cirne Universidade Federal de Campina Grande.
Fault-tolerant Adaptive Divisible Load Scheduling Xuan Lin, Sumanth J. V. Acknowledge: a few slides of DLT are from Thomas Robertazzi ’ s presentation.
Idle virtual machine detection in FermiCloud Giovanni Franzini September 21, 2012 Scientific Computing Division Grid and Cloud Computing Department.
CloudCmp: Shopping for a Cloud Made Easy Ang Li Xiaowei Yang Duke University Srikanth Kandula Ming Zhang Microsoft Research 6/22/2010HotCloud 2010, Boston1.
WORKFLOWS IN CLOUD COMPUTING. CLOUD COMPUTING  Delivering applications or services in on-demand environment  Hundreds of thousands of users / applications.
The Effects of Systemic Packets Loss on Aggregate TCP Flows Thomas J. Hacker May 8, 2002 Internet 2 Member Meeting.
Ana-Maria Oprescu, Thilo Kielmann (Vrije University) Presented By Gal Cohen Cloud Computing Seminar CS Technion, Spring 2012.
HeteroPar 2013 Optimization of a Cloud Resource Management Problem from a Consumer Perspective Rafaelli de C. Coutinho, Lucia M. A. Drummond and Yuri Frota.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
MobSched: An Optimizable Scheduler for Mobile Cloud Computing S. SindiaS. GaoB. Black A.LimV. D. AgrawalP. Agrawal Auburn University, Auburn, AL 45 th.
A Budget Constrained Scheduling of Workflow Applications on Utility Grids using Genetic Algorithms Jia Yu and Rajkumar Buyya Grid Computing and Distributed.
Connecting OurGrid & GridSAM A Short Overview. Content Goals OurGrid: architecture overview OurGrid: short overview GridSAM: short overview GridSAM: example.
E-science grid facility for Europe and Latin America Bridging OurGrid-based and gLite-based Grid Infrastructures Abmar de Barros, Adabriand.
Creating an EC2 Provisioning Module for VCL Cameron Mann & Everett Toews.
Nicholas LoulloudesMarch 3 rd, 2009 g-Eclipse Testing and Benchmarking Grid Infrastructures using the g-Eclipse Framework Nicholas Loulloudes On behalf.
Budget-based Control for Interactive Services with Partial Execution 1 Yuxiong He, Zihao Ye, Qiang Fu, Sameh Elnikety Microsoft Research.
Xiao Liu CS3 -- Centre for Complex Software Systems and Services Swinburne University of Technology, Australia Key Research Issues in.
1 A Framework for Data-Intensive Computing with Cloud Bursting Tekin Bicer David ChiuGagan Agrawal Department of Compute Science and Engineering The Ohio.
Grid Computing at The Hartford Condor Week 2008 Robert Nordlund
Alexandre Duarte Gustavo Wagner Francisco Brasileiro Walfredo Cirne Multi-Environment Software Testing on the Grid Universidade Federal de Campina Grande.
BOF: Megajobs Gracie: Grid Resource Virtualization and Customization Infrastructure How to execute hundreds of thousands tasks concurrently on distributed.
1 Catania, 4 th EEGE User Forum/OGF 25, OurGrid integration with gLite based grids in EELA-2 Francisco Brasileiro Universidade.
Advanced Spectrum Management in Multicell OFDMA Networks enabling Cognitive Radio Usage F. Bernardo, J. Pérez-Romero, O. Sallent, R. Agustí Radio Communications.
1 Bogotá, EELA-2 1 st Conference, The OurGrid Approach for Opportunistic Grid Computing Francisco Brasileiro Universidade Federal.
E-science grid facility for Europe and Latin America Bridging the High Performance Computing Gap with OurGrid Francisco Brasileiro Universidade.
E-infrastructure shared between Europe and Latin America Interoperability between EELA and OurGrid Alexandre Duarte CERN and UFCG 1 st.
Conference name Company name INFSOM-RI Speaker name The ETICS Job management architecture EGEE ‘08 Istanbul, September 25 th 2008 Valerio Venturi.
Automatic Statistical Evaluation of Resources for Condor Daniel Nurmi, John Brevik, Rich Wolski University of California, Santa Barbara.
A Hyper-heuristic for scheduling independent jobs in Computational Grids Author: Juan Antonio Gonzalez Sanchez Coauthors: Maria Serna and Fatos Xhafa.
FATCOP: A Mixed Integer Program Solver Michael FerrisQun Chen Department of Computer Sciences University of Wisconsin-Madison Jeff Linderoth, Argonne.
1/22 Optimization of Google Cloud Task Processing with Checkpoint-Restart Mechanism Speaker: Sheng Di Coauthors: Yves Robert, Frédéric Vivien, Derrick.
EGEE-III INFSO-RI Enabling Grids for E-sciencE EGEE and gLite are registered trademarks Enabling the use of e-Infrastructures with.
Parameter Sweep and Resources Scaling Automation in Scalarm Data Farming Platform J. Liput, M. Paciorek, M. Wrona, M. Orzechowski, R. Slota, and J. Kitowski.
E-infrastructure shared between Europe and Latin America Interoperability between EELA and OurGrid Alexandre Duarte CERN IT-GD EELA Project.
Millions of Jobs or a few good solutions …. David Abramson Monash University MeSsAGE Lab X.
E-science grid facility for Europe and Latin America JRA1 role and its interaction with SA1 and NA3 Francisco Brasileiro Universidade Federal.
December 13, G raphical A symmetric P rocessing Prototype Presentation December 13, 2004.
Group # 14 Dhairya Gala Priyank Shah. Introduction to Grid Appliance The Grid appliance is a plug-and-play virtual machine appliance intended for Grid.
The EPIKH Project (Exchange Programme to advance e-Infrastructure Know-How) gLite Grid Introduction Salma Saber Electronic.
8 th International Desktop Grid Federation Workshop, Hannover, Germany, August 17 th, 2011 DEGISCO Desktop Grids for International Scientific Collaboration.
OPERATING SYSTEMS CS 3502 Fall 2017
Deploying Research in the Real World: The OurGrid Experience
Jacob R. Lorch Microsoft Research
Design rationale and status of the org.glite.overlay component
Where are being used the OS?
Interoperability & Standards
Class project by Piyush Ranjan Satapathy & Van Lepham
Professor Arne Thesen, University of Wisconsin-Madison
Basic Grid Projects – Condor (Part I)
Process Scheduling B.Ramamurthy 12/5/2018.
A Simulator to Study Virtual Memory Manager Behavior
CPU SCHEDULING.
Process Scheduling B.Ramamurthy 2/23/2019.
Chavit Denninnart, Mohsen Amini Salehi and Xiangbo Li
Process Scheduling B.Ramamurthy 4/11/2019.
Process Scheduling B.Ramamurthy 4/7/2019.
Uniprocessor scheduling
ShareGrid: architettura e middleware
Anand Bhat*, Soheil Samii†, Raj Rajkumar* *Carnegie Mellon University
Presentation transcript:

Uppsala, April 12-16th 2010EGEE 5th User Forum1 A Business-Driven Cloudburst Scheduler for Bag-of-Task Applications Francisco Brasileiro, Ricardo Araújo, David Candeia Maia, Raquel Lopes Federal University of Campina Grande, Brazil Department of Systems and Computing Distributed Systems Lab

Outline Motivation Problem Statement Business-driven heuristics for cloudbursting Evaluation Implementation Conclusions Uppsala, April 12-16th 20102EGEE 5th User Forum

Motivation Many e-Science applications can be easily parallelised – They fall in the so called, bag-of-tasks class of applications They have little QoS requirements – In particular, they can be executed on opportunistic infrastructures, since fault tolerance mechanism are trivially implemented Yet, the research cycle could be speeded up, if applications could complete faster – Can we leverage on the availability of resources in cloud computing providers, so to speed up the execution of such applications? – How much should one pay for that? Uppsala, April 12-16th 20103EGEE 5th User Forum

Computation infrastructure Uppsala, April 12-16th 2010EGEE 5th User Forum4 Free resources from opportunistic Desktop Grids (eg. Condor, OurGrid, XtremWeb, etc.) Resources acquired from a Cloud Computing provider (eg. AWS EC2 on-demand instances) Local resources, possibly used in an opportunistic way with a fairly small additional cost BoT user

Research question Uppsala, April 12-16th 2010EGEE 5th User Forum5 Free resources from opportunistic Desktop Grids (eg. Condor, OurGrid, XtremWeb, etc.) Resources acquired from a Cloud Computing provider (eg. AWS EC2 on-demand instances) Local resources, possibly used in an opportunistic way with a fairly small additional cost BoT user Where shall I run my application???

A business-driven approach Running the application will incur costs, except when it is executed on the idle time of the local resources or on the best-effort grid infrastructure Completing the execution of the application by a given time yields utility – These are described by monotonically decreasing utility functions that associate a utility to each different value of the application’s makespan A solution to the problem should maximise the profit, where: Profit = Utility – Cost Uppsala, April 12-16th 2010EGEE 5th User Forum6

Examples of utility functions Uppsala, April 12-16th 20107EGEE 5th User Forum Let t r be the time the application is ready for submission and t d -t r be the largest makespan for which there is some utility to be gained by the execution of the application

A family of heuristics for cloudbursting From time to time, observe the system past behaviour Calculate the system throughput (number of tasks processed per unit of time) Maximise the profit function: – Assuming that the current throughput will be maintained – Considering the system “acceleration” The output of the maximisation procedure is the number of cloud computing instances that should be acquired/released for the next period Uppsala, April 12-16th 2010EGEE 5th User Forum8

Evaluation methodology We have built a discrete-event simulator to evaluate the proposed heuristics – It works with the notion of a turn whose length is equal to the minimal time window for which resources can be acquired from a cloud computing provider (eg. 1 hour for AWS EC2 on-demand instances) – At each turn it decides how many recourses need to be acquired from the cloud provider for the next turns in order to maximise the profit The simulator also performs the cloudburst scheduling with full knowledge about the future, leading to an optimal solution – The profit yield by the optimal solution is used to compute the efficiency of the schedule provided by the heuristics E(h) = P(h)/P o, where E(h) is the efficiency of heuristic h, P(h) is the profit achieved by heuristic h, and P o is the optimal profit for the scenario evaluated Uppsala, April 12-16th 20109EGEE 5th User Forum

Evaluation scenarios Three different heuristics – Conservative, derivative, midpoint derivative Two utility functions – Decay and exponential Three different grid sizes Four machine availability traces AWS EC2 on-demand instances pricing model Three level of task heterogeneity for BoT applications – Homogeneous (10 minutes per task), U[5,15], U(0,20] Uppsala, April 12-16th 2010EGEE 5th User Forum10

Evaluation results Uppsala, April 12-16th EGEE 5th User Forum Efficiency Number of machines in the grid Efficiency Number of machines in the grid Efficiency Number of machines in the grid Efficiency Number of machines in the grid Efficiency Number of machines in the grid Efficiency Number of machines in the grid Decay utility functionExponential utility function

Implementation The best heuristic has been implemented in the OurGrid grid middleware The new user interface allows users to perform cloudbursting using both the AWS EC2 cloud computing provider and private/public cloud providers based on Eucalyptus Uppsala, April 12-16th EGEE 5th User Forum

Implementation

Peers

Implementation Workers

Implementation Broker

Implementation

Cloud Provider Peer Cloud Provider Peer

Implementation

OurGrid Broker – User set up a “Cloud Provider Peer”

Conclusions We have shown that cloudbursting is a feasible approach to speed up the execution of BoT applications Simple heuristics perform very well The software is not yet available in the latest release of OurGrid but can be provided upon requests sent to The use of the system by real users will help us to improve its design Uppsala, April 12-16th EGEE 5th User Forum

Thanks for your attention! I will be glad to answer your questions For more information about this project visit For more information about the OurGrid middelware visit For more information about other projects developed by LSD/UFCG, visit Uppsala, April 12-16th 2010EGEE 5th User Forum26