Ana-Maria Oprescu, Thilo Kielmann (Vrije University) Presented By Gal Cohen Cloud Computing Seminar CS Technion, Spring 2012.

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

Energy-efficient Task Scheduling in Heterogeneous Environment 2013/10/25.
Bag-of-Tasks Scheduling under Budget Constraints Ana-Maria Oprescu, Thilo Kielman Presented by Bryan Rosander.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.
Scheduling Algorithms
Adaptive Scheduling with QoS Satisfaction in Hybrid Cloud Environment 研究生:李羿慷 指導老師:張玉山 老師.
Ceng Operating Systems Chapter 2.2 : Process Scheduling Process concept  Process scheduling Interprocess communication Deadlocks Threads.
WELCOME TO THETOPPERSWAY.COM
Host Load Trace Replay Peter A. Dinda Thesis Seminar 11/23/98.
Operating Systems 1 K. Salah Module 2.1: CPU Scheduling Scheduling Types Scheduling Criteria Scheduling Algorithms Performance Evaluation.
CS 3013 & CS 502 Summer 2006 Scheduling1 The art and science of allocating the CPU and other resources to processes.
1 Thursday, June 15, 2006 Confucius says: He who play in root, eventually kill tree.
Copyright © 1998 Wanda Kunkle Computer Organization 1 Chapter 2.1 Introduction.
Chapter 11 Operating Systems
5: CPU-Scheduling1 Jerry Breecher OPERATING SYSTEMS SCHEDULING.
Wk 2 – Scheduling 1 CS502 Spring 2006 Scheduling The art and science of allocating the CPU and other resources to processes.
Iterative Flattening in Cumulative Scheduling. Cumulative Scheduling Problem Set of Jobs Each job consists of a sequence of activities Each activity has.
1Chapter 05, Fall 2008 CPU Scheduling The CPU scheduler (sometimes called the dispatcher or short-term scheduler): Selects a process from the ready queue.
Chapter 3 Operating Systems Introduction to CS 1 st Semester, 2015 Sanghyun Park.
Computer Architecture and Operating Systems CS 3230: Operating System Section Lecture OS-3 CPU Scheduling Department of Computer Science and Software Engineering.
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill Technology Education Lecture 5 Operating Systems.
OPERATING SYSTEMS CPU SCHEDULING.  Introduction to CPU scheduling Introduction to CPU scheduling  Dispatcher Dispatcher  Terms used in CPU scheduling.
COT 4600 Operating Systems Spring 2011 Dan C. Marinescu Office: HEC 304 Office hours: Tu-Th 5:00-6:00 PM.
ROBUST RESOURCE ALLOCATION OF DAGS IN A HETEROGENEOUS MULTI-CORE SYSTEM Luis Diego Briceño, Jay Smith, H. J. Siegel, Anthony A. Maciejewski, Paul Maxwell,
Cloud Resource Scheduling for Online and Batch Applications Kick-off meeting.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Scheduling policies for real- time embedded systems.
CPU Scheduling Gursharan Singh Tatla 1-Feb-20111www.eazynotes.com.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
Course Title: “Operating System” Chapter No: 04 “Process Scheduling” Course Instructor: ILTAF MEHDI IT Lecturer, MIHE, Kart-i Parwan, Kabul.
Lecture 7: Scheduling preemptive/non-preemptive scheduler CPU bursts
Operating System Principles And Multitasking
Operating Systems 1 K. Salah Module 2.2: CPU Scheduling Scheduling Types Scheduling Criteria Scheduling Algorithms Performance Evaluation.
1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.
Network-Aware Scheduling for Data-Parallel Jobs: Plan When You Can
CS Spring 2009 CS 414 – Multimedia Systems Design Lecture 31 – Process Management (Part 1) Klara Nahrstedt Spring 2009.
Week 3: CPU Scheduling CS 162. Today’s Section Administrivia (2 min) Quiz (5 min) Review lecture 8 (10 min) Worksheet and Discussion (33 min)
1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
Lecture 4 Page 1 CS 111 Summer 2013 Scheduling CS 111 Operating Systems Peter Reiher.
Lecture 4 CPU scheduling. Basic Concepts Single Process  one process at a time Maximum CPU utilization obtained with multiprogramming CPU idle :waiting.
Lecture 12 Scheduling Models for Computer Networks Dr. Adil Yousif.
CPU scheduling.  Single Process  one process at a time  Maximum CPU utilization obtained with multiprogramming  CPU idle :waiting time is wasted 2.
1 Module 5: Scheduling CPU Scheduling Scheduling Algorithms Reading: Chapter
Basic Concepts Maximum CPU utilization obtained with multiprogramming
1 Chapter 5: CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms.
Real-Time Operating Systems RTOS For Embedded systems.
Applied Operating System Concepts
Dan C. Marinescu Office: HEC 439 B. Office hours: M, Wd 3 – 4:30 PM.
Operating Systems (CS 340 D)
Chapter 2.2 : Process Scheduling
CPU scheduling 6. Schedulers, CPU Scheduling 6.1. Schedulers
Operating Systems (CS 340 D)
Chapter 6: CPU Scheduling
CSCI1600: Embedded and Real Time Software
ICS 143 Principles of Operating Systems
CPU Scheduling G.Anuradha
Module 5: CPU Scheduling
COT 4600 Operating Systems Spring 2011
3: CPU Scheduling Basic Concepts Scheduling Criteria
Chapter5: CPU Scheduling
COT 4600 Operating Systems Spring 2011
Chapter 6: CPU Scheduling
CPU SCHEDULING.
CGS 3763 Operating Systems Concepts Spring 2013
Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Chapter 6: CPU Scheduling
CSCI1600: Embedded and Real Time Software
Module 5: CPU Scheduling
Presentation transcript:

