Parallel Processing Computer Science并行处理计算机科学.pptVIP

Parallel Processing A Perspective Hardware and Software Introduction to PP From “Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design”, R. Halverson Chapter 1 – Introduction to Parallel Processing Parallel Processing Research 1980’s – Great Deal of Research Publications 1990’s – Hardware not too successful so the research area “dies” – Why??? Early 2000’s – Begins Resurgence? Why??? Will it continue to be successful this time ??? Goal of PP Why bother with Parallel Processing? Goal: Solve problems faster! In reality, faster but efficient! Work-Optimal: parallel algorithm runs faster than sequential algorithm in proportion to the number of processors used. Sometimes work-optimal is seemingly not possible PP Issues Processors: number, connectivity, communication Memory: shared vs. local Data structures Data Distribution Problem Solving Strategies Parallel Problems One Approach: Try to develop a parallel solution to a problem without consideration of the hardware. Apply: Apply the solution to the specific hardware and determine the extra cost, if any If not acceptably efficient, try again! Parallel Problems Another Approach: Armed with the knowledge of strategies, data structures, etc. that work well for a particular hardware, develop a solution with a specific hardware in mind. Third Approach: Modify a solution for one hardware configuration for another Real World Problems Inherently Parallel – nature or structure of the problem lends itself to parallelism Examples Mowing a lawn Cleaning a house Grading papers Problems are easily divided into sub-problems; very little overhead Real World Problems Not Inherently Parallel – parallelism is possible but more complex to define or with (excessive) overhead cost Examples Balancing a checkbook Giving a haircut Wallpapering a room Some Computer Problems Are these “inherently parallel” or not? Processing customers’ monthly bills Payroll checks Buildin