Performance evaluation on grid Zsolt Németh MTA SZTAKI Computer and Automation Research Institute.

Slides:



Advertisements
Similar presentations
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Advertisements

MINJAE HWANG THAWAN KOOBURAT CS758 CLASS PROJECT FALL 2009 Extending Task-based Programming Model beyond Shared-memory Systems.
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Computer Abstractions and Technology
Clouds C. Vuerli Contributed by Zsolt Nemeth. As it started.
OASIS Reference Model for Service Oriented Architecture 1.0
Grid performance, grid benchmarks, grid metrics Zsolt Németh MTA SZTAKI Computer and Automation Research Institute
Introduction To System Analysis and Design
GridFlow: Workflow Management for Grid Computing Kavita Shinde.
A Grid Resource Broker Supporting Advance Reservations and Benchmark- Based Resource Selection Erik Elmroth and Johan Tordsson Reporter : S.Y.Chen.
1 COMP 206: Computer Architecture and Implementation Montek Singh Mon., Sep 5, 2005 Lecture 2.
Introduction and Overview “the grid” – a proposed distributed computing infrastructure for advanced science and engineering. Purpose: grid concept is motivated.
Presenter : Shih-Tung Huang Tsung-Cheng Lin Kuan-Fu Kuo 2015/6/15 EICE team Model-Level Debugging of Embedded Real-Time Systems Wolfgang Haberl, Markus.
Software Requirements
Bandwidth Allocation in a Self-Managing Multimedia File Server Vijay Sundaram and Prashant Shenoy Department of Computer Science University of Massachusetts.
What is adaptive web technology?  There is an increasingly large demand for software systems which are able to operate effectively in dynamic environments.
Cmpt-225 Simulation. Application: Simulation Simulation  A technique for modeling the behavior of both natural and human-made systems  Goal Generate.
Prepared by Abzamiyeva Laura Candidate of the department of KKGU named after Al-Farabi Kizilorda, Kazakstan 2012.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Research on cloud computing application in the peer-to-peer based video-on-demand systems Speaker : 吳靖緯 MA0G rd International Workshop.
Cloud MapReduce : a MapReduce Implementation on top of a Cloud Operating System Speaker : 童耀民 MA1G Authors: Huan Liu, Dan Orban Accenture.
Chapter 1 Introduction to Simulation
Chapter 8 Architecture Analysis. 8 – Architecture Analysis 8.1 Analysis Techniques 8.2 Quantitative Analysis  Performance Views  Performance.
Chapter 3: Operating-System Structures System Components Operating System Services System Calls System Programs System Structure Virtual Machines System.
Chapter 6 : Software Metrics
Active Monitoring in GRID environments using Mobile Agent technology Orazio Tomarchio Andrea Calvagna Dipartimento di Ingegneria Informatica e delle Telecomunicazioni.
Computer and Automation Research Institute Hungarian Academy of Sciences Presentation and Analysis of Grid Performance Data Norbert Podhorszki and Peter.
A Metadata Based Approach For Supporting Subsetting Queries Over Parallel HDF5 Datasets Vignesh Santhanagopalan Graduate Student Department Of CSE.
Processes and OS basics. RHS – SOC 2 OS Basics An Operating System (OS) is essentially an abstraction of a computer As a user or programmer, I do not.
Scalable Web Server on Heterogeneous Cluster CHEN Ge.
المحاضرة الاولى Operating Systems. The general objectives of this decision explain the concepts and the importance of operating systems and development.
Grid Technologies  Slide text. What is Grid?  The World Wide Web provides seamless access to information that is stored in many millions of different.
Distributed Computing with Turing Machine. Turing machine  Turing machines are an abstract model of computation. They provide a precise, formal definition.
COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL Presented by 2006/8.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
May PEM status report. O.Bärring 1 PEM status report Large-Scale Cluster Computing Workshop FNAL, May Olof Bärring, CERN.
Issues in (Financial) High Performance Computing John Darlington Director Imperial College Internet Centre Fast Financial Algorithms and Computing 4th.
Ground Truth Free Evaluation of Segment Based Maps Rolf Lakaemper Temple University, Philadelphia,PA,USA.
Algorithms & Flowchart
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.
Nanco: a large HPC cluster for RBNI (Russell Berrie Nanotechnology Institute) Anne Weill – Zrahia Technion,Computer Center October 2008.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
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.
Data Structures and Algorithms Dr. Tehseen Zia Assistant Professor Dept. Computer Science and IT University of Sargodha Lecture 1.
Architecture View Models A model is a complete, simplified description of a system from a particular perspective or viewpoint. There is no single view.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Globus and PlanetLab Resource Management Solutions Compared M. Ripeanu, M. Bowman, J. Chase, I. Foster, M. Milenkovic Presented by Dionysis Logothetis.
Big traffic data processing framework for intelligent monitoring and recording systems 學生 : 賴弘偉 教授 : 許毅然 作者 : Yingjie Xia a, JinlongChen a,b,n, XindaiLu.
A N I N - MEMORY F RAMEWORK FOR E XTENDED M AP R EDUCE 2011 Third IEEE International Conference on Coud Computing Technology and Science.
1 Presentation Methodology Summary B. Golden. 2 Introduction Why use visualizations?  To facilitate user comprehension  To convey complexity and intricacy.
Grid performance analysis Directions, issues and open problems Zsolt Németh MTA SZTAKI Computer and Automation Research Institute.
CSC 480 Software Engineering Lecture 17 Nov 4, 2002.
Software Engineering, COMP201 Slide 1 Software Requirements BY M D ACHARYA Dept of Computer Science.
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
Use of Performance Prediction Techniques for Grid Management Junwei Cao University of Warwick April 2002.
Application architectures Advisor : Dr. Moneer Al_Mekhlafi By : Ahmed AbdAllah Al_Homaidi.
INTRODUCTION TO GRID & CLOUD COMPUTING U. Jhashuva 1 Asst. Professor Dept. of CSE.
1 Performance Impact of Resource Provisioning on Workflows Gurmeet Singh, Carl Kesselman and Ewa Deelman Information Science Institute University of Southern.
1 Software Requirements Descriptions and specifications of a system.
Distributed Systems Architectures Chapter 12. Objectives  To explain the advantages and disadvantages of different distributed systems architectures.
OPERATING SYSTEMS CS 3502 Fall 2017
Lecture 2: Performance Evaluation
Definition CASE tools are software systems that are intended to provide automated support for routine activities in the software process such as editing.
Applying Control Theory to Stream Processing Systems
Grid Computing.
CSC 480 Software Engineering
Abstract Machine Layer Research in VGrADS
BASICS OF SOFTWARE TESTING Chapter 1. Topics to be covered 1. Humans and errors, 2. Testing and Debugging, 3. Software Quality- Correctness Reliability.
Storage Virtualization
A Simulator to Study Virtual Memory Manager Behavior
Presentation transcript:

