Patterns for Parallel Programming(Software Patterns Series) / Edition 1

by Timothy G. Mattson, Beverly A. Sanders, Berna L. Massingill

Overview

The Parallel Programming Guide for Every Software Developer

From grids and clusters to next-generation game consoles, parallel computing is going mainstream. Innovations such as Hyper-Threading Technology, HyperTransport Technology, and multicore microprocessors from IBM, Intel, and Sun are accelerating the movement's growth. Only one thing is missing: programmers with the skills to meet the soaring demand for parallel software.

That's where Patterns for Parallel Programming comes in. It's the first parallel programming guide written specifically to serve working software developers, not just computer scientists. The authors introduce a complete, highly accessible pattern language that will help any experienced developer "think parallel"-and start writing effective parallel code almost immediately. Instead of formal theory, they deliver proven solutions to the challenges faced by parallel programmers, and pragmatic guidance for using today's parallel APIs in the real world. Coverage includes:

• Understanding the parallel computing landscape and the challenges faced by parallel developers

• Finding the concurrency in a software design problem and decomposing it into concurrent tasks

• Managing the use of data across tasks

• Creating an algorithm structure that effectively exploits the concurrency you've identified

• Connecting your algorithmic structures to the APIs needed to implement them

• Specific software constructs for implementing parallel programs

• Working with today's leading parallel programming environments: OpenMP, MPI, and Java

Patterns have helped thousands of programmers master object-oriented development and other complex programming technologies. With this book, you will learn that they're the best way to master parallel programming too.

0321228111B08232004

Product Details

ISBN-13:	9780321228116
Publisher:	Addison-Wesley
Publication date:	09/10/2004
Series:	Software Patterns Series
Edition description:	New Edition
Pages:	355
Product dimensions:	7.31(w) x 9.56(h) x 1.00(d)

About the Author

Timothy G. Mattson is Intel's industry manager for life sciences. His research focuses on technologies that simplify parallel computing for general programmers, with an emphasis on computational biology. He holds a Ph.D. in chemistry from the University of California, Santa Cruz.

Beverly A. Sanders is associate professor at the Department of Computer and Information Science and Engineering, University of Florida, Gainesville. Her research focuses on techniques to help programmers construct high-quality, correct programs, including formal methods, component systems, and design patterns. She holds a Ph.D. in applied mathematics from Harvard University.

Berna L. Massingill is assistant professor in the Department of Computer Science at Trinity University, San Antonio, Texas. Her research interests include parallel and distributed computing, design patterns, and formal methods. She holds a Ph.D. in computer science from the California Institute of Technology.

0321228111AB08232004

Read an Excerpt

"If you build it, they will come."

And so we built them. Multiprocessor workstations, massively parallel supercomputers, a cluster in every department ... and they haven't come. Programmers haven't come to program these wonderful machines. Oh, a few programmers in love with the challenge have shown that most types of problems can be force-fit onto parallel computers, but general programmers, especially professional programmers who "have lives", ignore parallel computers. And they do so at their own peril. Parallel computers are going mainstream. Multithreaded microprocessors, multicore CPUs, multiprocessor PCs, clusters, parallel game consoles ... parallel computers are taking over the world of computing. The computer industry is ready to flood the market with hardware that will only run at full speed with parallel programs. But who will write these programs?

This is an old problem. Even in the early 1980s, when the "killer micros" started their assault on traditional vector supercomputers, we worried endlessly about how to attract normal programmers. We tried everything we could think of: high-level hardware abstractions, implicitly parallel programming languages, parallel language extensions, and portable message-passing libraries. But after many years of hard work, the fact of the matter is that "they" didn't come. The overwhelming majority of programmers will not invest the effort to write parallel software.

A common view is that you can't teach old programmers new tricks, so the problem will not be solved until the old programmers fade away and a new generation takes over.

But we don't buy into that defeatist attitude. Programmers have shown a remarkable ability to adopt new software technologies over the years. Look at how many old Fortran programmers are now writing elegant Java programs with sophisticated object-oriented designs. The problem isn't with old programmers. The problem is with old parallel computing experts and the way they've tried to create a pool of capable parallel programmers.

