Parallel Programming in C with MPI and OpenMP

ISBN-10: 0072822562
ISBN-13: 9780072822564
Edition: 2004
Authors: Michael J. Quinn
List price: $133.13
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Business Ethics Online content $4.95 $1.99
Add to cart
Study Briefs
Business Law Online content $4.95 $1.99
Add to cart
Study Briefs
Management Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $133.13
Copyright year: 2004
Publisher: McGraw-Hill Higher Education
Publication date: 6/5/2003
Binding: Hardcover
Pages: 544
Size: 7.25" wide x 9.00" long x 0.75" tall
Weight: 2.244
Language: English

Preface
Motivation and History
Introduction
Modern Scientific Method
Evolution of Supercomputing
Modern Parallel Computers
Seeking Concurrency
Data Clustering
Programming Parallel Computers
Summary
Key Terms
Bibliographic Notes
Exercises
Parallel Architectures
Introduction
Interconnection Networks
Processor Arrays
Multiprocessors
Multicomputers
Flynn's Taxonomy
Summary
Key Terms
Bibliographic Notes
Exercises
Parallel Algorithm Design
Introduction
The Task/Channel Model
Foster's Design Methodology
Boundary Value Problem
Finding the Maximum
The n-Body Problem
Adding Data Input
Summary
Key Terms
Bibliographic Notes
Exercises
Message-Passing Programming
Introduction
The Message-Passing Model
The Message-Passing Interface
Circuit Satisfiability
Introducing Collective Communication
Benchmarking Parallel Performance
Summary
Key Terms
Bibliographic Notes
Exercises
The Sieve of Eratosthenes
Introduction
Sequential Algorithm
Sources of Parallelism
Data Decomposition Options
Developing the Parallel Algorithm
Analysis of Parallel Sieve Algorithm
Documenting the Parallel Program
Benchmarking
Improvements
Summary
Key Terms
Bibliographic Notes
Exercises
Floyd's Algorithm
Introduction
The All-Pairs Shortest-Path Problem
Creating Arrays at Run Time
Designing the Parallel Algorithm
Point-to-Point Communication
Documenting the Parallel Program
Analysis and Benchmarking
Summary
Key Terms
Bibliographic Notes
Exercises
Performance Analysis
Introduction
Speedup and Efficiency
Amdahl's Law
Gustafson-Barsis's Law
The Karp-Flatt Metric
The Isoefficiency Metric
Summary
Key Terms
Bibliographic Notes
Exercises
Matrix-Vector Multiplication
Introduction
Sequential Algorithm
Data Decomposition Options
Rowwise Block-Striped Decomposition
Columnwise Block-Striped Decomposition
Checkerboard Block Decomposition
Summary
Key Terms
Bibliographic Notes
Exercises
Document Classification
Introduction
Parallel Algorithm Design
Nonblocking Communications
Documenting the Parallel Program
Enhancements
Summary
Key Terms
Bibliographic Notes
Exercises
Monte Carlo Methods
Introduction
Sequential Random Number Generators
Parallel Random Number Generators
Other Random Number Distributions
Case Studies
Summary
Key Terms
Bibliographic Notes
Exercises
Matrix Multiplication
Introduction
Sequential Matrix Multiplication
Rowwise Block-Striped Parallel Algorithm
Cannon's Algorithm
Summary
Key Terms
Bibliographic Notes
Exercises
Solving Linear Systems
Introduction
Terminology
Back Substitution
Gaussian Elimination
Iterative Methods
The Conjugate Gradient Method
Summary
Key Terms
Bibliographic Notes
Exercises
Finite Difference Methods
Introduction
Partial Differential Equations
Vibrating String
Steady-State Heat Distribution
Summary
Key Terms
Bibliographic Notes
Exercises
Sorting
Introduction
Quicksort
A Parallel Quicksort Algorithm
Hyperquicksort
Parallel Sorting by Regular Sampling
Summary
Key Terms
Bibliographic Notes
Exercises
The Fast Fourier Transform
Introduction
Fourier Analysis
The Discrete Fourier Transform
The Fast Fourier Transform
Parallel Program Design
Summary
Key Terms
Bibliographic Notes
Exercises
Combinatorial Search
Introduction
Divide and Conquer
Backtrack Search
Parallel Backtrack Search
Distributed Termination Detection
Branch and Bound
Parallel Branch and Bound
Searching Game Trees
Parallel Alpha-Beta Search
Summary
Key Terms
Bibliographic Notes
Exercises
Shared-Memory Programming
Introduction
The Shared-Memory Model
Parallel for Loops
Declaring Private Variables
Critical Sections
Reductions
Performance Improvements
More General Data Parallelism
Functional Parallelism
Summary
Key Terms
Bibliographic Notes
Exercises
Combining MPI and OpenMP
Introduction
Conjugate Gradient Method
Jacobi Method
Summary
Exercises
MPI Functions
Utility Functions
Header File MyMPI.h
Source File MyMPI.c
Debugging MPI Programs
Introduction
Typical Bugs in MPI Programs
Practical Debugging Strategies
Review of Complex Numbers
OpenMP Functions
Bibliography
Author Index
Subject Index

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×