Foundations of Multithreaded, Parallel, and Distributed Programming

ISBN-10: 0201357526

ISBN-13: 9780201357523

Edition: 2000

List price: $123.60 Buy it from $107.43
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: Foundations of Multithreaded, Parallel, and Distributed Programming covers, and then applies, the core concepts and techniques needed for an introductory course in this subject. Its emphasis is on the practice and application of parallel systems, using real-world examples throughout. Greg Andrews teaches the fundamental concepts of multithreaded, parallel and distributed computing and relates them to the implementation and performance processes. He presents the appropriate breadth of topics and supports these discussions with an emphasis on performance.

New Starting from $132.81
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS PowerPoint® 2010 Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $123.60
Copyright year: 2000
Publisher: Addison Wesley
Publication date: 11/30/1999
Binding: Hardcover
Pages: 664
Size: 7.75" wide x 9.50" long x 1.25" tall
Weight: 2.288
Language: English

The Concurrent Computing Landscape
The Essence of Concurrent Programming
Hardware Architectures
Single Processor Machines
Shared-Memory Multiprocessors
Multicomputers Networks
Applications and Programming Styles
Iterative Parallelism: Matrix Multiplication
Recursive Parallelism: Adaptive Quadrature
Producers and Consumers: Unix Pipes
Clients and Servers: Remote Files
Peers: Distributed Matrix Multiplication
Summary of Programming Notation
Declarations Sequential Statements
Concurrent Statements and Process Declarations
Comments
Shared Variable Programming
Processes and Synchronization
States, Actions, Histories, and Properties
Parallelization: Finding Patterns in Files
Synchronization: The Maximum of an Array
Atomic Actions and Await Statements
Fine-Grained Atomicity
Specifying Synchronization: The Await Statement
Finding Patterns in a File Revisited
A Synopsis of Axiomatic Semantics
Formal Logical Systems
A Programming Logic
Semantics of Concurrent Execution
Techniques for Avoiding Interference
Disjoint Variables Weakened Assertions
Global Invariants
Synchronization
An Example: The Array Copy Problem Revisited
Safety and Liveness Properties
Proving Safety Properties
Scheduling Policies and Fairness
Locks and Barriers
The Critical Section Problem
Critical Sections: Spin Locks
Test and Set
Test and Test and Set
Implementing Await Statements
Critical Sections: Fair Solutions
The Tie-Breaker Algorithm
The Ticket al.gorithm
The Bakery Algorithm
Barrier Synchronization
Shared Counter
Flags and Coordinators
Symmetric Barriers
Data Parallel Algorithms
Parallel Prefix Computations
Operations on Linked Lists
Grid Computations: Laplace's Equation
Synchronous Multiprocessors
Parallel Computing with a Bag of Tasks
Matrix Multiplication
Adaptive Quadrature
Semaphores
Syntax and Semantics
Basic Problems and Techniques
Critical Sections: Mutual Exclusion
Barriers: Signaling Events
Producers and Consumers: Split Binary Semaphores
Bounded Buffers: Resource Counting
The Dining Philosophers
Readers and Writers
Readers/Writers as an Exclusion Problem
Readers/Writers Using Condition Synchronization
The Technique of Passing the Baton
Alternative Scheduling Policies
Resource Allocation and Scheduling
Problem Definition and General Solution Pattern
Shortest-Job-Next Allocation
Case Study: Pthreads
Thread Creation
Semaphores
Example: A Simple Producer and Consumer
Monitors
Syntax and Semantics
Mutual Exclusion
Condition Variables
Signaling Disciplines
Additional Operations on Condition Variables
Synchronization Techniques
Bounded Buffers: Basic Condition Synchronization
Readers and Writers: Broadcast Signal
Shortest-Job-Next Allocation: Priority Wait
Interval Timer: Covering Conditions
The Sleeping Barber: Rendezvous
Disk Scheduling: Program Structures
Scheduler as a Separate Monitor
Scheduler as an Intermediary
Scheduler as a Nested Monitor
Case Study: Java
The Threads Class
Synchronized Methods
Parallel Readers/Writers
Exclusive Readers/Writers
True Readers/Writers
Case Study: Pthreads
Locks and Condition Variables
Example: Summing the Elements of a Matrix
Implementations
A Single-Processor Kernel
A Multiprocessor Kernel
Implementing Semaphores in a Kernel
Implementing Monitors in a Kernel
Implementing Monitors Using Semaphores
Distributed Programming
Message Passing
Asynchronous Message Passing
Filters: A Sorting Network
Clients and Servers
Active Monitors
A Self-Scheduling Disk Driver
File Servers: Conversational Continuity
Interacting Peers: Exchanging Values
Synchronous Message Passing
Case Study: CSP
Communication Statements
Guarded Communication
Example: The Sieve of Eratosthenes
Case Study: Linda
Tuple Space and Process Interaction
Example: Prime Numbers with a Bag of Tasks
Case Study: MPI
Basic Functions
Global Communication and Synchronization
Case Study: Java
Networks and Sockets
Example: A Remote File Reader
RPC and Rendezvous
Remote Proc
×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×