AN INGENIOUS APPROACH FOR IMPROVING TURNAROUND TIME OF GRID JOBS WITH RESOURCE ASSURANCE AND ALLOCATION MECHANISM Shikha Mehrotra Centre for Development.

Slides:



Advertisements
Similar presentations
Numbers Treasure Hunt Following each question, click on the answer. If correct, the next page will load with a graphic first – these can be used to check.
Advertisements

AGVISE Laboratories %Zone or Grid Samples – Northwood laboratory
AP STUDY SESSION 2.
1
Feichter_DPG-SYKL03_Bild-01. Feichter_DPG-SYKL03_Bild-02.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 4 Computing Platforms.
Processes and Operating Systems
Copyright © 2013 Elsevier Inc. All rights reserved.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 38.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
Objectives: Generate and describe sequences. Vocabulary:
CSF4 Meta-Scheduler Tutorial 1st PRAGMA Institute Zhaohui Ding or
Joint CHAIN/EU-IndiaGrid2 Workshop on e-Infrastructures Interoperation and Interoperability across Europe and the Asia-Pacific Region, 23/3, ISGc2011-OGF31,
Marco Verlato, INFN 23 March, 2011 ISGC2011/OGF31, Taipei,Taiwan Interoperability solutions in India 1.
1 Hyades Command Routing Message flow and data translation.
David Burdett May 11, 2004 Package Binding for WS CDL.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination. Introduction to the Business.
We need a common denominator to add these fractions.
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Local Customization Chapter 2. Local Customization 2-2 Objectives Customization Considerations Types of Data Elements Location for Locally Defined Data.
Process a Customer Chapter 2. Process a Customer 2-2 Objectives Understand what defines a Customer Learn how to check for an existing Customer Learn how.
Custom Statutory Programs Chapter 3. Customary Statutory Programs and Titles 3-2 Objectives Add Local Statutory Programs Create Customer Application For.
CALENDAR.
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt BlendsDigraphsShort.
2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt Time Money AdditionSubtraction.
Addition Facts
Year 6 mental test 15 second questions Calculation Addition.
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
Photo Slideshow Instructions (delete before presenting or this page will show when slideshow loops) 1.Set PowerPoint to work in Outline. View/Normal click.
Break Time Remaining 10:00.
This module: Telling the time
Table 12.1: Cash Flows to a Cash and Carry Trading Strategy.
PP Test Review Sections 6-1 to 6-6
EIS Bridge Tool and Staging Tables September 1, 2009 Instructor: Way Poteat Slide: 1.
Physical Aspects [Reflection Modelling] Hauptseminar: Augmented Reality for Driving Assistance in Cars.
Outline Minimum Spanning Tree Maximal Flow Algorithm LP formulation 1.
Developing the Project Plan
Developing a Project Plan
Operating Systems Operating Systems - Winter 2010 Chapter 3 – Input/Output Vrije Universiteit Amsterdam.
Exarte Bezoek aan de Mediacampus Bachelor in de grafische en digitale media April 2014.
15. Oktober Oktober Oktober 2012.
Sample Service Screenshots Enterprise Cloud Service 11.3.
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
1 RA III - Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Buenos Aires, Argentina, 25 – 27 October 2006 Status of observing programmes in RA.
We are learning how to read the 24 hour clock
1..
Adding Up In Chunks.
MaK_Full ahead loaded 1 Alarm Page Directory (F11)
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt Synthetic.
Addition 1’s to 20.
25 seconds left…...
Subtraction: Adding UP
: 3 00.
5 minutes.
1 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit.
Speak Up for Safety Dr. Susan Strauss Harassment & Bullying Consultant November 9, 2012.
Essential Cell Biology
Converting a Fraction to %
Clock will move after 1 minute
PSSA Preparation.
Physics for Scientists & Engineers, 3rd Edition
Energy Generation in Mitochondria and Chlorplasts
Select a time to count down from the clock above
Murach’s OS/390 and z/OS JCLChapter 16, Slide 1 © 2002, Mike Murach & Associates, Inc.
3 - 1 Copyright McGraw-Hill/Irwin, 2005 Markets Demand Defined Demand Graphed Changes in Demand Supply Defined Supply Graphed Changes in Supply Equilibrium.
1 Decidability continued…. 2 Theorem: For a recursively enumerable language it is undecidable to determine whether is finite Proof: We will reduce the.
Presentation transcript:

