23 Parallel Part 1

23 Parallel Part 1 - Parallel Algorithms, Part 1 15-211:...

Info iconThis preview shows pages 1–14. Sign up to view the full content.

View Full Document Right Arrow Icon
Parallel Algorithms, Part 1 15-211: Fundamental Data Structures and Algorithms Margaret Reid-Miller 13 April 2010
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Announcements HW 6 (Chess) has been released Theory due: Tuesday, April 27 in lecture Program due: Wednesday, April 29 at 11:59pm You may have a partner Late days = max of partners’ late days No class Thursday – Carnival!
Background image of page 2
3 Announcements ACM @ CMU Programming Competition Open to all students Teams of 2 Saturday, April 24, 1:00 pm- 4:00 pm To enter, email [email protected] Prizes!! Amazon Gift Cards and other goodies
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Last time… Linear-time sorting Bucket sort, radix sort Median-finding and order statistics
Background image of page 4
5 Today Parallel Algorithms Models & terminology Parallel sum Prefix sum Quicksort
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Parallelism occurs everywhere n-body simulation computational fluid dynamics (airfoils) finite elements – structural design computer graphics – rendering, texture mapping protein folding 6
Background image of page 6
Masses of data Web searches / web catalogs Genome Financial Store purchases (Walmart) Simulations Animations CAT scans and MRIs Estimated devices generate one zettabyte (2 21 bytes) per year! 7
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
8 In the beginning … Moore’s Law The number of transistors on a chip doubles about every 2 years. Result: Until recently uniprocessor speeds per unit cost doubled every 18 months.
Background image of page 8
9 Processor Performance From Hennessy & Patterson, 2007 RISC Performance (vs. VAX-11/780) “power wall”
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10 Power wall Problem: Higher clock rates more heat to dissipate per chip. Solution: Use multiple, slower processors (“cores”) per chip: multicores are more power efficient. Moore's Law continues! CPU clock speeds do not.
Background image of page 10
11 Moore’s Law revisited The number of cores per chip will likely double every 2(?) years. Currently: A few cores/processors help workloads of a mix of independent serial tasks. Near future: Need to be able to use these (possibly hundreds of) cores/processors to make individual tasks faster. Hence: Every programmer needs to know how to design parallel algorithms!
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Parallelism at many architectural levels Logic gates: computer instructions executed by millions of logic gates Pipelining: overlap multiple instructions to increase clock rate MMX/Vector instructions: eg, graphics chips do vector arithmetic in parallel Multithreading: use multiple functional units and hide latency on single core * Multicores, supercomputers, clusters 12
Background image of page 12
13 Parallelism Computer: The ability to perform multiple operations simultaneously. Algorithm:
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 14
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 05/10/2011.

Page1 / 42

23 Parallel Part 1 - Parallel Algorithms, Part 1 15-211:...

This preview shows document pages 1 - 14. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online