Ana-Maria Oprescu, Thilo Kielmann (Vrije University) Presented By Gal Cohen Cloud Computing Seminar CS Technion, Spring 2012

 High throughput computing jobs  No interactive deadline  Tasks are independent of each other  All tasks are ready for execution  Unknown runtimes  Execution Model: ◦ Allocate resources (e.g. machines) ◦ Run each task (once) from the bag on some machine 2

 Unknown runtime distribution  However, some distribution exists  The total number of jobs is also known  Tasks can be aborted 3

 There are many Cloud providers. (EC2, Azure, Rackspace, 3Tera)  Many types of machines even in the same provider, for a different price. ◦ CPU count and speed ◦ Memory size  Upper limit on the number of machines assignable from a provider (self imposed)  A machine is charged per ATU (Hour) 4

 The Goal ◦ Run all the tasks from a given bag on cloud computers, meeting a limited budget ◦ Minimize the makespan of the whole bag (without exceeding the budget constraint)  Assumption ◦ Running each task on a machine separately (FIFO) 5

 The scheduler (BaTS) runs outside of the cloud (for free)  The scheduler gets the Bag Of Tasks  It allocates machines from each cloud  Dispatch jobs to the allocated machines  Receives feedback on tasks completion 6

7

8

9 Error Level Typical Values: 0.10,0.15,0.20,0.25

10 Required sample size (n) Bag Of Tasks Size (N)

11

12

13

14 ATU cost for machine of type i

15

16

17

18

19

20

 Thus, BaTS continuously tries to avoid budget violations  Theoretically, It’s easy. As the execution continues, the bag is smaller and the budget is smaller.  The trouble is estimating the size of the bag at a given moment. (some machines will finish their current job before ATU ends) 21

22

23

24

25

26

27

28

 “Machine speed” in each “cloud” was simulated according to 5 scenarios: 29 Profitability C2 w.r.t C1 Cloud 2 CostSpeed 1/441 3/ /

In each scenario, comparing RR to BaTS  RR always uses machines  BaTS initial configuration is machines and ◦ Budget B = the cost of running RR for that scenario ◦ Budget B = the cost of running only on the most “profitable” machine type. (computed offline) 30

31

32

33

 BaTS helps choosing the cloud resources suitable for an application  BaTS helps scheduling within budget while still performing reasonably well 34

 Limitations ◦ The provided tests “cheat” because the number of machines is very small ◦ The “Tail phase” is not handled well (The “faster” machines will be released before the “slow” ones) ◦ Guessing a proper budget ◦ Actual Bags on actual clouds ◦ What about data transfer costs? ◦ Storage constraints? ◦ Other metric – maximize the profitability (or minimize the budget) while not exceeding a given makespan 35