Quantitative Analysis Modern Processor Design: Fundamentals of Superscalar Processors

Total Page:16

File Type:pdf, Size:1020Kb

Quantitative Analysis Modern Processor Design: Fundamentals of Superscalar Processors Chapter 1: Quantitative Analysis Modern Processor Design: Fundamentals of Superscalar Processors Mark Heinrich School of Computer Science University of Central Florida Define and quantify power ( 1 / 2) • For CMOS chips, traditional dominant energy consumption has been in switching transistors, called dynamic power 2 Powerdynamic = 1/ 2 × CapacitiveLoad ×Voltage × FrequencySwitched • For mobile devices, energy better metric 2 Energydynamic = CapacitiveLoad ×Voltage • For a fixed task, slowing clock rate (frequency switched) reduces power, but not energy • Capacitive load is a function of number of transistors connected to output and technology, which determines capacitance of wires and transistors • Dropping voltage helps both, so went from 5V to 1V • To save energy & dynamic power, most CPUs now turn off clock of inactive modules (e.g. Fl. Pt. Unit) 2 Example of quantifying power • Suppose 15% reduction in voltage results in a 15% reduction in frequency. What is impact on dynamic power? 2 Powerdynamic =1/ 2 × CapacitiveLoad ×Voltage × FrequencySwitched 2 =1/ 2 × .85 × CapacitiveLoad × (.85×Voltage) × FrequencySwitched 3 = (.85) × OldPowerdynamic ≈ 0.6 × OldPowerdynamic • Because turning down the voltage and performance are linear but voltage and power are cubic, be careful statements like I saved x% in power with ONLY a y% performance decrease!!! USE BETTER METRICS 3 Define and quantify power (2 / 2) • Because leakage current flows even when a transistor is off, now static power important too Powerstatic = Currentstatic ×Voltage • Leakage current increases in processors with smaller transistor sizes and is a function of VT • Increasing the number of transistors increases power even if they are turned off • In 2006, goal for leakage was 25% of total power consumption; high performance designs at 40% • Very low power systems even gate voltage to inactive modules to control loss due to leakage (voltage gating) 4 Define and quantify dependability (1/3) • How to decide when a system is operating properly? • Infrastructure providers now offer Service Level Agreements (SLA) to guarantee that their networking or power service would be dependable • Systems alternate between 2 states of service with respect to an SLA: 1. Service accomplishment, where the service is delivered as specified in SLA 2. Service interruption, where the delivered service is different from the SLA • Failure = transition from state 1 to state 2 • Restoration = transition from state 2 to state 1 5 Define and quantify dependability (2/3) • Module reliability = measure of continuous service accomplishment (or time to failure). 2 metrics 1. Mean Time To Failure (MTTF) measures Reliability 2. Failures In Time (FIT) = 1/MTTF, the rate of failures • Traditionally reported as failures per billion hours of operation • Mean Time To Repair (MTTR) measures Service Interruption – Mean Time Between Failures (MTBF) = MTTF+MTTR • Module availability measures service as alternate between the 2 states of accomplishment and interruption (number between 0 and 1, e.g. 0.9) • Module availability = MTTF / ( MTTF + MTTR) 6 Example calculating reliability • If modules have exponentially distributed lifetimes (age of module does not affect probability of failure), overall failure rate is the sum of failure rates of the modules • Calculate FIT and MTTF for 10 disks (1M hour MTTF per disk), 1 disk controller (0.5M hour MTTF), and 1 power supply (0.2M hour MTTF): FailureRate =10 ×(1/1,000,000) +1/ 500,000 +1/ 200,000 =10 + 2 + 5/1,000,000 =17 /1,000,000 =17,000FIT MTTF=1,000,000,000 /17,000 ≈ 59,000hours 7 Outline • Time and performance • Iron Law • MIPS and MFLOPS • Benchmarks • How to average • How to evaluate speedups 8 Defining Performance • What is important to whom? • Computer system user – Minimize elapsed time for program = time_end – time_start – Called response time • Computer center manager – Maximize completion rate = #jobs/second – Called throughput 9 Response Time vs. Throughput • Is throughput = 1/av. response time? – Only if NO overlap – Otherwise, throughput > 1/av. response time – E.g., two processes with response time Ns running on a single processor. – If no overlap, throughput = 1/N (jobs per second) – If context switch for exception handling such as page fault, throughput > 1/N (jobs per second) – Or two processes with response time Ns running on two processors. – Throughput = 2/N (jobs per second) 10 What is Performance for us? • For computer architects – CPU time = time spent running a program • Intuitively, bigger should be faster, so: – Performance = 1/X time, where X is response, CPU execution, etc. • Elapsed time = CPU time + I/O wait • We mostly concentrate on CPU time 11 Performance Comparison • Machine A is n times faster than machine B iff perf(A)/ perf(B) = time(B)/time(A) = n • Machine A is x% faster than machine B iff – perf(A)/perf(B) = time(B)/time(A) = 1 + x/100 • E.g. time(A) = 10s, time(B) = 15s – 15/10 = 1.5 => A is 1.5 times faster than B – 15/10 = 1.5 => A is 50% faster than B • Tip: don’t use % when > 100%, people get dopey • Another tip: Know when to properly use “fewer” versus “less”. The rule in English is simple and unwavering. If you can count them, use FEWER. – Machine A does NOT have less cache misses than B but it may have fewer… 12 Breaking Down Performance • A program is broken into instructions – H/W is aware of instructions, not programs • At lower level, H/W breaks instructions into cycles – Lower-level state machines change state every cycle • For example: – 1 GHz clock rate == 1 ns clock cycle time – 500MHz P-III runs 500M cycles/sec, 1 cycle = 2ns – 2GHz P-IV runs 2G cycles/sec, 1 cycle = 0.5ns 13 Iron Law Time 1/Processor Performance = --------------- Program The image cannot be displayed. Your computer may not have enough memory to The image cannot be displayed. Your computer may not have enough The image cannot be displayed. Your computer may not have open the image, or the image may have been corrupted. Restart your computer, memory to open the image, or the image may have been corrupted. Restart enough memory to open the image, or the image may have and then open the file again. If the red x still appears, you may have to delete the your computer, and then open the file again. If the red x still appears, you been corrupted. Restart your computer, and then open the image and then insert it again. may have to delete the image and then insert it again. file again. If the red x still appears, you may have to delete Instructions Cycles the imageTime and then insert it again. = X X Program Instruction Cycle (code size: IC) (CPI) (cycle time: CT) Architecture --> Implementation --> Realization Compiler Designer Processor Designer Chip Designer 14 Iron Law • IC – Instructions executed, not static code size – Determined by algorithm, compiler, ISA • CPI – Determined by ISA and CPU organization – Overlap among instructions reduces this term – Typically, must be measured – Today, we talk about IPC not CPI! • CT – Determined by technology, organization, clever circuit design 15 Our Goal • Minimize time which is the product, NOT isolated terms • Common error to miss terms while devising optimizations – E.g. ISA change to decrease instruction count – BUT leads to CPU organization which makes clock slower • Bottom line: terms are inter-related 16 Iron Law Example • Machine A: clock 1ns, CPI 2.0, for program x • Machine B: clock 2ns, CPI 1.2, for program x • Which is faster and how much? Time/Program = instr/program x cycles/instr x sec/cycle Time(A) = N x 2.0 x 1 = 2N Time(B) = N x 1.2 x 2 = 2.4N Compare: Time(B)/Time(A) = 2.4N/2N = 1.2 • So, Machine A is 20% faster than Machine B for this program 17 Iron Law Example Keep clock(A) @ 1ns and clock(B) @2ns For equal performance, if CPI(B)=1.2, what is CPI(A)? Time(B)/Time(A) = 1 = (Nx2x1.2)/(Nx1xCPI(A)) CPI(A) = 2.4 18 Iron Law Example • Keep CPI(A)=2.0 and CPI(B)=1.2 • For equal performance, if clock(B)=2ns, what is clock(B)? Time(B)/Time(A) = 1 = (N x 2.0 x clock(A))/(N x 1.2 x 2) clock(A) = 1.2ns 19 Another Example OP Freq Cycles ALU 43% 1 Load 21% 1 Store 12% 2 Branch 24% 2 • Assume stores can execute in 1 cycle by slowing clock 15% • Should this be implemented? 20 Another Example OP Freq Cycles ALU 43% 1 Load 21% 1 Store 12% 2 Branch 24% 2 • Old CPI = 0.43 + 0.21 + 0.12 x 2 + 0.24 x 2 = 1.36 • New CPI = 0.43 + 0.21 + 0.12 + 0.24 x 2 = 1.24 • Speedup = old time/new time – = {P x old CPI x T}/{P x new CPI x 1.15 T} – = (1.36)/(1.24 x 1.15) = 0.95 • Answer: Don’t make the change 21 Yet Another Example • CPI of ideal machine is 1.0 – make this assumption unless otherwise specified • May need to renormalize mix if IC changes CPU A: 20% compares, 20% branches, CPIbranch=2 CPU B: compare&branch, CPIc&b=2, 25% slower clock, CPIother=1 What is the frequency of c&b in CPU B? ICB=0.8 ICA (no compares); 0.2/0.8 = 25% c&b Which CPU is faster? CPIA = 0.2×2+0.8×1=1.2 CPIB = 0.25×2+0.75×1=1.25 TA=ICA×1.2×Tclk TB= .8 ICA×1.25×1.25 Tclk=1.25×ICA×Tclk (A is ~4% faster) 22 Other Metrics • MIPS and MFLOPS • MIPS = instruction count/(execution time x 106) = clock rate/(CPI x 106) • But MIPS has serious shortcomings 23 Problems with MIPS • e.g.
Recommended publications
  • Accelerating HPL Using the Intel Xeon Phi 7120P Coprocessors
    Accelerating HPL using the Intel Xeon Phi 7120P Coprocessors Authors: Saeed Iqbal and Deepthi Cherlopalle The Intel Xeon Phi Series can be used to accelerate HPC applications in the C4130. The highly parallel architecture on Phi Coprocessors can boost the parallel applications. These coprocessors work seamlessly with the standard Xeon E5 processors series to provide additional parallel hardware to boost parallel applications. A key benefit of the Xeon Phi series is that these don’t require redesigning the application, only compiler directives are required to be able to use the Xeon Phi coprocessor. Fundamentally, the Intel Xeon series are many-core parallel processors, with each core having a dedicated L2 cache. The cores are connected through a bi-directional ring interconnects. Intel offers a complete set of development, performance monitoring and tuning tools through its Parallel Studio and VTune. The goal is to enable HPC users to get advantage from the parallel hardware with minimal changes to the code. The Xeon Phi has two modes of operation, the offload mode and native mode. In the offload mode designed parts of the application are “offloaded” to the Xeon Phi, if available in the server. Required code and data is copied from a host to the coprocessor, processing is done parallel in the Phi coprocessor and results move back to the host. There are two kinds of offload modes, non-shared and virtual-shared memory modes. Each offload mode offers different levels of user control on data movement to and from the coprocessor and incurs different types of overheads. In the native mode, the application runs on both host and Xeon Phi simultaneously, communication required data among themselves as need.
    [Show full text]
  • Intel Cirrascale and Petrobras Case Study
    Case Study Intel® Xeon Phi™ Coprocessor Intel® Xeon® Processor E5 Family Big Data Analytics High-Performance Computing Energy Accelerating Energy Exploration with Intel® Xeon Phi™ Coprocessors Cirrascale delivers scalable performance by combining its innovative PCIe switch riser with Intel® processors and coprocessors To find new oil and gas reservoirs, organizations are focusing exploration in the deep sea and in complex geological formations. As energy companies such as Petrobras work to locate and map those reservoirs, they need powerful IT resources that can process multiple iterations of seismic models and quickly deliver precise results. IT solution provider Cirrascale began building systems with Intel® Xeon Phi™ coprocessors to provide the scalable performance Petrobras and other customers need while holding down costs. Challenges • Enable deep-sea exploration. Improve reservoir mapping accuracy with detailed seismic processing. • Accelerate performance of seismic applications. Speed time to results while controlling costs. • Improve scalability. Enable server performance and density to scale as data volumes grow and workloads become more demanding. Solution • Custom Cirrascale servers with Intel Xeon Phi coprocessors. Employ new compute blades with the Intel® Xeon® processor E5 family and Intel Xeon Phi coprocessors. Cirrascale uses custom PCIe switch risers for fast, peer-to-peer communication among coprocessors. Technology Results • Linear scaling. Performance increases linearly as Intel Xeon Phi coprocessors “Working together, the are added to the system. Intel® Xeon® processors • Simplified development model. Developers no longer need to spend time optimizing data placement. and Intel® Xeon Phi™ coprocessors help Business Value • Faster, better analysis. More detailed and accurate modeling in less time HPC applications shed improves oil and gas exploration.
    [Show full text]
  • Power Measurement Tutorial for the Green500 List
    Power Measurement Tutorial for the Green500 List R. Ge, X. Feng, H. Pyla, K. Cameron, W. Feng June 27, 2007 Contents 1 The Metric for Energy-Efficiency Evaluation 1 2 How to Obtain P¯(Rmax)? 2 2.1 The Definition of P¯(Rmax)...................................... 2 2.2 Deriving P¯(Rmax) from Unit Power . 2 2.3 Measuring Unit Power . 3 3 The Measurement Procedure 3 3.1 Equipment Check List . 4 3.2 Software Installation . 4 3.3 Hardware Connection . 4 3.4 Power Measurement Procedure . 5 4 Appendix 6 4.1 Frequently Asked Questions . 6 4.2 Resources . 6 1 The Metric for Energy-Efficiency Evaluation This tutorial serves as a practical guide for measuring the computer system power that is required as part of a Green500 submission. It describes the basic procedures to be followed in order to measure the power consumption of a supercomputer. A supercomputer that appears on The TOP500 List can easily consume megawatts of electric power. This power consumption may lead to operating costs that exceed acquisition costs as well as intolerable system failure rates. In recent years, we have witnessed an increasingly stronger movement towards energy-efficient computing systems in academia, government, and industry. Thus, the purpose of the Green500 List is to provide a ranking of the most energy-efficient supercomputers in the world and serve as a complementary view to the TOP500 List. However, as pointed out in [1, 2], identifying a single objective metric for energy efficiency in supercom- puters is a difficult task. Based on [1, 2] and given the already existing use of the “performance per watt” metric, the Green500 List uses “performance per watt” (PPW) as its metric to rank the energy efficiency of supercomputers.
    [Show full text]
  • Towards Better Performance Per Watt in Virtual Environments on Asymmetric Single-ISA Multi-Core Systems
    Towards Better Performance Per Watt in Virtual Environments on Asymmetric Single-ISA Multi-core Systems Viren Kumar Alexandra Fedorova Simon Fraser University Simon Fraser University 8888 University Dr 8888 University Dr Vancouver, Canada Vancouver, Canada [email protected] [email protected] ABSTRACT performance per watt than homogeneous multicore proces- Single-ISA heterogeneous multicore architectures promise to sors. As power consumption in data centers becomes a grow- deliver plenty of cores with varying complexity, speed and ing concern [3], deploying ASISA multicore systems is an performance in the near future. Virtualization enables mul- increasingly attractive opportunity. These systems perform tiple operating systems to run concurrently as distinct, in- at their best if application workloads are assigned to het- dependent guest domains, thereby reducing core idle time erogeneous cores in consideration of their runtime proper- and maximizing throughput. This paper seeks to identify a ties [4][13][12][18][24][21]. Therefore, understanding how to heuristic that can aid in intelligently scheduling these vir- schedule data-center workloads on ASISA systems is an im- tualized workloads to maximize performance while reducing portant problem. This paper takes the first step towards power consumption. understanding the properties of data center workloads that determine how they should be scheduled on ASISA multi- We propose that the controlling domain in a Virtual Ma- core processors. Since virtual machine technology is a de chine Monitor or hypervisor is relatively insensitive to changes facto standard for data centers, we study virtual machine in core frequency, and thus scheduling it on a slower core (VM) workloads. saves power while only slightly affecting guest domain per- formance.
    [Show full text]
  • Comparing the Power and Performance of Intel's SCC to State
    Comparing the Power and Performance of Intel’s SCC to State-of-the-Art CPUs and GPUs Ehsan Totoni, Babak Behzad, Swapnil Ghike, Josep Torrellas Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA E-mail: ftotoni2, bbehza2, ghike2, [email protected] Abstract—Power dissipation and energy consumption are be- A key architectural challenge now is how to support in- coming increasingly important architectural design constraints in creasing parallelism and scale performance, while being power different types of computers, from embedded systems to large- and energy efficient. There are multiple options on the table, scale supercomputers. To continue the scaling of performance, it is essential that we build parallel processor chips that make the namely “heavy-weight” multi-cores (such as general purpose best use of exponentially increasing numbers of transistors within processors), “light-weight” many-cores (such as Intel’s Single- the power and energy budgets. Intel SCC is an appealing option Chip Cloud Computer (SCC) [1]), low-power processors (such for future many-core architectures. In this paper, we use various as embedded processors), and SIMD-like highly-parallel archi- scalable applications to quantitatively compare and analyze tectures (such as General-Purpose Graphics Processing Units the performance, power consumption and energy efficiency of different cutting-edge platforms that differ in architectural build. (GPGPUs)). These platforms include the Intel Single-Chip Cloud Computer The Intel SCC [1] is a research chip made by Intel Labs (SCC) many-core, the Intel Core i7 general-purpose multi-core, to explore future many-core architectures. It has 48 Pentium the Intel Atom low-power processor, and the Nvidia ION2 (P54C) cores in 24 tiles of two cores each.
    [Show full text]
  • NVIDIA Ampere GA102 GPU Architecture Whitepaper
    NVIDIA AMPERE GA102 GPU ARCHITECTURE Second-Generation RTX Updated with NVIDIA RTX A6000 and NVIDIA A40 Information V2.0 Table of Contents Introduction 5 GA102 Key Features 7 2x FP32 Processing 7 Second-Generation RT Core 7 Third-Generation Tensor Cores 8 GDDR6X and GDDR6 Memory 8 Third-Generation NVLink® 8 PCIe Gen 4 9 Ampere GPU Architecture In-Depth 10 GPC, TPC, and SM High-Level Architecture 10 ROP Optimizations 11 GA10x SM Architecture 11 2x FP32 Throughput 12 Larger and Faster Unified Shared Memory and L1 Data Cache 13 Performance Per Watt 16 Second-Generation Ray Tracing Engine in GA10x GPUs 17 Ampere Architecture RTX Processors in Action 19 GA10x GPU Hardware Acceleration for Ray-Traced Motion Blur 20 Third-Generation Tensor Cores in GA10x GPUs 24 Comparison of Turing vs GA10x GPU Tensor Cores 24 NVIDIA Ampere Architecture Tensor Cores Support New DL Data Types 26 Fine-Grained Structured Sparsity 26 NVIDIA DLSS 8K 28 GDDR6X Memory 30 RTX IO 32 Introducing NVIDIA RTX IO 33 How NVIDIA RTX IO Works 34 Display and Video Engine 38 DisplayPort 1.4a with DSC 1.2a 38 HDMI 2.1 with DSC 1.2a 38 Fifth Generation NVDEC - Hardware-Accelerated Video Decoding 39 AV1 Hardware Decode 40 Seventh Generation NVENC - Hardware-Accelerated Video Encoding 40 NVIDIA Ampere GA102 GPU Architecture ii Conclusion 42 Appendix A - Additional GeForce GA10x GPU Specifications 44 GeForce RTX 3090 44 GeForce RTX 3070 46 Appendix B - New Memory Error Detection and Replay (EDR) Technology 49 Appendix C - RTX A6000 GPU Perf ormance 50 List of Figures Figure 1.
    [Show full text]
  • Using Intel Processors for DSP Applications
    Using Intel® Processors for DSP Applications: Comparing the Performance of Freescale MPC8641D and Two Intel Core™2 Duo Processors Mike Delves N.A. Software Ltd David Tetley GE Fanuc Intelligent Platforms Introduction The high performance embedded DSP processor market has moved steadily over the past decade from one dominated by specialised fixed point processors towards those with recognisable similarities to the general- purpose processor market: DSP processors have provided floating point, substantial caches, and capable C/C++ compilers, as well as SIMD (Single Instruction Multiple Data) features providing fast vector operations. The inclusion of SIMD features to general purpose processors has led to them replacing specialised DSPs in many high performance embedded applications (such as Radar, SAR, SIGINT and image processing). Indeed, probably the most widely used general purpose processor for DSP in the past five years is the PowerPC family, which was used for a long while in the Apple range of PCs. The G4 generation of the PowerPC has dominated the embedded high performance computing market for over 8 years.If the PowerPC can be accepted both in the general-purpose and the embedded DSP markets, what about other processor families? This question is motivated by the very fast rate of development of general- purpose silicon over the past four years: faster cycle times, larger caches, faster front side buses, lower-power variants, multi-core technology, vector instruction sets, and plans for more of everything well into the future, with development funded by the huge general-purpose market. Here, we look in particular at how well the current family of Intel® low power processors perform against the PowerPC.
    [Show full text]
  • High Performance Embedded Computing in Space
    High Performance Embedded Computing in Space: Evaluation of Platforms for Vision-based Navigation George Lentarisa, Konstantinos Maragosa, Ioannis Stratakosa, Lazaros Papadopoulosa, Odysseas Papanikolaoua and Dimitrios Soudrisb National Technical University of Athens, 15780 Athens, Greece Manolis Lourakisc and Xenophon Zabulisc Foundation for Research and Technology - Hellas, POB 1385, 71110 Heraklion, Greece David Gonzalez-Arjonad GMV Aerospace & Defence SAU, Tres Cantos, 28760 Madrid, Spain Gianluca Furanoe European Space Agency, European Space Technology Centre, Keplerlaan 1 2201AZ Noordwijk, The Netherlands Vision-based navigation has become increasingly important in a variety of space ap- plications for enhancing autonomy and dependability. Future missions, such as active debris removal for remediating the low Earth orbit environment, will rely on novel high-performance avionics to support advanced image processing algorithms with sub- stantial workloads. However, when designing new avionics architectures, constraints relating to the use of electronics in space present great challenges, further exacerbated by the need for significantly faster processing compared to conventional space-grade central processing units. With the long-term goal of designing high-performance em- bedded computers for space, in this paper, an extended study and trade-off analysis of a diverse set of computing platforms and architectures (i.e., central processing units, a Research Associate, School of Electrical and Computer Engineering, NTUA, Athens. [email protected] b Associate Professor, School of Electrical and Computer Engineering, NTUA, Athens. [email protected] c Principal Researcher, Institute of Computer Science, FORTH, Heraklion. [email protected] d Avionics and On-Board Software Engineer, GMV, Madrid. e On-Board Computer Engineer, Microelectronics & Data Systems Division, ESA ESTEC, Noordwijk.
    [Show full text]
  • Low-Power High Performance Computing
    Low-Power High Performance Computing Panagiotis Kritikakos August 16, 2011 MSc in High Performance Computing The University of Edinburgh Year of Presentation: 2011 Abstract The emerging development of computer systems to be used for HPC require a change in the architecture for processors. New design approaches and technologies need to be embraced by the HPC community for making a case for new approaches in system design for making it possible to be used for Exascale Supercomputers within the next two decades, as well as to reduce the CO2 emissions of supercomputers and scientific clusters, leading to greener computing. Power is listed as one of the most important issues and constraint for future Exascale systems. In this project we build a hybrid cluster, investigating, measuring and evaluating the performance of low-power CPUs, such as Intel Atom and ARM (Marvell 88F6281) against commodity Intel Xeon CPU that can be found within standard HPC and data-center clusters. Three main factors are considered: computational performance and efficiency, power efficiency and porting effort. Contents 1 Introduction 1 1.1 Report organisation . 2 2 Background 3 2.1 RISC versus CISC . 3 2.2 HPC Architectures . 4 2.2.1 System architectures . 4 2.2.2 Memory architectures . 5 2.3 Power issues in modern HPC systems . 9 2.4 Energy and application efficiency . 10 3 Literature review 12 3.1 Green500 . 12 3.2 Supercomputing in Small Spaces (SSS) . 12 3.3 The AppleTV Cluster . 13 3.4 Sony Playstation 3 Cluster . 13 3.5 Microsoft XBox Cluster . 14 3.6 IBM BlueGene/Q .
    [Show full text]
  • PAKCK: Performance and Power Analysis of Key Computational Kernels on Cpus and Gpus
    PAKCK: Performance and Power Analysis of Key Computational Kernels on CPUs and GPUs Julia S. Mullen, Michael M. Wolf and Anna Klein MIT Lincoln Laboratory Lexington, MA 02420 Email: fjsm, michael.wolf,anna.klein [email protected] Abstract—Recent projections suggest that applications and (PAKCK) study was funded by DARPA to gather performance architectures will need to attain 75 GFLOPS/W in order to data necessary to address both requirements. support future DoD missions. Meeting this goal requires deeper As part of the PAKCK study, several key computational understanding of kernel and application performance as a function of power and architecture. As part of the PAKCK kernels from DoD applications were identified and charac- study, a set of DoD application areas, including signal and image terized in terms of power usage and performance for sev- processing and big data/graph computation, were surveyed to eral architectures. A key contribution of this paper is the identify performance critical kernels relevant to DoD missions. methodology we developed for characterizing power usage From that survey, we present the characterization of dense and performance for kernels on the Intel Sandy Bridge and matrix-vector product, two dimensional FFTs, and sparse matrix- dense vector multiplication on the NVIDIA Fermi and Intel NVIDIA Fermi architectures. We note that the method is Sandy Bridge architectures. extensible to additional kernels and mini-applications. An We describe the methodology that was developed for charac- additional contribution is the power usage and performance terizing power usage and performance on these architectures per Watt results for three performance critical kernels.
    [Show full text]
  • EPYC: Designed for Effective Performance
    EPYC: Designed for Effective Performance By Linley Gwennap Principal Analyst June 2017 www.linleygroup.com EPYC: Designed for Effective Performance By Linley Gwennap, Principal Analyst, The Linley Group Measuring server-processor performance using clock speed (GHz) or even the traditional SPEC_int test can be misleading. AMD’s new EPYC processor is designed to deliver strong performance across a wide range of server applications, meeting the needs of modern data centers and enterprises. These design capabilities include advanced branch prediction, data prefetching, coherent interconnect, and integrated high-bandwidth DRAM and I/O interfaces. AMD sponsored the creation of this white paper, but the opinions and analysis are those of the author. Trademark names are used in an editorial fashion and are the property of their respective owners. Although many PC users can settle for “good enough” performance, data-center opera- tors are always seeking more. Web searches demand more performance as the Internet continues to expand. Newer applications such as voice recognition (for services such as Alexa and Siri) and analyzing big data also require tremendous performance. Neural networks are gaining in popularity for everything from image recognition to self-driving cars, but training these networks can tie up hundreds of servers for days at a time. Processor designers must meet these greater performance demands while staying within acceptable electrical-power ratings. Server processors are often characterized by core count and clock speed (GHz), but these characteristics provide only a rough approximation of application performance. As important as speed is, the amount of work that a processor can accomplish with each tick of the clock, a parameter known as instructions per cycle (IPC), is equally important.
    [Show full text]
  • Measurement, Control, and Performance Analysis for Intel Xeon Phi
    Power-aware Computing: Measurement, Control, and Performance Analysis for Intel Xeon Phi Azzam Haidar∗, Heike Jagode∗, Asim YarKhan∗, Phil Vaccaro∗, Stanimire Tomov∗, Jack Dongarra∗yz [email protected], ∗Innovative Computing Laboratory (ICL), University of Tennessee, Knoxville, USA yOak Ridge National Laboratory, USA zUniversity of Manchester, UK Abstract— The emergence of power efficiency as a primary our experiments are set up and executed on Intel’s Xeon Phi constraint in processor and system designs poses new challenges Knights Landing (KNL) architecture. The Knights Landing concerning power and energy awareness for numerical libraries processor demonstrates many of the interesting architectural and scientific applications. Power consumption also plays a major role in the design of data centers in particular for peta- and exa- characteristics of the newer many-core architectures, with a scale systems. Understanding and improving the energy efficiency deeper hierarchy of explicit memory modules and multiple of numerical simulation becomes very crucial. modes of configuration. Our analysis is performed using Dense We present a detailed study and investigation toward control- Linear Algebra (DLA) kernels, specifically BLAS (Basic Linear ling power usage and exploring how different power caps affect Algebra Subroutine) kernels. the performance of numerical algorithms with different computa- tional intensities, and determine the impact and correlation with In order to measure the relationship between energy con- performance of scientific applications. sumption and attained performance for algorithms with different Our analyses is performed using a set of representatives complexities, we run experiments with representative BLAS kernels, as well as many highly used scientific benchmarks. We kernels that have different computational intensities.
    [Show full text]