And that's where this book comes in. We want to capture the essence of how expert parallel programmers think about parallel algorithms and communicate that essential understanding in a way professional programmers can readily master. The technology we've adopted to accomplish this task is a pattern language. We made this choice not because we started the project as devotees of design patterns looking for a new field to conquer, but because patterns have been shown to work in ways that would be applicable in parallel programming. For example, patterns have been very effective in the field of object-oriented design. They have provided a common language experts can use to talk about the elements of design and have been extremely effective at helping programmers master object-oriented design.

This book contains our pattern language for parallel programming. The book opens with a couple of chapters to introduce the key concepts in parallel computing. These chapters focus on the parallel computing concepts and jargon used in the pattern language as opposed to being an exhaustive introduction to the field. The pattern language itself is presented in four parts corresponding to thefour phases of creating a parallel program:

Finding Concurrency. The programmer works in the problem domain to identify the available concurrency and expose it for use in the algorithm design.

Algorithm Structure. The programmer works with high-level structures for organizing a parallel algorithm.

Supporting Structures. We shift from algorithms to source code and consider how the parallel program will be organized and the techniques used to manage shared data.

Implementation Mechanisms. The final step is to look at specific software constructs for implementing a parallel program.

The patterns making up these four design spaces are tightly linked. You start at the top (Finding Concurrency), work through the patterns, and by the time you get to the bottom (Implementation Mechanisms), you will have a detailed design for your parallel program.

If the goal is a parallel program, however, you need more than just a parallel algorithm. You also need a programming environment and a notation for expressing the concurrency within the program's source code. Programmers used to be confronted by a large and confusing array of parallel programming environments. Fortunately, over the years the parallel programming community has converged around three programming environments.

OpenMP. A simple language extension to C, C++, or Fortran to write parallel programs for shared-memory computers.

MPI. A message-passing library used on clusters and other distributed-memory computers.

Java. An object-oriented programming language with language features supporting parallel programming on shared-memory computers and standard class libraries supporting distributed computing.

Many readers will already be familiar with one or more of these programming notations, but for readers completely new to parallel computing, we've included a discussion of these programming environments in the appendixes.

In closing, we have been working for many years on this pattern language. Presenting it as a book so people can start using it is an exciting development for us. But we don't see this as the end of this effort. We expect that others will have their own ideas about new and better patterns for parallel programming. We've assuredly missed some important features that really belong in this pattern language. We embrace change and look forward to engaging with the larger parallel computing community to iterate on this language. Over time, we'll update and improve the pattern language until it truly represents the consensus view of the parallel programming community. Then our real work will begin—using the pattern language to guide the creation of better parallel programming environments and helping people to use these technologies to write parallel software. We won't rest until the day sequential software is rare.

Table of Contents

Preface.

1. A Pattern Language for Parallel Programming.

Introduction.

Parallel Programming.

Design Patterns and Pattern Languages.

A Pattern Language for Parallel Programming.

2. Background and Jargon of Parallel Computing.

Concurrency in Parallel Programs Versus Operating Systems.

Parallel Architectures: A Brief Introduction.

Parallel Programming Environments.

The Jargon of Parallel Computing.

A Quantitative Look at Parallel Computation.

Communication.

Summary.

3. The Finding Concurrency Design Space.

About the Design Space.

The Task Decomposition Pattern.

The Data Decomposition Pattern.

The Group Tasks Pattern.

The Order Tasks Pattern.

The Data Sharing Pattern.

The Design Evaluation Pattern.

Summary.

4. The Algorithm Structure Design Space.

Introduction.

Choosing an Algorithm Structure Pattern.

Examples.

The Task Parallelism Pattern.

The Divide and Conquer Pattern.

The Geometric Decomposition Pattern.

The Recursive Data Pattern.

The Pipeline Pattern.

The Event-Based Coordination Pattern.

5. The Supporting Structures Design Space.

Introduction.

Forces.

Choosing the Patterns.

The SPMD Pattern.

The Master/Worker Pattern.

The Loop Parallelism Pattern.

The Fork/Join Pattern.

The Shared Data Pattern.

The Shared Queue Pattern.

The Distributed Array Pattern.

Other Supporting Structures.

6. The Implementation Mechanisms Design Space.

Overview.

UE Management.

Synchronization.

Communication.

Appendix A. A Brief Introduction to OpenMP.

Appendix B. A Brief Introduction to MPI.

Appendix C. A Brief Introduction to Concurrent Programming in Java.

Glossary.

