View
227
Download
0
Tags:
Embed Size (px)
Citation preview
CS267 L1 Intro Demmel Sp 1999
CS267 / E233Applications of Parallel
Computers
Lecture 1: Introduction
1/18/99
James Demmel
http://www.cs.berkeley.edu/~demmel/cs267_Spr99
CS267 L1 Intro.2 Demmel Sp 1999
Outline
° Introductions
° Why large important problems require the capabilities of powerful computers
° Why powerful computers must be parallel processors
° Structure of the course
CS267 L1 Intro.3 Demmel Sp 1999
Administrative
° Instructors• Prof. Jim Demmel, 737 Soda, [email protected]
• TA: Fred Wong, 533 Soda, [email protected]
° Office hours• T Th 2:15 - 3:30, and by appointment
° Accounts and others -- fill out online registration!
° Class survey -- fill out online!
° Discussion section: TBD, based on survey
° Most class material will be on class home page (including these notes):
• www.cs.berkeley.edu/~demmel/cs267_Spr99
CS267 L1 Intro Demmel Sp 1999
Why we need powerful computers
CS267 L1 Intro.5 Demmel Sp 1999
Units of High Performance Computing
1 Mflop 1 Megaflop 10^6 Flop/sec
1 Gflop 1 Gigaflop 10^9 Flop/sec
1 Tflop 1 Teraflop 10^12 Flop/sec
1 MB 1 Megabyte 10^6 Bytes
1 GB 1 Gigabyte 10^9 Bytes
1 TB 1 Terabyte 10^12 Bytes
1 PB 1 Petabyte 10^15 Bytes
CS267 L1 Intro.6 Demmel Sp 1999
Why we need powerful computers
° Traditional scientific and engineering paradigm• Do theory or paper design
• Perform experiments or build system
° Replacing both by numerical experiments• Real phenomena are too complicated to model by hand
• Real experiments are:
- too hard, e.g., build large wind tunnels
- too expensive, e.g., build a throw-away passenger jet
- too slow, e.g., wait for climate or galactic evolution
- too dangerous, e.g., weapons, drug design
° Why parallel computers for this? Serial Computers too slow
CS267 L1 Intro.7 Demmel Sp 1999
Some Challenge Computations
° Global Climate Modeling
° Dyna3D- crash simulation
° Astrophysical modeling
° Earthquake (structures) modeling
° Heart simulation
° Web search
° Transaction processing
° Drug design
° Phylogeny -- History of species
° Nuclear Weapons
° now.cs.berkeley.edu/Millennium
CS267 L1 Intro.8 Demmel Sp 1999
Global Climate Modeling
° Climate is a function of 4 arguments
° Which returns a vector of 6 valuesClimate(longitude, latitude, elevation, time)
Temperature, pressure, humidity, and wind velocity
° To model this on a computer we • discretize the domain using a finite grid, e.g., points 1 kilometer apart
- roughly .1 TB of data
• devise and algorithm to predict weather at time t+1 from weather at time t
- e.g., solving Navier-Stokes equations for fluid flow of gasses in the atmosphere
- say this is roughly 100 Flops per grid point with a timestep of 1 minute
• to at least match real time (bare minimum)
- 5*10^11 flops / 60 secs = 8 Gflop/s
• weather prediction (7 days in 24 hours) => 7x faster => 56 Gflop/s
• climate prediction (50 years in 30 days) => 50*12=600x faster => 4.8 Tflops
° Current models use much coarser grids
- www-fp.mcs.anl.gov/chammp
CS267 L1 Intro.9 Demmel Sp 1999
Heart Simulation
° Many biological structures can be modeled as an elastic structure in an incompressible fluid.
° Using the “immersed boundary method” this involves solving Navier-Stokes equations plus some feature-specific computation on the bodies [Peskin&McQueen]
° 20 years of development in model, used to design artificial valves
° 64^3 was possible on Cray YMP, but 128^3 required for accurate model (would have taken 3 years)
° Done on a Cray C90 -- could use 100x faster and 100x more memory
More computing power => more accurate (usable) model
CS267 L1 Intro.10 Demmel Sp 1999
Parallel Computing in Web Search
° Functional parallelism • crawling, indexing, sorting
° Parallelism between queries• multiple users
° Finding information amidst junk
° Preprocessing of the web data set to help find information
° General themes of sifting through large, unstructured data sets• when to put white socks on sale
• what kind of junk mail should you receive
• finding medical problems in a community
CS267 L1 Intro.11 Demmel Sp 1999
Application: Document Retrieval
° Finding useful documents on the Web
° One algorithm, Latent Semantic Indexing (LSI), needs large sparse matrix-vector multiply
# keywords
~100K
# documents ~= 10 M
24 65 18
•Matrix is compressed•“Random” memory access•Scatter/gather vs. cache miss per 2Flops
° 10 Million documents in typical matrix.
° Web storage increasing 2x every 5 months.
° Similar ideas may apply to image retrieval.
x
CS267 L1 Intro.12 Demmel Sp 1999
LSI Challenges
° On conventional microprocessor node• UltraSparc 166 MHz, 330 Mflops peak, Cache miss is 300 ns
• Matrix-vector multiply, does roughly 3 loads and 2 flops, with 1.37 cache misses on average
• ~4.5 Mflops (2-5 Mflops measured)
• Memory accesses are irregular
° On T3E• Osni Marques at LBNL parallelized for the T3E
° Implementation is also I/O intensive
CS267 L1 Intro.13 Demmel Sp 1999
Transaction Processing - it’s all parallel at some scale
° Parallelism is natural in relational operators• select, join, ...
° Many difficult issues• data partitioning, locking, threading
(mar. 15, 1996)
0
5000
10000
15000
20000
25000
0 20 40 60 80 100 120
Processors
Th
rou
gh
pu
t (t
pm
C)
other
Tandem Himalaya
IBM PowerPC
DEC Alpha
SGI PowerChallenge
HP PA
CS267 L1 Intro Demmel Sp 1999
Why powerful computers are parallel
CS267 L1 Intro.15 Demmel Sp 1999
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 about 3 Angstroms^2, the size of a small atom
r = .3 mm1 Tflop 1 TB sequential machine
CS267 L1 Intro.16 Demmel Sp 1999
Trends in Parallel Computing Performance
° 1 TFLOPS on Linpack, 12/16/96, ASCI Red (7264 Intel PPros)
° Up to 1.6 Tflops by 1/99, on ASCI Blue (5040 SGI R10ks)
° performance.netlib.org/performance/html/PDStop.html
iPSC/860nCUBE/2
CM2
CM-200 Delta
Paragon XP/S
CM-5 Paragon XP/S MP(1024)Cray T3D
C90
Ymp/832
0.1
1
10
100
1000
1985 1987 1989 1991 1993 1995
GF
LO
PS
MPPCray VPP
Xmp
Paragon XP/S MP (6768)
T932
ASCI red
CS267 L1 Intro.17 Demmel Sp 1999
Empirical Trends: Microprocessor Performance
C90
Ymp
Xmp
Xmp
Cray 1s
IBM Power2/990
MIPS R4400
HP9000/735
DEC Alpha AXPHP 9000/750
IBM RS6000/540
MIPS M/2000
MIPS M/120
Sun 4/2601
10
100
1000
10000
1975 1980 1985 1990 1995 2000
Lin
pa
ck
MF
LO
PS
Cray n=1000Cray n=100Micro n=1000Micro n=100
DEC 8200
T94
CS267 L1 Intro.18 Demmel Sp 1999
Microprocessor Clock Rate
0.1
1
10
100
1000
1970 1975 1980 1985 1990 1995 2000 2005
Year
Clo
ck
Ra
te (
MH
z)
CS267 L1 Intro.19 Demmel Sp 1999
Microprocessor Transistors
Pentium
R10000
R2000R3000
i8086
i8080
i80386
i80286
i4004
1,000
10,000
100,000
1,000,000
10,000,000
100,000,000
1970 1975 1980 1985 1990 1995 2000 2005
Year
Tra
nsis
tors
CS267 L1 Intro.20 Demmel Sp 1999
Microprocessor Transistors & Parallelism
Pentium
R10000
R2000R3000
i8086
i8080
i80386
i80286
i4004
1,000
10,000
100,000
1,000,000
10,000,000
100,000,000
1970 1975 1980 1985 1990 1995 2000 2005
Year
Tra
nsis
tors
Bit-LevelParallelism
Instruction-LevelParallelism
Thread-LevelParallelism?
CS267 L1 Intro.21 Demmel Sp 1999
Processor-DRAM Gap (latency)
µProc60%/yr.
DRAM7%/yr.
1
10
100
1000
1980
1981
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
DRAM
CPU1982
Processor-MemoryPerformance Gap:(grows 50% / year)
Per
form
ance
Time
“Moore’s Law”
CS267 L1 Intro.22 Demmel Sp 1999
1st Principles
° What happens when the feature size shrinks by a factor of x ?
° Clock rate goes up by x • actually less than x, because of power consumption
° Transistors per unit area goes up by x2
° Die size also tends to increase• typically another factor of ~x
° Raw computing power of the chip goes up by ~ x4 !• of which x3 is devoted either to parallelism or locality
CS267 L1 Intro.23 Demmel Sp 1999
Principles of Parallel Computing
° Parallelism and Amdahl’s Law
° Granularity
° Locality
° Load balance
° Coordination and synchronization
° Performance modeling
All of these things makes parallel programming even harder than sequential programming.
CS267 L1 Intro.24 Demmel Sp 1999
“Automatic” Parallelism in Modern Machines
° Bit level parallelism• within floating point operations, etc.
° Instruction level parallelism (ILP)• 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
Limits to all of these -- for very high performance, need user to identify, schedule and coordinate parallel tasks
CS267 L1 Intro.25 Demmel Sp 1999
Finding Enough Parallelism
° Suppose only part of an application seems parallel
° Amdahl’s law• let s be the fraction of work done sequentially, so
(1-s) is fraction parallelizable
• P = number of processors
Speedup(P) = Time(1)/Time(P)
<= 1/(s + (1-s)/P)
<= 1/s
° Even if the parallel part speeds up perfectly may be limited by the sequential part
CS267 L1 Intro.26 Demmel Sp 1999
Overhead of Parallelism
° Given enough parallel work, this is the biggest barrier to getting desired speedup
° Parallelism overheads include:• cost of starting a thread or process
• cost of communicating shared data
• cost of synchronizing
• extra (redundant) computation
° Each of these can be in the range of milliseconds (=millions of flops) on some systems
° Tradeoff: Algorithm needs sufficiently large units of work to run fast in parallel (I.e. large granularity), but not so large that there is not enough parallel work
CS267 L1 Intro.27 Demmel Sp 1999
Locality and Parallelism
° Large memories are slow, fast memories are small
° Storage hierarchies are large and fast on average
° Parallel processors, collectively, have large, fast $• the slow accesses to “remote” data we call “communication”
° Algorithm should do most work on local data
ProcCache
L2 Cache
L3 Cache
Memory
Conventional Storage Hierarchy
ProcCache
L2 Cache
L3 Cache
Memory
ProcCache
L2 Cache
L3 Cache
Memory
potentialinterconnects
CS267 L1 Intro.28 Demmel Sp 1999
Load Imbalance
° Load imbalance is the time that some processors in the system are idle due to
• insufficient parallelism (during that phase)
• unequal size tasks
° Examples of the latter• adapting to “interesting parts of a domain”
• tree-structured computations
• fundamentally unstructured problems
° Algorithm needs to balance load
CS267 L1 Intro.29 Demmel Sp 1999
Parallel Programming for Performance is Challenging
° Speedup(P) = Time(1) / Time(P)
° Applications have “learning curves”
Amber (chemical modeling)
0
10
20
30
40
50
60
70
0 20 40 60 80 100 120 140
Processors
Sp
eed
up
Vers. 12/94
Vers. 9/94
Vers. 8/94
CS267 L1 Intro Demmel Sp 1999
Course Organization
CS267 L1 Intro.31 Demmel Sp 1999
Schedule of Topics
° Introduction
° Parallel Programming Models and Machines• Shared Memory and Multithreading
• Distributed Memory and Message Passing
• Data parallelism
° Sources of Parallelism in Simulation
° Algorithms and Software Tools (depends on student interest)• Dense Linear Algebra
• Partial Differential Equations (PDEs)
• Particle methods
• Load balancing, synchronization techniques
• Sparse matrices
• Visualization (field trip to NERSC)
• Sorting and data management
• Metacomputing
° Applications (including guest lectures)
° Project Reports
CS267 L1 Intro.32 Demmel Sp 1999
Reading Materials
° 3 on-line texts• JD’s notes from CS267 Spring 1996
• Culler and Singh’s, Parallel Computer Architecture (CS258 text, first chapter on-line)
• Ian Fosters, “Designing and Building Parallel Programming”
° Papers, books to be on reserve
° the web (see class homepage for some pointers)
CS267 L1 Intro.33 Demmel Sp 1999
Computing Resources
° NOW• 100 Sun Ultrasparcs with a fast network
° 4 clustered Sun Enterprise 5000 8-proc SMPs
° Millennium prototype: clustered Intel SMPs
° Assorted other SMPs from IBM, DEC
° Possibly Cray T3E at NERSC for some projects of mutual interest
CS267 L1 Intro.34 Demmel Sp 1999
Requirements
° Fill out on-line account registration
° Fill out on-line survey, including available times for discussion section
° Weekly reading• be ready to discuss in class (10 %)
° ~4 programming assignments (25 %)• hands-on experience, interdisciplinary teams
• if you don’t do it yourself, you’ll drop when the project gets interesting
° Midterm (20 %)
° Final Project (45 %)• teams of 3 - interdisciplinary is best
• interesting applications or advance of systems
CS267 L1 Intro.35 Demmel Sp 1999
Projects
° Challenging team programming effort on a problem worth solving
° Conference quality publication
° Required presentation at end of semester
° Interdisciplinary (usually)
CS267 L1 Intro.36 Demmel Sp 1999
What you should get out of the course
In depth understanding of:
(1) how to apply parallel computers to demanding problems
(2) requirements of parallel applications (and their programmers)
(3) hardware, software, theory and practice of parallel computing
CS267 L1 Intro.37 Demmel Sp 1999
First Assignment
° See 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
° Evaluate the project. Was parallelism successful?
° Due one week from today (1/26)