product iamge

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

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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  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

Author(s): Breshears, Clay
Publisher: O'Reilly Media, Inc
Year: 2009

Language: English
Pages: 366
City: Sebastopol
Tags: Parallel programming (Computer science)

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.