并行程序设计

出版时间：2002-5  出版社：高等教育出版社  作者：Wilkinson  页数：431  字数：650000  

内容概要

本书以实践的方式介绍各种并行程序设计技术，使学生具有编写和评价并行程序的能力。并行程序设计提供了处理较大规模问题的能力，这些问题或者要求更多的运算步骤或者要求更大的存储空间。本书通过对顺序程序设计方法自然拓展的方式介绍并行程序设计，并发展出基于消息传递的并行程序设计技术，然后研究和探讨了在非数值与数值领域中一些特定问题的并行算法，如数值算法，图像处理、搜索和优化等。     本书内容不依赖于特定的多处理机系统，书中的并行程序都可运行于互联的工作站机群。各章之后都有一些来自于现实当中的问题。     作者Barry Wilkinson和Michael Allen均是北卡罗来纳大学计算机科学系教授，他们合作创建了内容全面的教学辅助网站，其中包括实例、作业以及使用MPI和PVM软件的教学辅助教材。这些材料，包括一些扩充的网页，用于帮助学生学习如何编译和运行并行程序以及实例程序。

书籍目录

PrefaceAbout the AuthorsPART I BASIC TECHNIQUES  CHAPTER 1 PARALLEL COMPUTERS    1.1 The Demand for Computational Speed    1.2 Types of Parallel Computers    1.3 Architectural Features of Message-Passing Multicomputers    1.4 Networked Computers as a Multicomputer Platform    1.5 Potential for Increased Computational Speed    1.6 Summary  CHAPTER 2 MESSAGE-PASSING COMPUTING    2.1 Basics of Message-Passing Programming    2.2 Using Workstation Clusters    2.3 Evaluating Parallel Programs    2.4 Debugging and Evaluating Parallel Programs    2.5 Summary  CHAPTER 3 EMBARRASSINGLY PARALLEL COMPUTATIONS    3.1 Ideal Paratle l Computation    3.2 Embarrassingly Parallel Examples    3.3 Summary  CHAPTER 4 PARTITIONING AND DIVIDE-AND-CONOUER STRATEGIES    4.1 Partitioning    4.2 Divide-and-Conquer Examples    4.3 Summary  CHAPTER 5 PIPELINED COMPUTATIONS    5.1 Pipeline Technique    5.2 Computing Platform for Pipelined Applications    5.3 Pipeline Program Examples    5.4 Summary  CHAPTER 6 SYNCHRONOUS COMPUTATIONS    6.1 Synchronization    6.2 Synchronized Computations    6.3 Synchronous Iteration Ptogram Examples    6.4 Summary  CHAPTER 7 LOAD BALANCING AND TERMINATfON DETECTION    7.1 Load Balancing    7.2 Dynamic Load Balancing    7.3 Distributed Termination Detection Algorithms    7.4 Program Example    7.5 Summary  CHAPTER 8 PROGRAMMING WITH SHARED MEMORY    8.1 Shared Memory Multiprocessors    8.2 Constructs for Specifying Parallelism    8.3 Sharing Data    8.4 Program Examples    8.5 SummaryPARTII ALGORITHMS AND APPLICATIONS  CHAPTER 9 SORTING ALGORITHMS    9.1 General    9.2 Compare-and-Exchange Soning Algorithms    9.3 Summary  CHAPTER 10 NUMERIOAL ALGORITHMS    1O.1 Matrices - A Review    10.2 Implementing Mauix Multiplication    1O.3 Solving a System of Linear Equations    10.4 Iterative Methods    1O.5 Summary  CHAPTER 11 IMAGE PROOESSING    11.1 Low-Level Image Processing    11.2 Point Proeessing    11.3 Histogram    11.4 Smoothing, Sharpening, and Noise Reduction    11.5 Edge Detection    11.6 The Hough Transform    11.7 Transformation into the Frequency Domain    11.8 Summary  CHAPTER 12 SEARCHfNG AND OPTMUZATION    12.1 Applications and Techniques    12.2 Branch-and-Bound Search    12.3 Genetic Algorithms    12.4 Successive Refinement    12.5 Hill Climbing    12.6 SummaryAPPENDIX A BASIC PVM ROUTINESAPPENDIX B BASIO MPI ROUTINESAPPENDIX C BASIC PTHREAD ROUTINESAPPENDIX D PARALLEL COMPUTA TION MODELSINDEX