CSE 260 Parallel Computation. Allan Snavely, Henri Casanova email@example.com firstname.lastname@example.org http://www.sdsc.edu/~allans/cs260/cs260.htm. Outline. Introductions Why we need powerful computers Why powerful computers are parallel Issues in parallel performance
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Allan Snavely, Henri Casanova
Thanks to Kathy Yelick and Jim Demmel , and John Gilbert at UCB for some of these slides.
Mega Mflop/s = 106 flop/sec Mbyte = 106 byte
(also 220 = 1048576)
Giga Gflop/s = 109 flop/sec Gbyte = 109 byte
(also 230 = 1073741824)
Tera Tflop/s = 1012 flop/sec Tbyte = 1012 byte
(also 240 = 10995211627776)
Peta Pflop/s = 1015 flop/sec Pbyte = 1015 byte
(also 250 = 1125899906842624)
Exa Eflop/s = 1018 flop/sec Ebyte = 1018 byte
f(latitude, longitude, elevation, time)
temperature, pressure, humidity, wind velocity
Slide source: Warfield et al.
Moore’s Law: #transistors/chip doubles every 1.5 years
Gordon Moore (co-founder of Intel) predicted in 1965 that the transistor density of semiconductor chips would double roughly every 18 months.
Microprocessors have become smaller, denser, and more powerful.
Slide source: Jack Dongarra
1 Tflop 1 TB sequential machine
r = .3 mm
There are limits to all of these -- for very high performance, user must identify, schedule and coordinate parallel tasks
Speedup(P) = Time(1)/Time(P)
<= 1/(s + (1-s)/P)
Parallel Computing Today
Small class Beowulf cluster