Where to Optimize? Where do we spend our limited resources looking for issues that will improve performance? www.xtremesoft.com.

Slides:



Advertisements
Similar presentations
Design and Analysis of Algorithms NP-Completeness Haidong Xue Summer 2012, at GSU.
Advertisements

Finger-pointing Meetings? How can we resolve which part of the code is the problem. I hate going to these meetings where all we do is 'finger-point'
Quick Sort, Shell Sort, Counting Sort, Radix Sort AND Bucket Sort
Algorithm Analysis (Big O) CS-341 Dick Steflik. Complexity In examining algorithm efficiency we must understand the idea of complexity –Space complexity.
27-Jun-15 Profiling code, Timing Methods. Optimization Optimization is the process of making a program as fast (or as small) as possible Here’s what the.
Selection Sort
AppMetrics Solutions for QA and Test Professionals Improving performance by giving QA insight into the Applications real operational characteristics
Institute for Personal Robots in Education (IPRE)‏ CSC 170 Computing: Science and Creativity.
Programming Languages: Scratch Intro to Scratch. Lower level versus high level Clearly, lower level languages can be tedious Higher level languages quickly.
AppMetrics Overview & Solutions Improving the performance of your Application, by giving you unique visibility into the core business transactions.
Acceleration & Speed How fast does it go?. Definition of Motion Event that involves a change in the position or location of something.
Design your own Cafe Multiplication, Area, Money.
Memory leak? So where do these leaks appear to be?
AppMetrics Solutions Improving the performance of your Application, by giving you unique visibility into the core of your Application
Speed up the local inhibition Hideaki Suzuki September 5, 2013.
Selection Sort
Acceleration. The rate of change in velocity Acceleration The rate of change in velocity Examples…. –Speeding up Positive acceleration –Slowing down.
Site License Advisory Team May 26, 2010 meeting. Agenda PGP Renewal Microsoft Renewal –Campus Agreement Renewal –ECAL Uplift –Reseller Discussion –Software.
An alternative subtraction algorithm. In order to subtract, the top number must be larger than the bottom number To make the top number.
AppMetrics for.NET Serviced Components Improving the performance of the Application, by giving you unique visibility and insight into the transaction paths.
Where do we start? Top right 4 ones minus 7 ones Can’t do it! Take one ten away Tens place 2 Where do we get more ones? 1 ten + 4 ones = 14 ones.
Project Closeout Report. Closeout Components Project Objective Results Deliverable Results Lessons Learned Summary and Team Feedback Final Project Organization.
Box and Whisker Plots This data shows the scores achieved by fifteen students who took a short maths test. The test was marked out of.
Addition with Regrouping By: Mrs. Whitener How would you solve this problem?
#21. Find the following quantities R T = I T =V 30  = I 50  
Ch. Eick: Randomized Hill Climbing Techniques Randomized Hill Climbing Neighborhood Hill Climbing: Sample p points randomly in the neighborhood of the.
Bubble Sort!. What is a bubble sort?!?!?!?!?!?!?!? In a bubble sorting algorithm, the elements of the list "gradually 'bubble' (or rise) to their proper.
The average velocity of an object during a time interval t is The acceleration, assumed constant, is 2-5 Motion at Constant Acceleration.
Addition and Subtraction 29 Addition and Subtraction Algorithms 2 ones plus 9 ones equal 11 ones. 11 is 1 ten and 1 one. Record the 1 one in the ones column.
SHORTEST ROUTE PROBLEM A Networking Model Report for DPA 702 QUANTITATIVE METHODS OF RESEARCH By: ALONA M. SALVA Cebu Technological University.
Computer Applications in Business
Using GA’s to Solve Problems
QUALITY OF MEASUREMENT
Begin with the end in Mind: Define your goals and mission in life
Fun with Hyperplanes: Perceptrons, SVMs, and Friends
Discrete ABC Based on Similarity for GCP
Top Ten Tips for Screwing-up a Presentation
Intro to Computer Science CS1510 Dr. Sarah Diesburg
And how they make life easier!
How do we control components that are hung?
1.6 – Calculating with Significant Figures
Programming Languages
Writing Functions( ) (Part 5)
Students: Meiling He Advisor: Prof. Brain Armstrong
Growth Functions Algorithms Lecture 8
Speed How fast does it go?.
Comparing Numbers.
Puzzle A Puzzle B.
Using Objects in Alice.
Algorithm An algorithm is a finite set of steps required to solve a problem. An algorithm must have following properties: Input: An algorithm must have.
Tools for making goals a reality
Unit 1 Examinations Top Tips & Final Reminders
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Greedy Methods Knapsack Problem Hoffman Codes
AppMetrics® Benefits “Maximize the availability of your applications built on the Microsoft platform”
CLASSES P AND NP.
Counting
CS200: Algorithms Analysis
Partial products By: Elias and Adam.
Intro to Programming & Algorithm Design
Counting
Place Value.
Regression Testing.
Not guaranteed to find best answer, but run in a reasonable time
Acceleration.
TIPS: Where a box says “insert image here” you will need to go up to “insert” and choose “image” then either search for an image to insert or choose one.
Acceleration.
Comparing Numbers.
Design of Experiments CHM 585 Chapter 15.
Little Man Computer Lesson 3 The times table
Presentation transcript:

Where to Optimize? Where do we spend our limited resources looking for issues that will improve performance? www.xtremesoft.com

Where to Optimize? Problem: I need to know my ‘most expensive’ components. When told the application is too slow and the application has tens, often hundreds of components, where do you start looking for possible candidates for optimization?

Where to Optimize? Solution: AppMetrics’ Top Ten Component Report This report reveals which components are spending the most time running on the machine. The total duration of all component instances of each component type is calculated, and then the component types are sorted by total duration. This view helps you to choose which components are likely performance problems, because this algorithm will, for example rate a component that runs 100 times for an average of 1 second each time higher than a component that only runs 1 time, but for 50 seconds. The second component may need work, but it is less likely to be the cause of the problem.

Where to Optimize? Our Customers say: "Each operation originally was taking 5,420,3 ms. After we adjusted the code (following the tips from AppMetrics and DevPartner); each operation took 781,5 ms. It's an amazing result - the original code was about 700% slower compared to the final one!"