1 Today About the class Introductions Any new people? Start of first module: Parallel Computing.

Slides:



Advertisements
Similar presentations
Multiprocessors— Large vs. Small Scale Multiprocessors— Large vs. Small Scale.
Advertisements

COE 502 / CSE 661 Parallel and Vector Architectures Prof. Muhamed Mudawar Computer Engineering Department King Fahd University of Petroleum and Minerals.
Chapter1 Fundamental of Computer Design Dr. Bernard Chen Ph.D. University of Central Arkansas.
ECE669 L15: Mid-term Review March 25, 2004 ECE 669 Parallel Computer Architecture Lecture 15 Mid-term Review.
ECE669 L1: Course Introduction January 29, 2004 ECE 669 Parallel Computer Architecture Lecture 1 Course Introduction Prof. Russell Tessier Department of.
1 COMP 206: Computer Architecture and Implementation Montek Singh Mon, Dec 5, 2005 Topic: Intro to Multiprocessors and Thread-Level Parallelism.
Room: E-3-31 Phone: Dr Masri Ayob TK 2123 COMPUTER ORGANISATION & ARCHITECTURE Lecture 4: Computer Performance.
ECE669 L2: Architectural Perspective February 3, 2004 ECE 669 Parallel Computer Architecture Lecture 2 Architectural Perspective.
Introduction What is Parallel Algorithms? Why Parallel Algorithms? Evolution and Convergence of Parallel Algorithms Fundamental Design Issues.
CIS 629 Parallel Arch. Intro Parallel Computer Architecture Slides blended from those of David Patterson, CS 252 and David Culler, CS 258 UC Berkeley.
EET 4250: Chapter 1 Performance Measurement, Instruction Count & CPI Acknowledgements: Some slides and lecture notes for this course adapted from Prof.
Why Parallel Architecture? Todd C. Mowry CS 495 January 15, 2002.
Parallel Processing Architectures Laxmi Narayan Bhuyan
EECC756 - Shaaban #1 lec # 1 Spring Parallel Computer Architecture A parallel computer is a collection of processing elements that cooperate.
CPE 731 Advanced Computer Architecture Multiprocessor Introduction
CMSC 611: Advanced Computer Architecture Parallel Computation Most slides adapted from David Patterson. Some from Mohomed Younis.
0 Introduction to parallel processing Chapter 1 from Culler & Singh Winter 2007.
Computer performance.
Chapter1 Fundamental of Computer Design Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2010.
GPU Programming with CUDA – Accelerated Architectures Mike Griffiths
Simultaneous Multithreading: Maximizing On-Chip Parallelism Presented By: Daron Shrode Shey Liggett.
Parallel Computing Laxmikant Kale
1b.1 Types of Parallel Computers Two principal approaches: Shared memory multiprocessor Distributed memory multicomputer ITCS 4/5145 Parallel Programming,
Multi-core architectures. Single-core computer Single-core CPU chip.
Multi-Core Architectures
ECE 568: Modern Comp. Architectures and Intro to Parallel Processing Fall 2006 Ahmed Louri ECE Department.
Sogang University Advanced Computing System Chap 1. Computer Architecture Hyuk-Jun Lee, PhD Dept. of Computer Science and Engineering Sogang University.
C OMPUTER O RGANIZATION AND D ESIGN The Hardware/Software Interface 5 th Edition Chapter 1 Computer Abstractions and Technology Sections 1.5 – 1.11.
CS 320 Spring 2003 Introduction Laxmikant Kale
Problem is to compute: f(latitude, longitude, elevation, time)  temperature, pressure, humidity, wind velocity Approach: –Discretize the.
Advanced Computer Architecture Fundamental of Computer Design Instruction Set Principles and Examples Pipelining:Basic and Intermediate Concepts Memory.
ECE 569: High-Performance Computing: Architectures, Algorithms and Technologies Spring 2006 Ahmed Louri ECE Department.
Spring 2003CSE P5481 Issues in Multiprocessors Which programming model for interprocessor communication shared memory regular loads & stores message passing.
Chapter 1 Computer Abstractions and Technology. Chapter 1 — Computer Abstractions and Technology — 2 The Computer Revolution Progress in computer technology.
Computing Environment The computing environment rapidly evolving ‑ you need to know not only the methods, but also How and when to apply them, Which computers.
INEL6067 Technology ---> Limitations & Opportunities Wires -Area -Propagation speed Clock Power VLSI -I/O pin limitations -Chip area -Chip crossing delay.
CS433 Spring 2001 Introduction Laxmikant Kale. 2 Course objectives and outline You will learn about: –Parallel programming models Emphasis on 3: message.
1 Lecture 1: Parallel Architecture Intro Course organization:  ~18 parallel architecture lectures (based on text)  ~10 (recent) paper presentations 
3/12/2013Computer Engg, IIT(BHU)1 PARALLEL COMPUTERS- 2.
3/12/2013Computer Engg, IIT(BHU)1 PARALLEL COMPUTERS- 3.
CS 258 Parallel Computer Architecture Lecture 1 Introduction to Parallel Architecture January 23, 2002 Prof John D. Kubiatowicz.
Jan. 5, 2000Systems Architecture II1 Machine Organization (CS 570) Lecture 1: Overview of High Performance Processors * Jeremy R. Johnson Wed. Sept. 27,
CDA-5155 Computer Architecture Principles Fall 2000 Multiprocessor Architectures.
Background Computer System Architectures Computer System Software.
High Performance Computing1 High Performance Computing (CS 680) Lecture 2a: Overview of High Performance Processors * Jeremy R. Johnson *This lecture was.
Lecture 1: Introduction CprE 585 Advanced Computer Architecture, Fall 2004 Zhao Zhang.
CS203 – Advanced Computer Architecture Performance Evaluation.
VU-Advanced Computer Architecture Lecture 1-Introduction 1 Advanced Computer Architecture CS 704 Advanced Computer Architecture Lecture 1.
Constructing a system with multiple computers or processors 1 ITCS 4/5145 Parallel Programming, UNC-Charlotte, B. Wilkinson. Jan 13, 2016.
Lecture 13 Parallel Processing. 2 What is Parallel Computing? Traditionally software has been written for serial computation. Parallel computing is the.
Feeding Parallel Machines – Any Silver Bullets? Novica Nosović ETF Sarajevo 8th Workshop “Software Engineering Education and Reverse Engineering” Durres,
William Stallings Computer Organization and Architecture 6th Edition
CS203 – Advanced Computer Architecture
Introduction.
CMSC 611: Advanced Computer Architecture
Parallel Computers Definition: “A parallel computer is a collection of processing elements that cooperate and communicate to solve large problems fast.”
Auburn University COMP7330/7336 Advanced Parallel and Distributed Computing Parallel Programming Models Dr. Xiao Qin Auburn.
Architecture & Organization 1
CS775: Computer Architecture
Architecture & Organization 1
Lecture 1: Parallel Architecture Intro
Performance of computer systems
Course Description: Parallel Computer Architecture
Parallel Processing Architectures
CS 258 Parallel Computer Architecture
Constructing a system with multiple computers or processors
Chapter 1 Introduction.
Computer Evolution and Performance
Chapter 4 Multiprocessors
Presentation transcript:

1 Today About the class Introductions Any new people? Start of first module: Parallel Computing

2 Goals for This Module Overview of Parallel Architecture and Programming Models Drivers of Parallel Computing (Appl, Tech trends, Arch., Economics) Trends in “Supercomputers” for Scientific Computing Evolution and Convergence of Parallel Architectures Fundamental Issues in Programming Models and Architecture Parallel programs Process of parallelization What parallel programs look like in major programming models Programming for performance Key performance issues and architectural interactions

Overview of Parallel Architecture and Programming Models

4 What is a Parallel Computer? A collection of processing elements that cooperate to solve large problems fast Some broad issues that distinguish parallel computers: Resource Allocation: – how large a collection? – how powerful are the elements? – how much memory? Data access, Communication and Synchronization – how do the elements cooperate and communicate? – how are data transmitted between processors? – what are the abstractions and primitives for cooperation? Performance and Scalability – how does it all translate into performance? – how does it scale?

5 Why Parallelism? Provides alternative to faster clock for performance Assuming a doubling of effective per-node performance every 2 years, 1024-CPU system can get you the performance that it would take 20 years for a single-CPU system to deliver Applies at all levels of system design Is increasingly central in information processing Scientific computing: simulation, data analysis, data storage and management, etc. Commercial computing: Transaction processing, databases Internet applications: Search; Google operates at least 50,000 CPUs, many as part of large parallel systems

6 How to Study Parallel Systems History: diverse and innovative organizational structures, often tied to novel programming models Rapidly matured under strong technological constraints The microprocessor is ubiquitous Laptops and supercomputers are fundamentally similar! Technological trends cause diverse approaches to converge Technological trends make parallel computing inevitable In the mainstream Need to understand fundamental principles and design tradeoffs, not just taxonomies Naming, Ordering, Replication, Communication performance

7 Outline Drivers of Parallel Computing Trends in “Supercomputers” for Scientific Computing Evolution and Convergence of Parallel Architectures Fundamental Issues in Programming Models and Architecture

