亚洲国产精品无码中文字满,含羞草传媒一天能看一次下载

內(nèi)容簡介

　　在快速解決計算量大、數(shù)據(jù)密集型問題時，人們越采越認識到并行處理是惟一節(jié)省成本的方法。價格低廉的并行計算機（如商用桌面多處理機和工作站機群）的出現(xiàn)，使得這種并行方法的適用范圍越來越廣?，F(xiàn)在已經(jīng)為可移植的并行程序設(shè)計制定了專門的軟件標(biāo)準，為并行軟件的大幅度發(fā)展打好了基礎(chǔ)。事務(wù)處理。信息檢索．?dāng)?shù)據(jù)挖掘和分析以及多媒體服務(wù)等數(shù)據(jù)密集型應(yīng)用已經(jīng)為當(dāng)代的并行平臺提供了新的挑戰(zhàn)。計算生物學(xué)和納米技術(shù)等新興的領(lǐng)域?qū)Σ⑿杏嬎愕乃惴ê拖到y(tǒng)開發(fā)提供了前瞻性的啟示，而體系結(jié)構(gòu)，編程模型和應(yīng)用中的變化對如何使用戶以網(wǎng)格服務(wù)形式得到并行平臺也提供了一些啟發(fā)。本書討論了這些新技術(shù)的發(fā)展，也覆蓋了并行計算機處理的較傳統(tǒng)的問題．本書盡可能采用與體系結(jié)構(gòu)無關(guān)的觀點來對待抽象模型的底層平臺和設(shè)計算法。書中選擇MPI（MessagePassingInterface）、POSIX線程和OpenMP作為編程模型，并在不同例子中反映了并行計算的不斷變化的應(yīng)用組合。本書的主要特點：全面介紹并行計算的每個方面（體系結(jié)構(gòu)，編程范型。算法和標(biāo)準）既講述傳統(tǒng)的計算機科學(xué)算法（排序，搜索。圖和動態(tài)編程算法），也講述科學(xué)計算算法（矩陣計算、FFT）介紹MPI、Pthreads和OpenMP這三個應(yīng)用最廣泛的編寫可移植并行程序的標(biāo)準適合作為高等院校并行計算。并行編程，并行算法的設(shè)計和分析以及高性能計算課程的本科生和研究生的教材作者簡介AnanthGrama普度大學(xué)計算機科學(xué)系的副教授，研究領(lǐng)域是并行和分布式系統(tǒng)和應(yīng)用的不同方面。AnshuIGUptaIBMT．J．WatsonResearchCenter的研究人員，研究領(lǐng)域是并行算法和科學(xué)計算．GeorgeKarypis明尼蘇達大學(xué)計算機科學(xué)和工程系的副教授，研究領(lǐng)域是并行算法設(shè)計、數(shù)據(jù)挖掘和生物信息學(xué)等。VipinKumar明尼蘇達大學(xué)計算機科學(xué)和工程系的教授和軍用高性能計算研究中心的主管．研究領(lǐng)域是高性能計算。用子科學(xué)計算問題和數(shù)據(jù)挖掘的并行算法。

作者簡介

　　AnanthGrama普度大學(xué)計算機科學(xué)系的副教授，研究領(lǐng)域是并行和分布式系統(tǒng)和應(yīng)用的不同方面。AnshuIGUptaIBMT．J．WatsonResearchCenter的研究人員，研究領(lǐng)域是并行算法和科學(xué)計算。GeorgeKarypis明尼蘇達大學(xué)計算機科學(xué)和工程系的副教授，研究領(lǐng)域是并行算法設(shè)計、數(shù)據(jù)挖掘和生物信息學(xué)等。VipinKumar明尼蘇達大學(xué)計算機科學(xué)和工程系的教授和軍用高性能計算研究中心的主管、研究領(lǐng)域是高性能計算、用子科學(xué)計算問題和數(shù)據(jù)挖掘的并行算法。

圖書目錄

Introduction to Parallel Computing
1.1  Motivating Parallelism
1.2  Scope of Parallel Computing
1.3  Organization and Contents of the Text
1.4  Bibliographic Remarks
       Problems
CHAPTER 2
Parallel Programming Platforms
2.1  Implicit Parallelism: Trends in Microprocessor Architectures
2.2  Limitations of Memory System Performance*
2.3  Dichotomy of Parallel Computing Platforms
2.4  Physical Organization of Parallel Platforms
2.5  Communication Costs in Parallel Machines
2.6  Routing Mechanisms for Interconnection Networks
2.7  Impact of Process-Processor Mapping and Mapping Techniques
2.8  Bibliographic Remarks
       Problems
