Inhaltsverzeichnis von The Art of Concurrency : A Thread Monkey's Guide to Writing Parallel Applications

- Weitere Informationen zu diesem Buch:
  Inhaltsverzeichnis | Kolophon | Rezensionen |

JETZT ONLINE BESTELLEN

The Art of Concurrency
A Thread Monkey's Guide to Writing Parallel Applications

By Clay Breshears

First Edition Juni 2009
ISBN 978-0-596-52153-0

302 Seiten

EUR37.00

Weitere Informationen zu diesem Buch

Inhaltsverzeichnis | Kolophon | Rezensionen |

Inhaltsverzeichnis

Preface
1. Why Should You Read This Book?
2. Who Is This Book For?
3. What’s in This Book?
4. Conventions Used in This Book
5. Using Code Examples
6. Comments and Questions
7. Safari® Books Online
8. Acknowledgments

Chapter 1Want to Go Faster? Raise Your Hands if You Want to Go Faster!
1. Some Questions You May Have
2. Four Steps of a Threading Methodology
3. Background of Parallel Algorithms
4. Shared-Memory Programming Versus Distributed-Memory Programming
5. This Book’s Approach to Concurrent Programming
Chapter 2Concurrent or Not Concurrent?
1. Design Models for Concurrent Algorithms
2. What’s Not Parallel
Chapter 3Proving Correctness and Measuring Performance
1. Verification of Parallel Algorithms
2. Example: The Critical Section Problem
3. Performance Metrics (How Am I Doing?)
4. Review of the Evolution for Supporting Parallelism in Hardware
Chapter 4Eight Simple Rules for Designing Multithreaded Applications
1. Rule 1: Identify Truly Independent Computations
2. Rule 2: Implement Concurrency at the Highest Level Possible
3. Rule 3: Plan Early for Scalability to Take Advantage of Increasing Numbers of Cores
4. Rule 4: Make Use of Thread-Safe Libraries Wherever Possible
5. Rule 5: Use the Right Threading Model
6. Rule 6: Never Assume a Particular Order of Execution
7. Rule 7: Use Thread-Local Storage Whenever Possible or Associate Locks to Specific Data
8. Rule 8: Dare to Change the Algorithm for a Better Chance of Concurrency
9. Summary
Chapter 5Threading Libraries
1. Implicit Threading
2. Explicit Threading
3. What Else Is Out There?
4. Domain-Specific Libraries
Chapter 6Parallel Sum and Prefix Scan
1. Parallel Sum
2. Prefix Scan
3. Selection
4. A Final Thought
Chapter 7MapReduce
1. Map As a Concurrent Operation
2. Reduce As a Concurrent Operation
3. Applying MapReduce
4. MapReduce As Generic Concurrency
Chapter 8Sorting
1. Bubblesort
2. Odd-Even Transposition Sort
3. Shellsort
4. Quicksort
5. Radix Sort
Chapter 9Searching
1. Unsorted Sequence
2. Binary Search
Chapter 10Graph Algorithms
1. Depth-First Search
2. All-Pairs Shortest Path
3. Minimum Spanning Tree
Chapter 11Threading Tools
1. Debuggers
2. Performance Tools
3. Anything Else Out There?
4. Go Forth and Conquer

Inhaltsverzeichnis

Preface

Why Should You Read This Book?

Who Is This Book For?

What’s in This Book?

Conventions Used in This Book

Using Code Examples

Comments and Questions

Safari® Books Online

Acknowledgments

Chapter 1Want to Go Faster? Raise Your Hands if You Want to Go Faster!

Some Questions You May Have

Four Steps of a Threading Methodology

Background of Parallel Algorithms

Shared-Memory Programming Versus Distributed-Memory Programming

This Book’s Approach to Concurrent Programming

Chapter 2Concurrent or Not Concurrent?

Design Models for Concurrent Algorithms

What’s Not Parallel

Chapter 3Proving Correctness and Measuring Performance

Verification of Parallel Algorithms

Example: The Critical Section Problem

Performance Metrics (How Am I Doing?)

Review of the Evolution for Supporting Parallelism in Hardware

Chapter 4Eight Simple Rules for Designing Multithreaded Applications

Rule 1: Identify Truly Independent Computations

Rule 2: Implement Concurrency at the Highest Level Possible

Rule 3: Plan Early for Scalability to Take Advantage of Increasing Numbers of Cores

Rule 4: Make Use of Thread-Safe Libraries Wherever Possible

Rule 5: Use the Right Threading Model

Rule 6: Never Assume a Particular Order of Execution

Rule 7: Use Thread-Local Storage Whenever Possible or Associate Locks to Specific Data

Rule 8: Dare to Change the Algorithm for a Better Chance of Concurrency

Summary

Chapter 5Threading Libraries

Implicit Threading

Explicit Threading

What Else Is Out There?

Domain-Specific Libraries

Chapter 6Parallel Sum and Prefix Scan

Parallel Sum

Prefix Scan

Selection

A Final Thought

Chapter 7MapReduce

Map As a Concurrent Operation

Reduce As a Concurrent Operation

Applying MapReduce

MapReduce As Generic Concurrency

Chapter 8Sorting

Bubblesort

Odd-Even Transposition Sort

Shellsort

Quicksort

Radix Sort

Chapter 9Searching

Unsorted Sequence

Binary Search

Chapter 10Graph Algorithms

Depth-First Search

All-Pairs Shortest Path

Minimum Spanning Tree

Chapter 11Threading Tools

Debuggers

Performance Tools

Anything Else Out There?

Go Forth and Conquer

Glossary

Photo Credits

Colophon

Themen

Buchreihen

Special Interest

International Sites