Benchmarks Prepared By : Arafat El-madhoun Supervised By:eng. Mohammad temraz.

Slides:



Advertisements
Similar presentations
CS1104: Computer Organisation School of Computing National University of Singapore.
Advertisements

A Performance Comparison of DRAM Memory System Optimizations for SMT Processors Zhichun ZhuZhao Zhang ECE Department Univ. Illinois at ChicagoIowa State.
D YNAMIC T HREAD A SSIGNMENT ON H ETEROGENEOUS M ULTIPROCESSOR A RCHITECTURE Hüsnü Şensoy.
Reducing Leakage Power in Peripheral Circuits of L2 Caches Houman Homayoun and Alex Veidenbaum Dept. of Computer Science, UC Irvine {hhomayou,
ECE-C355 Computer Structures Winter 2008 Chapter 04: Understanding Performance Slides are adapted from Professor Mary Jane Irwin (
1 Cost Effective Dynamic Program Slicing Xiangyu Zhang Rajiv Gupta The University of Arizona.
CS590F Software Reliability What is a slice? S: …. = f (v)  Slice of v at S is the set of statements involved in computing v’s value at S. [Mark Weiser,
Creating Computer Programs lesson 27. This lesson includes the following sections: What is a Computer Program? How Programs Solve Problems Two Approaches:
Persistent Code Caching Exploiting Code Reuse Across Executions & Applications † Harvard University ‡ University of Colorado at Boulder § Intel Corporation.
Computer Organization and Architecture (AT70.01) Comp. Sc. and Inf. Mgmt. Asian Institute of Technology Instructor: Dr. Sumanta Guha Slide Sources: Patterson.
University of Michigan Electrical Engineering and Computer Science University of Michigan Electrical Engineering and Computer Science August 20, 2009 Enabling.
Colorado Computer Architecture Research Group Architectural Support for Enhanced SMT Job Scheduling Alex Settle Joshua Kihm Andy Janiszewski Daniel A.
MA5233: Computational Mathematics
CS2214 Recitation Presented By Veejay Sani. Benchmarking SPEC CPU2000 Integer Benchmark Floating Point Benchmark We will only deal with Integer Benchmark.
CPU Performance Evaluation: Cycles Per Instruction (CPI)
CS61C L3 Performance (1) Staley, Fall 2005 © UCB Titleless TA Aaron Staley inst.eecs./~cs61c-tc inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
EECC550 - Shaaban #1 Lec # 3 Spring Computer Performance Evaluation: Cycles Per Instruction (CPI) Most computers run synchronously utilizing.
EECC550 - Shaaban #1 Lec # 3 Winter CPU Performance Evaluation: Cycles Per Instruction (CPI) Most computers run synchronously utilizing.
Computer Performance Evaluation: Cycles Per Instruction (CPI)
1 Instruction Based Memory Distance Analysis and its Application to Optimization Changpeng Fang Steve Carr Soner Önder Zhenlin Wang.
Performance Driven Crosstalk Elimination at Compiler Level TingTing Hwang Department of Computer Science Tsing Hua University, Taiwan.
Performance Comparison of Niagara, Xeon, and Itanium2 Daekyeong Moon
EECC550 - Shaaban #1 Lec # 3 Winter CPU Performance Evaluation: Cycles Per Instruction (CPI) Most computers run synchronously utilizing.
Adaptive Cache Compression for High-Performance Processors Alaa R. Alameldeen and David A.Wood Computer Sciences Department, University of Wisconsin- Madison.
Code Coverage Testing Using Hardware Performance Monitoring Support Alex Shye, Matthew Iyer, Vijay Janapa Reddi and Daniel A. Connors University of Colorado.
Power-Aware Hardware Prefetching Yao Guo. Prefetching Energy Consumption L2 + Memory Access Energy –very minor energy impact. Leakeage Energy –reduced.
INTRODUCTION TO WEB DATABASE PROGRAMMING
Chapter 1 - Fundamentals1 Computer Architecture Chapter 1 Fundamentals Prof. Jerry Breecher CSCI 240 Fall 2001.
Where Has This Performance Improvement Come From? Technology –More transistors per chip –Faster logic Machine Organization/Implementation –Deeper pipelines.
Lecture 2: Benchmarks, Performance Metrics, Cost, Instruction Set Architecture Professor Alvin R. Lebeck Compsci 220 / ECE 252 Fall 2004.
CSE 340 Computer Architecture Summer 2014 Understanding Performance
Are New Languages Necessary for Manycore? David I. August Department of Computer Science Princeton University.
CDA 3101 Fall 2013 Introduction to Computer Organization Benchmarks 30 August 2013.
CS61C L41 Performance II (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
Performance Chapter 4 P&H. Introduction How does one measure report and summarise performance? Complexity of modern systems make it very more difficult.
Energy Savings with DVFS Reduction in CPU power Extra system power.
Electrical and Computer Engineering University of Wisconsin - Madison Prefetching Using a Global History Buffer Kyle J. Nesbit and James E. Smith.
ACMSE’04, ALDepartment of Electrical and Computer Engineering - UAH Execution Characteristics of SPEC CPU2000 Benchmarks: Intel C++ vs. Microsoft VC++
Introduction: Lattice Boltzmann Method for Non-fluid Applications Ye Zhao.
1/23/02CSE Performance II Performance Part 2.
Authors – Jeahyuk huh, Doug Burger, and Stephen W.Keckler Presenter – Sushma Myneni Exploring the Design Space of Future CMPs.
© Vipin Kumar IPDPS-2011, May 18, th Year Panel – WHAT’S AHEAD Vipin Kumar University of Minnesota
Fall 2015, Nov ELEC / Lecture 10 1 ELEC / Computer Architecture and Design Fall 2015 Performance of a Computer (Chapter.
1 Ubiquitous Memory Introspection (UMI) Qin Zhao, NUS Rodric Rabbah, IBM Saman Amarasinghe, MIT Larry Rudolph, MIT Weng-Fai Wong, NUS CGO 2007, March 14.
Lec2.1 Computer Architecture Chapter 2 The Role of Performance.
ECE/CS 552: Benchmarks, Means and Amdahl’s Law © Prof. Mikko Lipasti Lecture notes based in part on slides created by Mark Hill, David Wood, Guri Sohi,
Computer Architecture CSE 3322 Web Site crystal.uta.edu/~jpatters/cse3322 Send to Pramod Kumar, with the names and s.
Optimizing Multipliers for the CPU: A ROM based approach Michael Moeng Jason Wei Electrical Engineering and Computer Science University of California:
Protecting C and C++ programs from current and future code injection attacks Yves Younan, Wouter Joosen and Frank Piessens DistriNet Department of Computer.
Performance COE 301 / ICS 233 Computer Organization Prof. Muhamed Mudawar College of Computer Sciences and Engineering King Fahd University of Petroleum.
BITS Pilani, Pilani Campus Today’s Agenda Role of Performance.
Exploiting Detachability Hashem H. Najaf-abadi Eric Rotenberg.
Variation Aware Application Scheduling in Multi-core Systems Lavanya Subramanian, Aman Kumar Carnegie Mellon University {lsubrama,
Measuring Performance and Benchmarks Instructor: Dr. Mike Turi Department of Computer Science and Computer Engineering Pacific Lutheran University Lecture.
1 Chapter 1 INTRODUCTION TO WEB. 2 Objectives In this chapter, you will: Become familiar with the architecture of the World Wide Web Learn about communication.
Simone Campanoni A research CAT Simone Campanoni
I- Computational Fluid Dynamics (CFD-I)
Raghuraman Balasubramanian Karthikeyan Sankaralingam
Assessing and Understanding Performance
Static Slicing Static slice is the set of statements that COULD influence the value of a variable for ANY input. Construct static dependence graph Control.
ELEC / Computer Architecture and Design Spring 2016 Performance of a Computer (Chapter 4) Vishwani D. Agrawal James J. Danaher Professor.
Zhichun Zhu Zhao Zhang ECE Department ECE Department
There is one handout today at the front and back of the room!
Performance COE 301 Computer Organization
Hongtao Yu Wei Huo ZhaoQing Zhang XiaoBing Feng
Performance ICS 233 Computer Architecture and Assembly Language
COMS 361 Computer Organization
Benchmarks Programs specifically chosen to measure performance
Numerical Investigation of Hydrogen Release from Varying Diameter Exit
Canturk Isci Gilberto Contreras Margaret Martonosi
Presentation transcript:

benchmarks Prepared By : Arafat El-madhoun Supervised By:eng. Mohammad temraz

What is the benchmarks? Is a packet test is downloaded and running on your computer in order to operate on the test performance on the CPU and was originally called Actual They vary in species and uses it works by default on the computer as possible person to see those packets which are tests performed by, but did not see operations That are in the CPU

Why use the benchmarks? Used to work on measuring the performance of your computer and processor performance and was originally called Actual he is working to measure processor and was originally called In terms of how to read the data and how to obtain the data and how to navigate the data and how fast data transfer Is used when improvement of the computer in the performance is Operators packages benchmarks to be measuring the strength and effectiveness of the improvement that has been on the CPU and the transfer of data is used in large companies When measuring the improvement that has been on the CPU and how quickly the transfer of information

How it works benchmarks? Con… Work the work of the benchmarks tested on the CPU and memory By default Which is placed packages of the test on the computer is installed and then after that they operate packets the system default between the processor and was originally called to be those packets are data too large and play in that case to send such data to the processor, memory and expanded most dramatically in order to measure the extent of reception such information and speed of transmission

Con… Con… and speed of processing and accuracy of performance in the transfer of data from and then you eject full report, which is described in which everything and processes that take place could not see but can see the test surface but this test is the shape surface for testing, but could not see the processes that take place in pushing data to the CPU and transfer and was received

Type benchmarks…… Con… Integer Benchmark……. gzip, bzip compression vpr FPGA place & route gcc compiler mcf min cost flow network crafty chess parser natural language perl perl language interpreter vortex object-oriented database system eon C++, ray trace gap computational group theory twolf place & route

type…. Floating Point Benchmark …… wupside chromo dynamics mgrid multigrid solver for 3d field applu partial differential equations mesa 3D graphics galgel fluid dynamics art image recognition aspi meteorology equake wave propagation facerec image processing ammp computational chemistry lucas number theory fma3d finite elements sixtrack nuclear physics

Thanks a lot for all of you, we hope it was beneficial and interesting presentation Best regards Arafat El-mdhoun Arafat El-mdhoun