AN INGENIOUS APPROACH FOR IMPROVING TURNAROUND TIME OF GRID JOBS WITH RESOURCE ASSURANCE AND ALLOCATION MECHANISM Shikha Mehrotra Centre for Development of Advanced Computing CDAC, Bangalore, India September 20121IEEE HPEC'12

Outline Indian National grid GARUDA Need for Reservation in Grid Approach followed in realizing reservation in Garuda Grid – Architecture – Features Performance analysis – Job flow in Garuda grid – Performance metrics – Turnaround time of grid jobs – Case-study Turn-around time without reservation Turn-around time with reservation Data analysis Results Conclusion September 2012 IEEE HPEC'12 2

Grid Computing Distributed Computing taken to the next level Aggregation of Resources from many participants (geographically distributed in general) – Compute resources – Data resources – Special instruments (Telescopes, microscopes, so on..) Unified, Seamless access to these resources – Analogous to the Power Grid September IEEE HPEC'12

Indias National Grid Computing Initiative: GARUDA September IEEE HPEC'12 Motivation To Collaborate on Research and Engineering of Technologies, Architectures, Standards and Applications in Grid Computing To Contribute to the aggregation of resources in the Grid Production infrastructure with Gigabit networking backbone (NKN) Large HPC computing resources Massive Storage Tools and Services for Unified Access Currently Connects more than 60 institutions Academic & Research labs Spans across 17 cities of India Supports 10 Virtual Organizations Bioinformatics, Seismic engineering, Climate modeling, Drug discovery ….

Problem Statement As the demand for the resources increases more and more, it becomes really difficult to manage the jobs and allocate resources to them and hence most of the jobs will be in the queued state waiting for the resource to be free September 2012 IEEE HPEC'12 5

Our Approach Reduce waiting time Solution : Advance Reservation of resources – An advance reservation is a reservation that a user or administrator can request and the scheduler can create. – It guarantees the availability of resources at specified future time slot September 2012 IEEE HPEC'12 6

Compute Reservation An advance reservation is essentially defined by the following: – Start time which is defined using the standard date-time format – An end time, which is either defined using the standard date-time format or computed from the start time plus a duration value, – Number and type of resource to be reserved September IEEE HPEC'12

Garuda Reservation Architecture RESERVATION REPLICA DB LOCAL RESOURCE MANAGER RESERVATION MANAGER AND SCHEDULER GARUDA LRM RESERVATION COMPONENT GARUDA MIDDLEWARE RESERVATION COMPONENT GLOBUS MIDDLEWARE GRIDWAY META-SCHEDULER GARUDA GRID LEVEL RESERVATION COMPONENT RESERVATION DB FAILOVER API COMMANDS APPLICATIONS

Garuda Reservation Features Advanced and Immediate Reservation of resources across multiple clusters – Ensure resource availability – GSI based reservation: Garuda Reservation – Grid Reservation Failover mechanism: – Application Programming Interface – Intelligent resource allocation based on QoS Parameters – Virtual Organization support – Avoiding resource under utilization – Integration with Gridway Meta-scheduler and Globus Middleware

Performance Analysis September 2012 IEEE HPEC'12 10

Performance Metrics Mean waiting time Execution time Turnaround time September IEEE HPEC'12

Turnaround Time Turnaround time (total time taken between the submission of a program/process/thread/task (Linux) for execution and the return of the complete output to the customer/user) September IEEE HPEC'12 Job Submission Job Output User

Performance Analysis September 2012 IEEE HPEC'12 13

Turn-around time without reservation September IEEE HPEC'12 Job SetWaitingExecutionTurnaround Job Set 10:04:000:17:160:22:02 Job Set 20:06:000:17:270:24:14 Job Set 30:44:000:18:311:02:49 Job Set 41:11:000:17:271:38:42 Job Set 51:20:000:18:261:37:41

Turn-around time without reservation September IEEE HPEC'12

Turn-around time with reservation September IEEE HPEC'12 Job SetWaitingExecution Turnaroun d Job Set 10:00:090:08:030:08:32 Job Set 20:00:090:08:050:08:35 Job Set 30:00:090:08:070:08:37 Job Set 40:00:090:08:050:08:37 Job Set 50:00:080:07:150:07:45

10-12 September 2012 IEEE HPEC'12 17 Turn-around time with reservation

Comparison of Turnaround times September 2012 IEEE HPEC'12 18

Guarantees the availability of resources Eliminates the waiting time Reduces Turnaround time considerably Well integrates into the Grid Middleware Built for the production infrastructure Analysis has shown results that are really encouraging September 2012 IEEE HPEC'12 19 Conclusion

Thank You September 2012 IEEE HPEC'12 20