COPYRIGHT 2008, PRINCETON UNIVERSITY PRESS

contentsxv13.6 Correlated Growth, Forests, and Films (Problem 5) 33813.6.1 Correlated Ballistic Deposition Algorithm 33813.7 Globular Cluster (Problem 6) 33913.7.1 Diffusion-Limited Aggregation Algorithm 33913.7.2 Fractal Analysis of a DLA (or Pollock)Graph (Assessment) 34213.8 Fractal Structures in a Bifurcation Graph(Problem 7) 34313.9 Fractals from Cellular Automata 34313.10 Perlin Noise Adds Realism ⊙ 34513.10.1Including Ray Tracing 34813.11 Quiz 35114 High-Performance Computing Hardware,Tuning, and Parallel Computing 35214.1 Unit I. High-Performance Computers (CS) 35214.2 Memory Hierarchy 35314.3 The Central Processing Unit 35714.4 CPU Design: Reduced Instruction Set Computer 35714.5 CPU Design: Multiple-Core Processors 35814.6 CPU Design: Vector Processor 35914.7 Unit II. Parallel Computing 36014.8 Parallel Semantics (Theory) 36114.9 Distributed Memory Programming 36314.10 Parallel Performance 36514.10.1Communication Overhead 36714.11 Parallelization Strategy 36814.12 Practical Aspects of Message Passing for MIMD 36914.12.1High-Level View of Message Passing 37014.13 Example of a Supercomputer: IBM Blue Gene/L 37214.14 Unit III. HPC Program Optimization 37414.14.1Programming for Virtual Memory (Method) 37614.14.2Optimizing Programs; Java versus Fortran/C 37614.14.3Experimental Effects of Hardware onPerformance 37914.14.4Java versus Fortran/C 38014.15 Programming for the Data Cache (Method) 38514.15.1Exercise 1: Cache Misses 386−101COPYRIGHT 2008, PRINCET O N UNIVE R S I T Y P R E S SEVALUATION COPY ONLY. NOT FOR USE IN COURSES.34811_fm — 2008/2/13 — Page xv