1. CS 240A Applied Parallel Computing John R. Gilbert gilbert@cs.ucsb.edu http://www.cs.ucsb.edu/~cs240a Thanks to Kathy Yelick and Jim Demmel at UCB for some of their slides.

2. Course bureacracy Read course home page http://www.cs.ucsb.edu/~cs240a/homepage.html http://www.cs.ucsb.edu/~cs240a/homepage.html Join Google discussion group (see course home page) Accounts on Triton, San Diego Supercomputing Center: Use “ssh –keygen –t rsa” and then email your “id_rsa.pub” file to Stefan Boeriu, stefan@engineering.ucsb.edustefan@engineering.ucsb.edu If you weren’t signed up for the course as of last week, email me your registration info right away Triton logon demo & tool intro coming soon– watch Google group for details

3. Homework 1 See course home page for details. Find an application of parallel computing and build a web page describing it. Choose something from your research area. Or from the web or elsewhere. Create a web page describing the application. Describe the application and provide a reference (or link) Describe the platform where this application was run Find peak and LINPACK performance for the platform and its rank on the TOP500 list Find the performance of your selected application What ratio of sustained to peak performance is reported? Evaluate the project: How did the application scale, ie was speed roughly proportional to the number of processors? What were the major difficulties in obtaining good performance? What tools and algorithms were used? Send us (John and Hans) the link (we will post them) Due next Monday, April 5

4. Two examples of big parallel problems Bone density modeling: Physical simulation Lots of numerical computing Spatially local Vertex betweenness centrality: Exploring an unstructured graph Lots of pointer-chasing Little numerical computing No spatial locality

5. Social newtork analysis Betweenness Centrality (BC) C B (v): Among all the shortest paths, what fraction of them pass through the node of interest? Brandes’ algorithm A typical software stack for an application enabled with the Combinatorial BLAS

6. 6 X ATAT (A T X). *¬X  1 2 3 4 7 5 Betweenness Centrality using Sparse GEMM Parallel breadth-first search is implemented with sparse matrix-matrix multiplication Work efficient algorithm for BC

7. BC performance in distributed memory TEPS: Traversed Edges Per Second Batch of 512 vertices at each iteration Code only a few lines longer than Matlab version Input: RMAT scale N 2 N vertices Average degree 8 Pure MPI-1 version. No reliance on any particular hardware

8. Parallel Computers Today Oak Ridge / Cray Jaguar > 1.75 PFLOPS Two Nvidia 8800 GPUs > 1 TFLOPS Intel 80- core chip > 1 TFLOPS  TFLOPS = 10 12 floating point ops/sec  PFLOPS = 1,000,000,000,000,000 / sec (10 15 )

9. AMD Opteron quad-core die

10. Cray XMT (highly multithreaded shared memory)

11. Top 500 List http://www.top500.org/list/2009/11/100

12. The Computer Architecture Challenge  Most high-performance computer designs allocate resources to optimize Gaussian elimination on large, dense matrices.  Originally, because linear algebra is the middleware of scientific computing.  Nowadays, mostly for bragging rights. = x P A L U

13. Why are powerful computers parallel?

14. Technology Trends: Microprocessor Capacity Moore’s Law: #transistors/chip doubles every 1.5 years Moore’s Law Microprocessors have become smaller, denser, and more powerful. Gordon Moore (co-founder of Intel) predicted in 1965 that the transistor density of semiconductor chips would double roughly every 18 months. Slide source: Jack Dongarra

15. Scaling microprocessors What happens when feature size shrinks by a factor of x? Clock rate used to go up by x, but no longer Clock rates are topping out due to power (heat) limits Transistors per unit area goes up by x 2 Die size also tends to increase Typically another factor of ~x Raw computing capability of the chip goes up by ~ x 3 ! But it’s all for parallelism, not speed

16. How fast can a serial computer be? Consider the 1 Tflop sequential machine data must travel some distance, r, to get from memory to CPU to get 1 data element per cycle, this means 10^12 times per second at the speed of light, c = 3e8 m/s so r < c/10^12 =.3 mm Now put 1 TB of storage in a.3 mm^2 area each word occupies ~ 3 Angstroms^2, the size of a small atom r =.3 mm 1 Tflop 1 TB sequential machine

17. “Automatic” Parallelism in Modern Machines Bit level parallelism within floating point operations, etc. Instruction level parallelism multiple instructions execute per clock cycle Memory system parallelism overlap of memory operations with computation OS parallelism multiple jobs run in parallel on commodity SMPs There are limits to all of these -- for very high performance, user must identify, schedule and coordinate parallel tasks

18. Number of transistors per processor chip

19. Bit-Level Parallelism Instruction-Level Parallelism Thread-Level Parallelism?

20. Generic Parallel Machine Architecture Key architecture question: Where is the interconnect, and how fast? Key algorithm question: Where is the data? Proc Cache L2 Cache L3 Cache Memory Storage Hierarchy Proc Cache L2 Cache L3 Cache Memory Proc Cache L2 Cache L3 Cache Memory potential interconnects