并行程序設(shè)計(jì)

內(nèi)容概要

本書以實(shí)踐的方式介紹各種并行程序設(shè)計(jì)技術(shù)，使學(xué)生具有編寫和評(píng)價(jià)并行程序的能力。并行程序設(shè)計(jì)提供了處理較大規(guī)模問題的能力，這些問題或者要求更多的運(yùn)算步驟或者要求更大的存儲(chǔ)空間。本書通過對(duì)順序程序設(shè)計(jì)方法自然拓展的方式介紹并行程序設(shè)計(jì)，并發(fā)展出基于消息傳遞的并行程序設(shè)計(jì)技術(shù)，然后研究和探討了在非數(shù)值與數(shù)值領(lǐng)域中一些特定問題的并行算法，如數(shù)值算法，圖像處理、搜索和優(yōu)化等。     本書內(nèi)容不依賴于特定的多處理機(jī)系統(tǒng)，書中的并行程序都可運(yùn)行于互聯(lián)的工作站機(jī)群。各章之后都有一些來自于現(xiàn)實(shí)當(dāng)中的問題。     作者Barry Wilkinson和Michael Allen均是北卡羅來納大學(xué)計(jì)算機(jī)科學(xué)系教授，他們合作創(chuàng)建了內(nèi)容全面的教學(xué)輔助網(wǎng)站，其中包括實(shí)例、作業(yè)以及使用MPI和PVM軟件的教學(xué)輔助教材。這些材料，包括一些擴(kuò)充的網(wǎng)頁，用于幫助學(xué)生學(xué)習(xí)如何編譯和運(yùn)行并行程序以及實(shí)例程序。

書籍目錄

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

圖書封面

評(píng)論、評(píng)分、閱讀與下載

---

    并行程序設(shè)計(jì) PDF格式下載

---