Performance evaluation on grid Zsolt Németh MTA SZTAKI Computer and Automation Research Institute

Outline ● What is the grid? ● What is grid performance? ● Problems of performance evaluation ● WP3 ongoing work and further plans ● A proposed 'passive' benchmarking ● Proposed grid metrics ● Future directions

Distributed applications ● Process control? ● Security? ● Naming? ● Communication? ● Input / output? ● File access? Application: Cooperative processes Physical layer: Computational nodes

Distributed applications Application: Cooperative processes Physical layer: Computational nodes Virtual machine: ● Process control  ● Security  ● Naming  ● Communication  ● Input / output  ● File access 

● Distributed resources are virtually unified by a software layer ● A virtual machine is introduced between the application and the physical layer ● Provides a single system image to the application ● Types ● “Conventional” (PVM, some implementations of MPI) ● Grid (Globus, Legion) Conventional distributed environments and grids

Conventional environments Physical level Set of nodes (node=collection of resources) Login access Static Virtual machine Constructed on a priori information Processes Have resource requests Mapping Processes are mapped onto nodes Resource assignment is implicit

Grid Physical layer Virtual machine Resources are assigned to processes Consists of the selected resources Processes Have resource requirements Mapping Assign nodes to resources? Set of resources Shared Dynamic

Grid: the resource abstraction Physical layer Processes Have resource needs Resource abstraction Explicit mapping between virtual and physical resources Cannot be solved at user/application level

Grid: the user abstraction Physical layer Local, physical users (user accounts) Processes Belong to a user User of the virtual machine is authorised to use the constituting resources Have no login access to the node the resource belongs to User abstraction User of the virtual machine is temporarily mapped onto some local accounts Cannot be solved at user/application level

Fundamental grid functionalities ● By formal modeling the essential functionalities can be identified ● Resource abstraction ● Physical resources can be assigned to virtual resource needs (matched by properties) ● Grid provides a mapping between virtual and physical resources ● User abstraction ● User of the physical machine may be different from the user of the virtual machine ● Grid provides a temporal mapping between virtual and physical users

