Add NoteAdd Note

HighlightHighlight

CopyCopy

ZoomZoom

PrintPrint

HelpHelp

PreviousPrevious

NextNext

« Back to My CourseSmart

Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers, Second Edition

by Barry Wilkinson - University of North Carolina at Charlotte Western Carolina University; Michael Allen - University of North Carolina at Charlotte

eTextbook digital rental: 180 days

Our Price: $51.99

Regular Price: $129.00

You save: $77.01

Available Online Only

Add to Cart

Free Trial

Access sample pages from your bookshelf. Take notes, highlight, print and more!

Start Free Trial

Tabs for Contents, notes, highlights

Hide Contents, Notes, and Highlights

Search TermsShow Hide

« Back to eTextbook

Copyright, ii
Preface, iv
About the Authors, xi
I. Basic Techniques, 1
1. Parallel Computers, 2
1.1. The Demand for Computational Speed, 3
1.2. Potential for Increased Computational Speed, 6
1.3. Types of Parallel Computers, 13
1.4. Cluster Computing, 26
1.5. Summary, 38
Further Reading, 38
Bibliography, 39
Problems, 41
2. Message-Passing Computing, 42
2.1. Basics of Message-Passing Programming, 42
2.2. Using a Cluster of Computers, 51
2.3. Evaluating Parallel Programs, 62
2.4. Debugging and Evaluating Parallel Programs Empirically, 70
2.5. Summary, 75
Further Reading, 75
Bibliography, 76
Problems, 77
3. Embarrassingly Parallel Computations, 79
3.1. Ideal Parallel Computation, 79
3.2. Embarrassingly Parallel Examples, 81
3.3. Summary, 98
Further Reading, 99
Bibliography, 99
Problems, 100
4. Partitioning and Divide-and-Conquer Strategies, 106
4.1. Partitioning, 106
4.2. Partitioning and Divide-and-Conquer Examples, 117
4.3. Summary, 131
Further Reading, 131
Bibliography, 132
Problems, 133
5. Pipelined Computations, 140
5.1. Pipeline Technique, 140
5.2. Computing Platform for Pipelined Applications, 144
5.3. Pipeline Program Examples, 145
5.4. Summary, 157
Further Reading, 158
Bibliography, 158
Problems, 158
6. Synchronous Computations, 163
6.1. Synchronization, 163
6.2. Synchronized Computations, 170
6.3. Synchronous Iteration Program Examples, 174
6.4. Partially Synchronous Methods, 191
6.5. Summary, 193
Further Reading, 193
Bibliography, 193
Problems, 194
7. Load Balancing and Termination Detection, 201
7.1. Load Balancing, 201
7.2. Dynamic Load Balancing, 203
7.3. Distributed Termination Detection Algorithms, 210
7.4. Program Example, 214
7.5. Summary, 223
Further Reading, 223
Bibliography, 224
Problems, 225
8. Programming with Shared Memory, 230
8.1. Shared Memory Multiprocessors, 230
8.2. Constructs for Specifying Parallelism, 232
8.3. Sharing Data, 239
8.4. Parallel Programming Languages and Constructs, 247
8.5. OpenMP, 253
8.6. Performance Issues, 258
8.7. Program Examples, 265
8.8. Summary, 271
Further Reading, 272
Bibliography, 272
Problems, 273
9. Distributed Shared Memory Systems and Programming, 279
9.1. Distributed Shared Memory, 279
9.2. Implementing Distributed Shared Memory, 281
9.3. Achieving Consistent Memory in a DSM System, 284
9.4. Distributed Shared Memory Programming Primitives, 286
9.5. Distributed Shared Memory Programming, 290
9.6. Implementing a Simple DSM System, 291
9.7. Summary, 297
Further Reading, 297
Bibliography, 297
Problems, 298
II. Algorithms and Applications, 301
10. Sorting Algorithms, 302
10.1. General, 303
10.2. Compare-and-Exchange Sorting Algorithms, 304
10.3. Sorting on Specific Networks, 320
10.4. Other Sorting Algorithms, 327
10.5. Summary, 335
Further Reading, 335
Bibliography, 336
Problems, 337
11. Numerical Algorithms, 340
11.1. Matrices — A Review, 340
11.2. Implementing Matrix Multiplication, 342
11.3. Solving a System of Linear Equations, 352
11.4. Iterative Methods, 356
11.5. Summary, 365
Further Reading, 365
Bibliography, 365
Problems, 366
12. Image Processing, 370
12.1. Low-Level Image Processing, 370
12.2. Point Processing, 372
12.3. Histogram, 373
12.4. Smoothing, Sharpening, and Noise Reduction, 374
12.5. Edge Detection, 379
12.6. The Hough Transform, 383
12.7. Transformation into the Frequency Domain, 387
12.8. Summary, 400
Further Reading, 401
Bibliography, 401
Problems, 403
13. Searching and Optimization, 406
13.1. Applications and Techniques, 406
13.2. Branch-and-Bound Search, 407
13.3. Genetic Algorithms, 411
13.4. Successive Refinement, 423
13.5. Hill Climbing, 424
Bibliography, 429
Problems, 430
A. Basic MPI Routines, 437
Preliminaries, 437
Point-to-Point Message-Passing, 438
B. Basic PThread Routines, 444
Thread Management, 444
Thread Synchronization, 446
Bibliography, 448
C. OpenMP Directives, Library Functions, and Environment Variables, 449
General, 449
Parallel Regions, 450
Work-Sharing, 450
Directives/Constructs, 451
Clauses, 453
Library Functions, 455
Environment Variables, 459
Bibliography, 459
Index, I-1-1

Search Results

« Back to eTextbook


PAGE	Description

6	...

Tabs for Contents, notes, highlights

Table of Contents

Search Results