书籍详情
并行程序设计（技术与应用影印版）
作者：（美国）威尔金森等著
出版社：高等教育出版社
出版时间：2002-05-01
ISBN：9787040111620
定价：¥29.50
购买这本书可以去
内容简介
本书旨在介绍各种并行程序设计技术。主要考虑通过发送消息取得通信的计算机群组的应用，且讨论不依赖于某具体系统的技术和应用。本书分为两部分。第一部分是并行程序设计的基本技术，其间各章用简单问题来解析技术，覆盖了各个基础层面，这些技术本身可以被应用到更广范围的问题中去。学习第一部分要预先具备顺序程序设计的知识。很多并行计算问题有其独特的算法，第二部分在非数值型和数值型领域研究了面向特定问题的算法，学习这个部分需要一些数学概念的辅助。第二部分涵盖的问题包括分类、矩阵乘法、线性方程、偏微分方程、图像处理、搜索与优化。在各章结尾处都有一些从现实情况中而来的实际问题，它们不需要读者有特别的数学知识，是本书的一个特色。它发展了用并行程序设计技术解决问题的技巧，而不是让读者仅学会拘泥于解决特定问题。内容：第一部分基本技术1.并行计算机2.消息传递型计算3.令人为难的并行计算4.划分策略与分治策略5.流水线型计算6.同步计算7.负载均衡法与终止检测8.共享存储器程序设计第二部分算法与应用9.分类算法10.数值算法11.图像处理12.搜索与优化附录A基本的并行虚拟机规则附录B基本的消息传递接口规则附录C基本的P线程规则附录D并行计算模式
作者简介
暂缺《并行程序设计（技术与应用影印版）》作者简介
目录
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 Summary
PARTII 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 Summary
APPENDIX A BASIC PVM ROUTINES
APPENDIX B BASIO MPI ROUTINES
APPENDIX C BASIC PTHREAD ROUTINES
APPENDIX D PARALLEL COMPUTA TION MODELS
INDEX
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 Summary
PARTII 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 Summary
APPENDIX A BASIC PVM ROUTINES
APPENDIX B BASIO MPI ROUTINES
APPENDIX C BASIC PTHREAD ROUTINES
APPENDIX D PARALLEL COMPUTA TION MODELS
INDEX
猜您喜欢