Conventional distributed environments and grids Smith 4 nodes Smith 4 CPU, memory, storage Smith 1 CPU

What is grid performance at all? ● Traditionally ‘performance’ is ● Speed ● Throughput ● Bandwidth, etc. ● Using grids ● Quantitative reasons ● Qualitative reasons – QoS ● Economic aspects

Grid performance analysis 1. Performance is not characterisitic to an application itself rather to the interaction of the application and the infrastructure. 2. The more complex and dynamic nature of a grid introduces more possible performance flaws. 3. Usual metrics and characteristic parameters are not necessarily applicable for grids. 4. The larger event data volume needs careful reduction, feature extraction and intelligent presentation. 5. Due to the permanently changing environment, on-line and semi on- line techniques are advantageous over post mortem methods. 6. Performance tuning is more difficult due to dynamic environment and changing infrastructure. 7. Observation, comparison and analysis is more complex due to the diversity and heterogeneity of resources.

Interaction of application and the infrastructure ● Performance = application perf.  infrastructure perf. ● Signature model (Pablo group) ● Application signature ● e.g. instructions/FLOPs ● Scaling factor (capabilities of the resources) ● e.g. FLOPs/seconds ● Execution signature: ● application signature * scaling factor ● E.g. instructions/second = instructions/FLOPS * FLOPs/seconds

Possible performance problems in grids ● All that may occur in a distributed application ● Plus ● Effectiveness of resource brokering ● Synchronous availability of resources ● Resources may change during execution ● Various local policies ● Shared use of resources ● Higher costs of some activities ● The corresponding symptoms must be characterised

Grid performance metrics ● Abstract representation of measurable quantities ● M=R 1 xR 2 x...R n ● Usual metrics ● Speedup, efficiency ● Queue length ● Such strict values are not characteristic in grid ● Cannot be interpreted ● Cannot be compared ● New metrics ● Local metrics and grid metrics ● Symbolic description / metrics

Processing monitoring information ● Trace data reduction ● Proportional to time t, processes P, metrics dimension n ● Statistical clustering (reducing P) ● Similar temporal behaviours are classified ● Questionnable if works for grids ● Representative processes are recorded for each class ● Statistical projection pursuit (reducing n) ● reduces the dimension by identifying significant metrics ● Sampling frequency (reducing t)

Performance tuning, optimisation ● The execution cannot be reproduced ● Post-mortem optimisation is not viable ● On-line steering is necessary though, hard to realise ● Sensors and actuators ● Application and implementation dependent ● E.g Autopilot, Falcon ● Average behaviour of applications can be improved ● Post-mortem tuning of the infrastructure (if possible) ● Brokering decisions ● Supporting services

Running benchmarks ● Benchmarks are executed on a virtual machine

Running benchmarks ● Benchmarks are executed on a virtual machine ● The virtual machine may change (composed of different resources) from run to run

Running benchmarks ● Benchmarks are executed on a virtual machine ● The virtual machine may change (composed of different resources) from run to run ● Benchmark result is representative to one certain virtual machine

Running benchmarks ● Benchmarks are executed on a virtual machine ● The virtual machine may change (composed of different resources) from run to run ● Benchmark result is representative to one certain virtual machine ● What can it show about the entire grid?

Benchmarking inside out ● Conventional benchmarking has a top-down view ● Assumes an unchanging infrastructure ● Cannot look behind the virtual level ● Not necessarily applicable to grids ● To look behind the virtual level a bottom-up view is necessary

Benchmarking inside out 1.There is a well defined set of benchmarks (e.g. NPB, Parkbench, etc.) 2.System administrators (resource owners) run them from time to time 3.Results are stored in a local database together with actual system parameters (CPU load, active users, etc.) 4.When a new virtual machine is formed, based on the current system parameters, a benchmark result can be estimated

Benchmarking inside out ● A more or less precise performance figure can be obtained prior to executing an application ● Does not consume resources ● Performance is related to the virtual machine actually formed for executing the application

Ongoing work ● Exploring the statistical properties of benchmarks and system parameters ● Exploring the way how benchmark results can be estimated from past measurements ● Finding a right set of benchmarks

Proposed grid metrics ● A well defined set of benchmarks can serve as metrics ● Multi-dimensional ● Comparable ● Interpretable ● Local resource metrics are transformed into global grid metrics

Proposed grid metrics ● Applications show statistical similarities to benchmarks ● Based on these similarity its signature can be created ● Application signature and resource signature can yield performance metrics ● Symbolic processing is advantageous