《并行程序设计导论》 第一章.ppt

Analysis (cont.) The difference is more dramatic with a larger number of cores. If we have 1000 cores: The first example would require the master to perform 999 receives and 999 additions. The second example would only require 10 receives and 10 additions. That’s an improvement of almost a factor of 100! Copyright ? 2010, Elsevier Inc. All rights Reserved . How do we write parallel programs? Task parallelism Partition various tasks carried out solving the problem among the cores. Data parallelism Partition the data used in solving the problem among the cores. Each core carries out similar operations on it’s part of the data. Copyright ? 2010, Elsevier Inc. All rights Reserved . Professor P Copyright ? 2010, Elsevier Inc. All rights Reserved 15 questions 300 exams . Professor P’s grading assistants Copyright ? 2010, Elsevier Inc. All rights Reserved TA#1 TA#2 TA#3 . . * * Copyright ? 2010, Elsevier Inc. All rights Reserved The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * The University of Adelaide, School of Computer Science * Chapter 2 — Instructions: Language of the Computer * Copyright ? 2010, Elsevier Inc. All rights Reserved Chapter 1 Why Parallel Computing? An Introduction to Parallel Programming Peter Pacheco Copyright ? 2010, Elsevier Inc. All rights Reserved Roadmap Why we need ever-increasing performance. Why we’re building parallel systems. Why we need to write parallel programs. How do we write parallel programs? What we’ll be doing. Concurrent, parallel, distributed! # Chapter Subtitle . Changing times Copyright ? 2010, Elsevier Inc. All rights Reserved From 1986 – 2002, microprocessors were speeding like a rocket, increasing in performance an average of 50% per year. Since then, it’s dropped to about 20% increase per year. . An intelligent solution Copyright ? 2010, Elsevier Inc. All rights Reserved Instead of designing and building faster microprocessors, put multiple processors on a sin