1 Performance Impact of Resource Provisioning on Workflows Gurmeet Singh, Carl Kesselman and Ewa Deelman Information Science Institute University of Southern.

Slides:



Advertisements
Similar presentations
Energy-efficient Task Scheduling in Heterogeneous Environment 2013/10/25.
Advertisements

Copyright © 2008 SAS Institute Inc. All rights reserved. SAS and all other SAS Institute Inc. product or service names are registered trademarks or trademarks.
Scheduling in Distributed Systems Gurmeet Singh CS 599 Lecture.
Pegasus on the Virtual Grid: A Case Study of Workflow Planning over Captive Resources Yang-Suk Kee, Eun-Kyu Byun, Ewa Deelman, Kran Vahi, Jin-Soo Kim Oracle.
Dynamic Thread Assignment on Heterogeneous Multiprocessor Architectures Pree Thiengburanathum Advanced computer architecture Oct 24,
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.
The ADAMANT Project: Linking Scientific Workflows and Networks “Adaptive Data-Aware Multi-Domain Application Network Topologies” Ilia Baldine, Charles.
A system Performance Model Instructor: Dr. Yanqing Zhang Presented by: Rajapaksage Jayampthi S.
RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor Paul Regnier † George Lima † Ernesto Massa † Greg Levin ‡ Scott Brandt ‡
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.
Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
Workshop on HPC in India Grid Middleware for High Performance Computing Sathish Vadhiyar Grid Applications Research Lab (GARL) Supercomputer Education.
Chapter 6: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 6: CPU Scheduling Basic.
Fault-tolerant Adaptive Divisible Load Scheduling Xuan Lin, Sumanth J. V. Acknowledge: a few slides of DLT are from Thomas Robertazzi ’ s presentation.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling Shanshan Song, Ricky Kwok, and Kai Hwang University of Southern.
An Astronomical Image Mosaic Service for the National Virtual Observatory
1 Efficient Management of Data Center Resources for Massively Multiplayer Online Games V. Nae, A. Iosup, S. Podlipnig, R. Prodan, D. Epema, T. Fahringer,
Euro-Par 2007, Rennes, 29th August 1 The Characteristics and Performance of Groups of Jobs in Grids Alexandru Iosup, Mathieu Jan *, Ozan Sonmez and Dick.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Silberschatz, Galvin, and Gagne  Applied Operating System Concepts Module 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
OPTIMAL SERVER PROVISIONING AND FREQUENCY ADJUSTMENT IN SERVER CLUSTERS Presented by: Xinying Zheng 09/13/ XINYING ZHENG, YU CAI MICHIGAN TECHNOLOGICAL.
 Escalonamento e Migração de Recursos e Balanceamento de carga Carlos Ferrão Lopes nº M6935 Bruno Simões nº M6082 Celina Alexandre nº M6807.
