國立虎尾科技大學 |

Language: English

Back

The art of concurrency /

Breshears, Clay.

The art of concurrency /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	The art of concurrency // Clay Breshears.
Author:	Breshears, Clay.
Published:	Farnham :O'Reilly, : 2009.,
Description:	xiii, 285 p. :ill. ; : 24 cm.;
Notes:	Includes index.
Subject:	Parallel programming (Computer science) -
ISBN:	9780596521530 (pbk.) :

The art of concurrency /
Breshears, Clay.

The art of concurrency /Clay Breshears. - Farnham :O'Reilly,2009. - xiii, 285 p. :ill. ;24 cm. - Theory in practice.

Includes index.

1. Want 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 -- 2. Concurrent Or Not Concurrent? -- Design Models for Concurrent Algorithms -- What's Not Parallel -- 3. Proving 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 -- 4. Eight Simple Rules for Designing Multi-Threaded 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 -- 5. Threading Libraries -- Implicit Threading -- Explicit Threading -- What Else Is Out There? -- Domain-Specific Libraries -- 6. Parallel Sum and Prefix Scan -- Parallel Sum -- Prefix Scan -- Selection -- Final Thought -- 7. Mapreduce -- Map As a Concurrent Operation -- Reduce As a Concurrent Operation -- Applying MapReduce -- MapReduce As Generic Concurrency -- 8. Sorting -- Bubblesort -- Odd-Ellen Transposition Sort -- Shellsort -- Quicksort -- Radix Sort -- 9. Searching -- Unsorted Sequence -- Binary Search -- 10. Graph Algorithms -- Depth-First Search -- All-Pairs Shortest Path -- Minimum Spanning Tree -- 11. Threading Tools -- Debuggers -- Performance Tools -- Anything Else Out There? -- Go Forth and Conquer.

Clay Breshears helps programmers develop parallel code algorithms for multi-core processors, including ways to keep algorithms as scalable as possible to take advantage of processors in the future that will have an even larger number of cores.

ISBN: 9780596521530 (pbk.) :NT1352

LCCN: 2010487098

Nat. Bib. No.: GBA8D6778bnbSubjects--Topical Terms:

557472
Parallel programming (Computer science)

LC Class. No.: QA76.642 / .B74 2009

Dewey Class. No.: 005.275

The art of concurrency /
LDR:02959cam a2200265 a 4500 001 788825
003 OCoLC
005 20140924054634.0
008 141013s2009 cc a 001 0 eng
010 $a 2010487098
015 $2 bnb $a GBA8D6778
020 $a 9780596521530 (pbk.) : $c NT1352
020 $a 0596521537 (pbk.)
035 $a (OCoLC)263978506
035 $a ocn263978506
040 $a UKM $b eng $c UKM $d BTCTA $d YDXCP $d BWX $d C#P $d CDX $d UKWOH $d DLC $d BDX $d LHU $d Z#U $d OCLCF $d OCLCQ $d NFU
042 $a ukblcatcopy
050 # 4 $a QA76.642 $b .B74 2009
082 0 4 $2 22 $a 005.275
100 1 $a Breshears, Clay. $3 984766
245 1 4 $a The art of concurrency / $c Clay Breshears.
260 # $a Farnham : $c 2009. $b O'Reilly,
300 $a xiii, 285 p. : $b ill. ; $c 24 cm.
490 0 $a Theory in practice
500 $a Includes index.
505 0 # $a 1. Want 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 -- 2. Concurrent Or Not Concurrent? -- Design Models for Concurrent Algorithms -- What's Not Parallel -- 3. Proving 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 -- 4. Eight Simple Rules for Designing Multi-Threaded 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 -- 5. Threading Libraries -- Implicit Threading -- Explicit Threading -- What Else Is Out There? -- Domain-Specific Libraries -- 6. Parallel Sum and Prefix Scan -- Parallel Sum -- Prefix Scan -- Selection -- Final Thought -- 7. Mapreduce -- Map As a Concurrent Operation -- Reduce As a Concurrent Operation -- Applying MapReduce -- MapReduce As Generic Concurrency -- 8. Sorting -- Bubblesort -- Odd-Ellen Transposition Sort -- Shellsort -- Quicksort -- Radix Sort -- 9. Searching -- Unsorted Sequence -- Binary Search -- 10. Graph Algorithms -- Depth-First Search -- All-Pairs Shortest Path -- Minimum Spanning Tree -- 11. Threading Tools -- Debuggers -- Performance Tools -- Anything Else Out There? -- Go Forth and Conquer.
520 8 $a Clay Breshears helps programmers develop parallel code algorithms for multi-core processors, including ways to keep algorithms as scalable as possible to take advantage of processors in the future that will have an even larger number of cores.
650 # 0 $a Parallel programming (Computer science) $3 557472