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

Description

Looking to take full advantage of multi-core processors with concurrent programming? As one of the few resources to focus on implementing algorithms in the shared-memory model of multi-core processors, rather than just on theoretical models or distributed-memory architectures, The Art of Concurrency provides the knowledge and hands-on experience you need. You'll get detailed explanations and usable samples to help you transform algorithms from serial to parallel code, along with advice and analysis to steer you clear of mistakes.  Read more... Abstract: Looking to take full advantage of multi-core processors with concurrent programming? As one of the few resources to focus on implementing algorithms in the shared-memory model of multi-core processors, rather than just on theoretical models or distributed-memory architectures, The Art of Concurrency provides the knowledge and hands-on experience you need. You'll get detailed explanations and usable samples to help you transform algorithms from serial to parallel code, along with advice and analysis to steer you clear of mistakes Content: The Art of Concurrency 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 1. Want to Go Faster? Raise Your Hands if You Want to Go Faster! Parallelism and Concurrency: What's the Difference? Why Do I Need to Know This? What's in It for Me? Isn't Concurrent Programming Hard? Aren't Threads Dangerous? Four Steps of a Threading Methodology Step 2. Design and Implementation: Threading the Algorithm Step 3. Test for Correctness: Detecting and Fixing Threading Errors. Step 4. Tune for Performance: Removing Performance BottlenecksWhat About Concurrency from Scratch? Background of Parallel Algorithms Distributed-Memory Programming Parallel Algorithms Literature Shared-Memory Programming Versus Distributed-Memory Programming Dividing work Sharing data Static/dynamic allocation of work Features Unique to Shared Memory Memory effects Communication in memory Mutual exclusion Producer/consumer Rea.