CHAPTER
Principles of Parallel Algorithm Design
3.1  Preliminaries
3.2  Decomposition Techniques
3.3  Characteristics of Tasks and Interactions
3.4  Mapping Techniques for Load Balancing
3.5  Methods for Containing Interaction Overheads
3.6  Parallel Algorithm Models
3.7  Bibliographic Remarks
        Problems
CHAPTER 4
Basic Communication Operations
4.1  One-to-All Broadcast and All-to-One Reduction
4.2  All-to-All Broadcast and Reduction
4.3  All-Reduce and Prefix-Sum Operations
4.4  Scatter and Gather
4.5  All-to-All Personalized Communication
4.6  Circular Shift
4.7  Improving the Speed of Some Communication Operations
4.8  Summary
4.9  Bibliographic Remarks
       Problems
CHAPTER 5
Analytical Modeling of Parallel Programs
5.1  Sources of Overhead in Parallel Programs
5.2  Performance Metrics for Parallel Systems
5.3  The Effect of Granularity on Performance
5.4  Scalability of Parallel Systems
5.5  Minimum Execution Time and Minimum Cost-Optimal Execution Time
5.6  Asymptotic Analysis of Parallel Programs
5.7  Other Scalability Metrics
5.8  Bibliographic Remarks
        Problems
CHAPTER 6
Programming Using the Message-Passing
Paradigm
6.1  Principles of Message-Passing Programming
6.2  The Building Blocks: Send and Receive Operations
6.3  MPI: the Message Passing Interface
6.4  Topologies and Embedding
6.5  Overlapping Communication with Computation
6.6  Collective Communication and Computation Operations
6.7  Groups and Communicators
6.8  Bibliographic Remarks
        Problems
CHAPTER 7
Programming Shared Address Space
Platforms
7.1  Thread Basics
7.2  Why Threads?
7.3  The POSIX Thread API
7.4  Thread Basics: Creation and Termination
7.5  Synchronization Primitives in Pthreads
7.6  Controlling Thread and Synchronization Attributes
7.7  Thread Cancellation
7.8  Composite Synchronization Constructs
7.9  Tips for Designing Asynchronous Programs
7.10 OpenMP: a Standard for Directive Based Parallel Programming
7.11 Bibliographic Remarks
        Problems
CHAPTER 8
Dense Matrix Algorithms
8.1  Matrix-Vector Multiplication
8.2  Matrix-Matrix Multiplication
8.3  Solving a System of Linear Equations
8.4  Bibliographic Remarks
        Problems
CHAPTER 9
Sorting
9.1  Issues in Sorting on Parallel Computers
9.2  Sorting Networks
9.3  Bubble Sort and its Variants
9.4  Quicksort
9.5  Bucket and Sample Sort
9.6  Other Sorting Algorithms
9.7  Bibliographic Remarks
        Problems
CHAPTER 10
Graph Algorithms
  10.1 Definitions and Representation
  10.2 Minimum Spanning Tree: Prim's Algorithm
  10.3 Single-Source Shortest Paths: Dijkstra's Algorithm
  10.4 All-Pairs Shortest Paths
  10.5 Transitive Closure
  10.6 Connected Components
  10.7 Algorithms for Sparse Graphs
   10.8 Bibliographic Remarks
         Problems
CHAPTER 11
Search Algorithms for Discrete Optimization
Problems
11.1 Definitions and Examples
11.2 Sequential Search Algorithms
11.3 Search Overhead Factor
11.4 Parallel Depth-First Search
11.5 Parallel Best-First Search
11.6 Speedup Anomalies in Parallel Search Algorithms
11.7 Bibliographic Remarks
       Problems
CHAPTER 12
Dynamic Programming
12.1 Overview of Dynamic Programming
12.2 Serial Monadic DP Formulations
12.3 Nonserial Monadic DP Formulations
12.4 Serial Polyadic DP Formulations
12.5 Nonserial Polyadic DP Formulations
12.6 Summary and Discussion
12.7 Bibliographic Remarks
       Problems
CHAPTER 13
Fast Fourier Transform
13.1 The Serial Algorithm
13.2 The Binary-Exchange Algorithm
13.3 The Transpose Algorithm
13.4 Bibliographic Remarks
       Problems
APPENDIX A
Complexity of Functions and Order Analysis
A. 1  Complexity of Functions
A.2  Order Analysis of Functions
Bibliography
Author Index
Subject Index