8 Drivers of Parallel Computing Application Needs: Our insatiable need for computing cycles Scientific computing: CFD, Biology, Chemistry, Physics,... General-purpose computing: Video, Graphics, CAD, Databases, TP... Internet applications: Search, e-Commerce, Clustering... Technology Trends Architecture Trends Economics Current trends: All microprocessors have multiprocessor support Servers and workstations are often MP: Sun, SGI, Dell, COMPAQ... Microprocessors are multiprocessors: SMP on a chip

9 Application Trends Demand for cycles fuels advances in hardware, and vice-versa Cycle drives exponential increase in microprocessor performance Drives parallel architecture harder: most demanding applications Range of performance demands Need range of system performance with progressively increasing cost Platform pyramid Goal of applications in using parallel machines: Speedup Speedup (p processors) = For a fixed problem size (input data set), performance = 1/time Speedup fixed problem (p processors) = Performance (p processors) Performance (1 processor) Time (1 processor) Time (p processors)

10 Scientific Computing Demand

11 Engineering Computing Demand Large parallel machines a mainstay in many industries Petroleum (reservoir analysis) Automotive (crash simulation, drag analysis, combustion efficiency), Aeronautics (airflow analysis, engine efficiency, structural mechanics, electromagnetism), Computer-aided design Pharmaceuticals (molecular modeling) Visualization – in all of the above – entertainment (movies), architecture (walk-throughs, rendering) Financial modeling (yield and derivative analysis) etc.

12 Learning Curve for Parallel Applications AMBER molecular dynamics simulation program Starting point was vector code for Cray MFLOP on Cray90, 406 for final version on 128-processor Paragon, 891 on 128-processor Cray T3D

13 Commercial Computing Also relies on parallelism for high end Scale not so large, but use much more wide-spread Computational power determines scale of business that can be handled Databases, online-transaction processing, decision support, data mining, data warehousing... TPC benchmarks (TPC-C order entry, TPC-D decision support) Explicit scaling criteria provided Size of enterprise scales with size of system Problem size no longer fixed as p increases, so throughput is used as a performance measure (transactions per minute or tpm)

14 TPC-C Results for Wintel Systems Parallelism is pervasive Small to moderate scale parallelism very important Difficult to obtain snapshot to compare across vendor platforms 4-way Cpq PL 5000 Pentium Pro 200 MHz 6,751 tpmC $89.62/tpmC Avail: TPC-C v3.2 (withdrawn) 6-way Unisys AQ HS6 Pentium Pro 200 MHz 12,026 tpmC $39.38/tpmC Avail: TPC-C v3.3 (withdrawn) 4-way IBM NF 7000 PII Xeon 400 MHz 18,893 tpmC $29.09/tpmC Avail: TPC-C v3.3 (withdrawn)8-way Cpq PL 8500 PIII Xeon 550 MHz 40,369 tpmC $18.46/tpmC Avail: TPC-C v3.5 (withdrawn)8-way Dell PE 8450 PIII Xeon 700 MHz 57,015 tpmC $14.99/tpmC Avail: TPC-C v3.5 (withdrawn)32-way Unisys ES7000 PIII Xeon 900 MHz 165,218 tpmC $21.33/tpmC Avail: TPC-C v way NEC Express5800 Itanium2 1GHz 342,746 tpmC $12.86/tpmC Avail: TPC-C v way Unisys ES7000 Xeon MP 2 GHz 234,325 tpmC $11.59/tpmC Avail: TPC-C v5.0 PerformancePrice-Performance 342K 19K 40K 57K 165K 234K 12K 7K 0 50, , , , , , , , Performance (tpmC) $0 $10 $20 $30 $40 $50 $60 $70 $80 $90 $100 Price-Perf ($/tpmC)

15 Summary of Application Trends Transition to parallel computing has occurred for scientific and engineering computing In rapid progress in commercial computing Database and transactions as well as financial Usually smaller-scale, but large-scale systems also used Desktop also uses multithreaded programs, which are a lot like parallel programs Demand for improving throughput on sequential workloads Greatest use of small-scale multiprocessors Solid application demand, keeps increasing with time

16 Drivers of Parallel Computing Application Needs Technology Trends Architecture Trends Economics

17 Technology Trends: Rise of the Micro The natural building block for multiprocessors is now also about the fastest!

18 General Technology Trends Microprocessor performance increases 50% - 100% per year Transistor count doubles every 3 years DRAM size quadruples every 3 years Huge investment per generation is carried by huge commodity market Not that single-processor performance is plateauing, but that parallelism is a natural way to improve it.