Bibliography.

About the Authors.

Index.

Preface

"If you build it, they will come."

And so we built them. Multiprocessor workstations, massively parallel supercomputers, a cluster in every department ... and they haven't come. Programmers haven't come to program these wonderful machines. Oh, a few programmers in love with the challenge have shown that most types of problems can be force-fit onto parallel computers, but general programmers, especially professional programmers who "have lives", ignore parallel computers. And they do so at their own peril. Parallel computers are going mainstream. Multithreaded microprocessors, multicore CPUs, multiprocessor PCs, clusters, parallel game consoles ... parallel computers are taking over the world of computing. The computer industry is ready to flood the market with hardware that will only run at full speed with parallel programs. But who will write these programs?

This is an old problem. Even in the early 1980s, when the "killer micros" started their assault on traditional vector supercomputers, we worried endlessly about how to attract normal programmers. We tried everything we could think of: high-level hardware abstractions, implicitly parallel programming languages, parallel language extensions, and portable message-passing libraries. But after many years of hard work, the fact of the matter is that "they" didn't come. The overwhelming majority of programmers will not invest the effort to write parallel software.

A common view is that you can't teach old programmers new tricks, so the problem will not be solved until the old programmers fade away and a new generation takes over.

But we don't buy into that defeatist attitude. Programmers have shown a remarkable ability to adopt new software technologies over the years. Look at how many old Fortran programmers are now writing elegant Java programs with sophisticated object-oriented designs. The problem isn't with old programmers. The problem is with old parallel computing experts and the way they've tried to create a pool of capable parallel programmers.

And that's where this book comes in. We want to capture the essence of how expert parallel programmers think about parallel algorithms and communicate that essential understanding in a way professional programmers can readily master. The technology we've adopted to accomplish this task is a pattern language. We made this choice not because we started the project as devotees of design patterns looking for a new field to conquer, but because patterns have been shown to work in ways that would be applicable in parallel programming. For example, patterns have been very effective in the field of object-oriented design. They have provided a common language experts can use to talk about the elements of design and have been extremely effective at helping programmers master object-oriented design.

This book contains our pattern language for parallel programming. The book opens with a couple of chapters to introduce the key concepts in parallel computing. These chapters focus on the parallel computing concepts and jargon used in the pattern language as opposed to being an exhaustive introduction to the field. The pattern language itself is presented in four parts corresponding to thefour phases of creating a parallel program:

Finding Concurrency . The programmer works in the problem domain to identify the available concurrency and expose it for use in the algorithm design.

Algorithm Structure . The programmer works with high-level structures for organizing a parallel algorithm.

Supporting Structures . We shift from algorithms to source code and consider how the parallel program will be organized and the techniques used to manage shared data.

Implementation Mechanisms . The final step is to look at specific software constructs for implementing a parallel program.

The patterns making up these four design spaces are tightly linked. You start at the top (Finding Concurrency), work through the patterns, and by the time you get to the bottom (Implementation Mechanisms), you will have a detailed design for your parallel program.

If the goal is a parallel program, however, you need more than just a parallel algorithm. You also need a programming environment and a notation for expressing the concurrency within the program's source code. Programmers used to be confronted by a large and confusing array of parallel programming environments. Fortunately, over the years the parallel programming community has converged around three programming environments.

OpenMP. A simple language extension to C, C++, or Fortran to write parallel programs for shared-memory computers.

MPI. A message-passing library used on clusters and other distributed-memory computers.

Java. An object-oriented programming language with language features supporting parallel programming on shared-memory computers and standard class libraries supporting distributed computing.

Many readers will already be familiar with one or more of these programming notations, but for readers completely new to parallel computing, we've included a discussion of these programming environments in the appendixes.

In closing, we have been working for many years on this pattern language. Presenting it as a book so people can start using it is an exciting development for us. But we don't see this as the end of this effort. We expect that others will have their own ideas about new and better patterns for parallel programming. We've assuredly missed some important features that really belong in this pattern language. We embrace change and look forward to engaging with the larger parallel computing community to iterate on this language. Over time, we'll update and improve the pattern language until it truly represents the consensus view of the parallel programming community. Then our real work will begin--using the pattern language to guide the creation of better parallel programming environments and helping people to use these technologies to write parallel software. We won't rest until the day sequential software is rare.

0321228111P08232004