Software Architecture in Practice

Slides:

Advertisements

Similar presentations

CSE431 Chapter 7A.1Irwin, PSU, 2008 CSE 431 Computer Architecture Fall 2008 Chapter 7A: Intro to Multiprocessor Systems Mary Jane Irwin (

Advertisements

Computer Organization Lab 1 Soufiane berouel. Formulas to Remember CPU Time = CPU Clock Cycles x Clock Cycle Time CPU Clock Cycles = Instruction Count.

Computer Abstractions and Technology

Performance Evaluation of Architectures Vittorio Zaccaria.

Comments on The Progress of Computing William Nordhaus Iain Cockburn Boston University and NBER.

Computer Organization and Architecture 18 th March, 2008.

1 Part II Web Performance Modeling: basic concepts © 1998 Menascé & Almeida. All Rights Reserved.

CS CS 5150 Software Engineering Lecture 19 Performance.

Performance D. A. Patterson and J. L. Hennessey, Computer Organization & Design: The Hardware Software Interface, Morgan Kauffman, second edition 1998.

CS 501: Software Engineering Fall 2000 Lecture 19 Performance of Computer Systems.

Lecture 3: A Case for RAID (Part 1) Prof. Shahram Ghandeharizadeh Computer Science Department University of Southern California.

Computer Architecture Lecture 2 Instruction Set Principles.

Chapter 4 Assessing and Understanding Performance

CMSC 611: Advanced Computer Architecture Performance Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted.

Lecture 2: Technology Trends and Performance Evaluation Performance definition, benchmark, summarizing performance, Amdahl’s law, and CPI.

M EAN -V ALUE A NALYSIS Manijeh Keshtgary O VERVIEW Analysis of Open Queueing Networks Mean-Value Analysis 2.

April 26, CSE8380 Parallel and Distributed Processing Presentation Hong Yue Department of Computer Science & Engineering Southern Methodist University.

Scaling Area Under a Curve. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.

Computer Architecture

Browser Wars (Click on the logo to see the performance)

1 Part VII Component-level Performance Models for the Web © 1998 Menascé & Almeida. All Rights Reserved.

Performance Enhancement. Performance Enhancement Calculations: Amdahl's Law The performance enhancement possible due to a given design improvement is.

1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3 Example: The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution.

Internet Applications: Performance Metrics and performance-related concepts E0397 – Lecture 2 10/8/2010.

1 CS 501 Spring 2003 CS 501: Software Engineering Lecture 23 Performance of Computer Systems.

Scaling Conway’s Game of Life. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.

EGRE 426 Computer Organization and Design Chapter 4.

Computer Engineering Rabie A. Ramadan Lecture 2. Table of Contents 2 Architecture Development and Styles Performance Measures Amdahl’s Law.

Parallel IO for Cluster Computing Tran, Van Hoai.

Performance Computer Organization II 1 Computer Science Dept Va Tech January 2009 © McQuain & Ribbens Defining Performance Which airplane has.

Performance. Moore's Law Moore's Law Related Curves.

Software Architecture in Practice Theoretical Models for Performance.

Lecture 2: Performance Evaluation

Department of Computer Science University of Calgary

September 2 Performance Read 3.1 through 3.4 for Tuesday

Defining Performance Which airplane has the best performance?

User working in web-browser

Queuing Theory Queuing Theory.

Introduction to Parallelism.

Department of Computer Science University of Calgary

Chapter 1 Fundamentals of Computer Design

Chapter 6: CPU Scheduling

B.Ramamurthy Appendix A

Defining Performance Section /14/2018 9:52 PM.

Module 5: CPU Scheduling

CMSC 611: Advanced Computer Architecture

3: CPU Scheduling Basic Concepts Scheduling Criteria

Chapter5: CPU Scheduling

CSE8380 Parallel and Distributed Processing Presentation

Chapter 6: CPU Scheduling

Chapter 5: CPU Scheduling

Lecture 2 Part 3 CPU Scheduling

Single server model Queue Server I/O Controller And device Arrivals.

Performance Cycle time of a computer CPU speed speed = 1 / cycle time

Queuing Analysis.

Propagation & Transmission delay

CMSC 611: Advanced Computer Architecture

Chapter 6: CPU Scheduling

Performance Models And Evaluation

The University of Adelaide, School of Computer Science

ODV beta Multiple views, new views bar

CS 704 Advanced Computer Architecture

Module 5: CPU Scheduling

Chapter 6: CPU Scheduling

Performance Measurement and Analysis

Module 5: CPU Scheduling

Computer Organization and Design Chapter 4

Presentation transcript:

Software Architecture in Practice Theoretical Exercise in Performance Engineering

Exercise 1a: Response Time Calculation Web Browser What is the end-user response time? Assume: Network latency (transmission time overhead) is 500ms User transaction arrival rate is fixed and exponentially distributed across the user community Ignore processing time of browser Hints: Network: Use the utilization law Server: Use graphs of service time under increasing load for server response time OR calculate using formula for response time Web Browser (per user) 150 users 12 txn per min Amount of data sent over network 1 Mbps per user 20 KB Internet 100 KB Web Server 0.03 s service time uni-processor system

Exercise 1b: Amdahl’s Law Suppose that we are considering an enhancement to the processor of a server system used for Web serving. The new CPU is 10 times faster on computation in the Web serving application than the original processor. Assuming that the original CPU is busy with computation 40% of the time and is waiting for I/O 60% of the time, what is the overall speedup gained by incorporating the enhancement?

Group work