19 Clock Frequency Growth Rate (Intel family) 30% per year

20 Transistor Count Growth Rate (Intel family) 100 million transistors on chip by early 2000’s A.D. Transistor count grows much faster than clock rate - 40% per year, order of magnitude more contribution in 2 decades

21 Technology: A Closer Look Basic advance is decreasing feature size (  ) Circuits become either faster or lower in power Die size is growing too Clock rate improves roughly proportional to improvement in Number of transistors improves like   (or faster) Performance > 100x per decade; clock rate 10x, rest transistor count How to use more transistors? Parallelism in processing – multiple operations per cycle reduces CPI Locality in data access – avoids latency and reduces CPI – also improves processor utilization Both need resources, so tradeoff Fundamental issue is resource distribution, as in uniprocessors Proc$ Interconnect

22 Similar Story for Storage Divergence between memory capacity and speed more pronounced Capacity increased by 1000x from , and increases 50% per yr Latency reduces only 3% per year (only 2x from ) Bandwidth per memory chip increases 2x as fast as latency reduces Larger memories are slower, while processors get faster Need to transfer more data in parallel Need deeper cache hierarchies How to organize caches?

23 Similar Story for Storage Parallelism increases effective size of each level of hierarchy, without increasing access time Parallelism and locality within memory systems too New designs fetch many bits within memory chip; follow with fast pipelined transfer across narrower interface Buffer caches most recently accessed data Disks too: Parallel disks plus caching Overall, dramatic growth of processor speed, storage capacity and bandwidths relative to latency (especially) and clock speed point toward parallelism as the desirable architectural direction

24 Drivers of Parallel Computing Application Needs Technology Trends Architecture Trends Economics

25 Architectural Trends Architecture translates technology’s gifts to performance and capability Resolves the tradeoff between parallelism and locality Recent microprocessors: 1/3 compute, 1/3 cache, 1/3 off-chip connect Tradeoffs may change with scale and technology advances Four generations of architectural history: tube, transistor, IC, VLSI Here focus only on VLSI generation Greatest delineation in VLSI has been in type of parallelism exploited

26 Architectural Trends in Parallelism Greatest trend in VLSI generation is increase in parallelism Up to 1985: bit level parallelism: 4-bit -> 8 bit -> 16-bit – slows after 32 bit – adoption of 64-bit well under way, 128-bit is far (not performance issue) – great inflection point when 32-bit micro and cache fit on a chip Mid 80s to mid 90s: instruction level parallelism – pipelining and simple instruction sets, + compiler advances (RISC) – on-chip caches and functional units => superscalar execution – greater sophistication: out of order execution, speculation, prediction to deal with control transfer and latency problems Next step: thread level parallelism

27 Phases in VLSI Generation How good is instruction-level parallelism (ILP)? Thread-level needed in microprocessors? SMT, Intel Hyperthreading

28 Can ILP get us there? Reported speedups for superscalar processors Horst, Harris, and Jardine [1990] Wang and Wu [1988] Smith, Johnson, and Horowitz [1989] Murakami et al. [1989] Chang et al. [1991] Jouppi and Wall [1989] Lee, Kwok, and Briggs [1991] Wall [1991] Melvin and Patt [1991] Butler et al. [1991] Large variance due to difference in – application domain investigated (numerical versus non-numerical) – capabilities of processor modeled

29 ILP Ideal Potential Infinite resources and fetch bandwidth, perfect branch prediction and renaming –real caches and non-zero miss latencies

30 Results of ILP Studies Concentrate on parallelism for 4-issue machines Realistic studies show only 2-fold speedup More recent work examines ILP that looks across threads for parallelism

31 Architectural Trends: Bus-based MPs No. of processors in fully configured commercial shared-memory systems Micro on a chip makes it natural to connect many to shared memory –dominates server and enterprise market, moving down to desktop Faster processors began to saturate bus, then bus technology advanced –today, range of sizes for bus-based systems, desktop to large servers

32 Bus Bandwidth

33 Do Buses Scale? Buses are a convenient way to extend architecture to parallelism, but they do not scale bandwidth doesn’t grow as CPUs are added Scalable systems use physically distributed memory

34 Drivers of Parallel Computing Application Needs Technology Trends Architecture Trends Economics

35 Finally, Economics Commodity microprocessors not only fast but CHEAP Development cost is tens of millions of dollars (5-100 typical) BUT, many more are sold compared to supercomputers Crucial to take advantage of the investment, and use the commodity building block Exotic parallel architectures no more than special-purpose Multiprocessors being pushed by software vendors (e.g. database) as well as hardware vendors Standardization by Intel makes small, bus-based SMPs commodity Desktop: few smaller processors versus one larger one? Multiprocessor on a chip