Chapter 7 Scheduling Chien-Chung Shen CIS, UD
Meta Scheduling Sathish Vadhiyar Sources/Credits/Taken from: Papers listed in “References” slide.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Scientific Workflow Scheduling in Computational Grids Report: Wei-Cheng Lee 8th Grid Computing Conference IEEE 2007 – Planning, Reservation,
1 Challenge the future KOALA-C: A Task Allocator for Integrated Multicluster and Multicloud Environments Presenter: Lipu Fei Authors: Lipu Fei, Bogdan.
Stochastic DAG Scheduling using Monte Carlo Approach Heterogeneous Computing Workshop (at IPDPS) 2012 Extended version: Elsevier JPDC (accepted July 2013,
Condor Week 2005Optimizing Workflows on the Grid1 Optimizing workflow execution on the Grid Gaurang Mehta - Based on “Optimizing.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
Combining the strengths of UMIST and The Victoria University of Manchester Adaptive Workflow Processing and Execution in Pegasus Kevin Lee School of Computer.
Job scheduling algorithm based on Berger model in cloud environment Advances in Engineering Software (2011) Baomin Xu,Chunyan Zhao,Enzhao Hua,Bin Hu 2013/1/251.
Pegasus: Running Large-Scale Scientific Workflows on the TeraGrid Ewa Deelman USC Information Sciences Institute
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
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.
Chapter 3 System Performance and Models Introduction A system is the part of the real world under study. Composed of a set of entities interacting.
MROrder: Flexible Job Ordering Optimization for Online MapReduce Workloads School of Computer Engineering Nanyang Technological University 30 th Aug 2013.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 5 CPU Scheduling Slide 1 Chapter 5 CPU Scheduling.
Scheduling MPI Workflow Applications on Computing Grids Juemin Zhang, Waleed Meleis, and David Kaeli Electrical and Computer Engineering Department, Northeastern.
Ensieea Rizwani An energy-efficient management mechanism for large-scale server clusters By: Zhenghua Xue, Dong, Ma, Fan, Mei 1.
A stochastic scheduling algorithm for precedence constrained tasks on Grid Future Generation Computer Systems (2011) Xiaoyong Tang, Kenli Li, Guiping Liao,
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
1 USC Information Sciences InstituteYolanda Gil AAAI-08 Tutorial July 13, 2008 Part IV Workflow Mapping and Execution in Pegasus (Thanks.
2004 Queue Scheduling and Advance Reservations with COSY Junwei Cao Falk Zimmermann C&C Research Laboratories NEC Europe Ltd.
PACMan: Coordinated Memory Caching for Parallel Jobs Ganesh Ananthanarayanan, Ali Ghodsi, Andrew Wang, Dhruba Borthakur, Srikanth Kandula, Scott Shenker,
Resource Allocation and Scheduling for Workflows Gurmeet Singh, Carl Kesselman, Ewa Deelman.
Basic Concepts Maximum CPU utilization obtained with multiprogramming
Chapter 7 Scheduling Chien-Chung Shen CIS/UD
Dynamic Resource Allocation for Shared Data Centers Using Online Measurements By- Abhishek Chandra, Weibo Gong and Prashant Shenoy.
Resource Specification Prediction Model Richard Huang joint work with Henri Casanova and Andrew Chien.
OPERATING SYSTEMS CS 3502 Fall 2017
OpenPBS – Distributed Workload Management System
CPU SCHEDULING.
Application-level Resource Provisioning
Chapter 6: CPU Scheduling
Department of Computer Science University of California, Santa Barbara
CPU Scheduling G.Anuradha
Module 5: CPU Scheduling
3: CPU Scheduling Basic Concepts Scheduling Criteria
Chapter 6: CPU Scheduling
Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00
Overview of Workflows: Why Use Them?
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Presentation transcript:

1 Performance Impact of Resource Provisioning on Workflows Gurmeet Singh, Carl Kesselman and Ewa Deelman Information Science Institute University of Southern California Presented by Nut Taesombut Large-Scale Systems Seminar May 9, 2005

2 Outline Background and Objective Simulation Study Experimental Results Summary & Discussion

3 Background Grid –Resource sharing across multiple domains Workflow application –A collection of tasks with specified dependencies How to map a workflow application onto distributed resources in such a way to minimize its completion time ? T1 T2 T3 T4 T5 T6 T7 Grid Resources Workflow Application Schedule

4 Resource Provisioning Reserve resources for dedicated use by an application for certain timeframe Tradeoff between predictability of workflow performance and waiting time cost –Performance predictability enables efficient resource selection –Need to wait until the provisioned resources become available

5 Objective Study of performance impact of resource provisioning for a workflow application –Two performance metrics –Completion Time: Wait Time + Runtime –Resource Utilization –Three resource provisioning mechanisms –No provisioning –Advance reservation –Dynamic provisioning –Two resource scheduling policies –FIFO (First-in, First-out) –Variant Fair Share

6 Simulation Study Maui simulator –Simulate the running of jobs on the 890-processor cluster with different scheduling policies Workload trace from the TeraGrid facility –2095 jobs on 10-day collection (2/22/05 – 3/3/05) –102 initial running jobs –Record both requested and actual runtimes

7 Workload Characteristics More than half of the jobs requested a runtime between 16 and 24 hours Most of the jobs completed in shorter time than they requested Requested Runtime Actual Runtime

8 Application Workflows Original Montage workflow –Contain tasks in 7 levels (3.1 second average runtime) 12 Clustered workflows (generated from the original) –Produce workflow graphs with different levels of granularity and structures –Group the tasks at each level into a fixed number of clusters clustering parameter = 8 clustering parameter = 2

9 Advance Reservation Reserve resources for an application in the future –Use the Maui simulator to determine the earliest start time –Decide based on the requested runtimes of the running and queued jobs Request selection –Multiple requests can execute the workflow –Use the best request to determine the minimum completion time of the workflow –Decide based on the earliest start time and the metric to optimize

10 Dynamic Provisioning Reserve resources for an application during runtime –Use the Maui simulator to determine the actual start time –Compute based on the actual runtimes of the running and queued jobs Request selection –Use the best request as determined by advance reservation

11 Experimental Results (1): Varied Requests Completion time of various provisioning requests The use of provisioning can reduce the completion time –For FIFO with 84 processors, –65% in advance reservation –82% in dynamic provisioning Dynamic Provisioning vs. Advance Reservation –FIFO: D.P. always outperforms A.R. –Fair Share: D.P. and A.R. performs equally well FIFO Fair Share

12 Experiment Results (2): Varied Workflows Completion time of various workflows with their best request The use of provisioning can reduce the completion time –Large workflows tend to obtain significant reduction FIFO Fair Share

13 Experiment Results (3): Resource Utilization Completion time and resource utilization of various workflows using advance reservation –Consider utilization in optimization metric Resource utilization can be much improved by small increase in the completion time Utilization | FIFO Completion Time | FIFO

14 Experiment Results (4): Resource Utilization Completion time and resource utilization of various workflows using advance reservation –Consider utilization in optimization metric The requests that optimize resource utilization also optimize completion time Utilization | Fair Share Completion Time | Fair Share

15 Summary Study the performance impact of using resource provisioning for a workflow application –Significant reduction in the completion time for both FIFO and Fair Share scheduling policies –Amount of the reduction depends on scales and structures of the workflows –Resource utilization can be improved with small increase in the completion time

16 Discussion Is the proposed model practical for Grid environments? –Assume homogeneous resource capability and scheduling policies –Assume deterministic and known workflow characteristics (e.g., runtime) –Assume support for reservation systems