36 Summary: Why Parallel Architecture? Increasingly attractive Economics, technology, architecture, application demand Increasingly central and mainstream Parallelism exploited at many levels Instruction-level parallelism Multiprocessor servers Large-scale multiprocessors (“MPPs”) Focus of this class: multiprocessor level of parallelism Same story from memory (and storage) system perspective Increase bandwidth, reduce average latency with many local memories Wide range of parallel architectures make sense Different cost, performance and scalability

37 Outline Drivers of Parallel Computing Trends in “Supercomputers” for Scientific Computing Evolution and Convergence of Parallel Architectures Fundamental Issues in Programming Models and Architecture

38 Scientific Supercomputing Proving ground and driver for innovative architecture and techniques Market smaller relative to commercial as MPs become mainstream Dominated by vector machines starting in 70s Microprocessors have made huge gains in floating-point performance – high clock rates – pipelined floating point units (e.g. mult-add) – instruction-level parallelism – effective use of caches Plus economics Large-scale multiprocessors replace vector supercomputers

39 Raw Uniprocessor Performance: LINPACK

40 Raw Parallel Performance: LINPACK Even vector Crays became parallel: X-MP (2-4) Y-MP (8), C-90 (16), T94 (32) Since 1993, Cray produces MPPs too (T3D, T3E)

Fastest Computers

42 Top 500 as of 2003 Earth Simulator, built by NEC, remains the unchallenged #1, at 38 Tflop/s ASCI Q at Los Alamos is #2 at TFlop/s. The third system ever to exceed the 10 TFflop/s mark is Virgina Tech's X: a cluster with the Apple G5 as building blocks and the new Infiniband interconnect. #4 is also a cluster, at NCSA. Dell PowerEdge system with Myrinet interconnect #5 is also a cluster, with upgraded Itanium2-based HP system at DOE's Pacific Northwest National Lab, with Quadrics interconnect #6 is the based on AMD's Opteron chip. It was installed by Linux Networx at the Los Alamos National Laboratory and also uses a Myrinet interconnect The list of clusters in the TOP10 has grown to seven systems. The Earth Simulator and two IBM SP systems at Livermore and LBL are the non-clusters. The performance of the #10 system is 6.6 TFlop/s.

43

44 Another View of Performance Growth

45 Another View of Performance Growth

46 Another View of Performance Growth

47 Another View of Performance Growth

48 Outline Drivers of Parallel Computing Trends in “Supercomputers” for Scientific Computing Evolution and Convergence of Parallel Architectures Fundamental Issues in Programming Models and Architecture

49 History Application Software System Software SIMD Message Passing Shared Memory Dataflow Systolic Arrays Architecture Uncertainty of direction paralyzed parallel software development! Historically, parallel architectures tied to programming models Divergent architectures, with no predictable pattern of growth.

50 Today Extension of “computer architecture” to support communication and cooperation OLD: Instruction Set Architecture NEW: Communication Architecture Defines Critical abstractions, boundaries, and primitives (interfaces) Organizational structures that implement interfaces (hw or sw) Compilers, libraries and OS are important bridges between application and architecture today

51 Modern Layered Framework CAD MultiprogrammingShared address Message passing Data parallel DatabaseScientific modeling Parallel applications Programming models Communication abstraction User/system boundary Compilation or library Operating systems support Communication hardware Physical communication medium Hardware/software boundary

52 Parallel Programming Model What the programmer uses in writing applications Specifies communication and synchronization Examples: Multiprogramming: no communication or synch. at program level Shared address space: like bulletin board Message passing: like letters or phone calls, explicit point to point Data parallel: more regimented, global actions on data – Implemented with shared address space or message passing

53 Communication Abstraction User level communication primitives provided by system Realizes the programming model Mapping exists between language primitives of programming model and these primitives Supported directly by hw, or via OS, or via user sw Lot of debate about what to support in sw and gap between layers Today: Hw/sw interface tends to be flat, i.e. complexity roughly uniform Compilers and software play important roles as bridges today Technology trends exert strong influence Result is convergence in organizational structure Relatively simple, general purpose communication primitives

54 Communication Architecture = User/System Interface + Implementation User/System Interface: Comm. primitives exposed to user-level by hw and system-level sw (May be additional user-level software between this and prog model) Implementation: Organizational structures that implement the primitives: hw or OS How optimized are they? How integrated into processing node? Structure of network Goals: Performance Broad applicability Programmability Scalability Low Cost