close menu
Bookswagon-24x7 online bookstore
close menu
My Account
Home > Computing and Information Technology > Computer programming / software engineering > Foundations of Multithreaded, Parallel, and Distributed Programming: (English)
Foundations of Multithreaded, Parallel, and Distributed Programming: (English)

Foundations of Multithreaded, Parallel, and Distributed Programming: (English)

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

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. Features *Emphasizes how to solve problems, with correctness the primary concern and performance an important, but secondary, concern *Includes a number of case studies which cover such topics as pthreads, MPI, and OpenMP libraries, as well as programming languages like Java, Ada, high performance Fortran, Linda, Occam, and SR *Provides examples using Java syntax and discusses how Java deals with monitors, sockets, and remote method invocation *Covers current programming techniques such as semaphores, locks, barriers, monitors, message passing, and remote invocation *Concrete examples are executed with complete programs, both shared and distributed *Sample applications include scientific computing and distributed systems 0201357526B04062001

Table of Contents:


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

I. SHARED VARIABLE PROGRAMMING.

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

3. 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 Algorithm.

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.

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

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

6. Implementations.

A Single-Processor Kernel.

A Multiprocessor Kernel.

Implementing Semaphores in a Kernel.

Implementing Monitors in a Kernel.

Implementing Monitors Using Semaphores.

II. DISTRIBUTED PROGRAMMING.

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

8. RPC and Rendezvous.

Remote Procedure Call.

Synchronization in Modules.

A Time Server Caches in a Distributed File System.

A Sorting Network of Merge Filters.

Interacting Peers: Exchanging Values.

Rendezvous.

Input Statements.

Client/Server Examples.

A Sorting Network of Merge Filters.

Interacting Peers: Exchanging Values.

A Multiple Primitives Notation.

Invoking and Servicing Operations.

Examples.

Readers/Writers Revisited.

Encapsulated Access.

Replicated Files.

Case Study: Java.

Remote Method Invocation.

Example: A Remote Database.

Case Study: Ada.

Tasks.

Rendezvous.

Protected Types.

Example: The Dining Philosophers.

Case Study: SR.

Resources and Globals.

Communication and Synchronization.

Example: Critical Section Simulation.

9. Paradigms for Process Interaction.

Managers/Workers (Distributed Bag of Tasks).

Sparse Matrix Multiplication.

Adaptive Quadrature Revisited.

Heartbeat Algorithms.

Image Processing: Region Labeling.

Cellular Automata: The Game of Life.

Pipeline Algorithms.

A Distributed Matrix Multiplication Pipeline.

Matrix Multiplication by Blocks.

Probe/Echo Algorithms.

Broadcast in a Network.

Computing the Topology of a Network.

Broadcast Algorithms.

Logical Clocks and Event Ordering.

Distributed Semaphores.

Token-Passing Algorithms.

Distributed Mutual Exclusion.

Termination Detection in a Ring.

Termination Detection in a Graph.

Replicated Servers.

Distributed Dining Philosophers.

Decentralized Dining Philosophers.

10. Implementations.

Asynchronous Message Passing.

Shared-Memory Kernel.

Distributed Kernel.

Synchronous Message Passing.

Direct Communication Using Asynchronous Messages.

Guarded Communication Using a Clearing House.

RPC and Rendezvous.

RPC in a Kernel.

Rendezvous Using Asynchronous Message Passing.

Multiple Primitives in a Kernel.

Distributed Shared Memory.

Implementation Overview.

Page Consistency Protocols.

III. PARALLEL PROGRAMMING:

Speedup and Efficiency.

Overheads and Challenges.

11. Scientific Computing.

Grid Computations.

Laplace's Equation.

Sequential Jacobi Iteration.

Shared Variable Program.

Message Passing Program.

Red/Black Successive Over Relaxation.

Multigrid Methods.

Particle Computations.

The Gravitational #N-Body Problem.

Shared Variable Program.

Message Passing Programs.

Approximate Methods.

Matrix Computations.

Gaussian Elimination.

LU Decomposition.

Shared Variable Program.

Message Passing Program.

12. Languages, Compilers, Libraries, and Tools.

Parallel Programming Libraries.

Case Study: Pthreads.

Case Study: MPI.

Case Study: OpenMP.

Parallelizing Compilers.

Dependence Analysis.

Program Transformations.

Other Programming Models.

Imperative Languages.

Coordination Languages Data Parallel Languages.

Functional Languages.

Abstract Models.

Case Study: High Performance Fortran (HPF).

Parallel Programming Tools.

Performance Measurement and Visualization.

Metacomputers and Metacomputing.

Case Study: The Globus Toolkit. 0201357526T04062001


Best Seller

| | See All


Product Details
  • ISBN-13: 9780201357523
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Pearson
  • Depth: 32
  • Language: English
  • Returnable: N
  • Spine Width: 40 mm
  • Width: 191 mm
  • ISBN-10: 0201357526
  • Publisher Date: 13 Jan 2000
  • Binding: Paperback
  • Height: 235 mm
  • No of Pages: 688
  • Series Title: English
  • Weight: 1260 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Foundations of Multithreaded, Parallel, and Distributed Programming: (English)
Pearson Education (US) -
Foundations of Multithreaded, Parallel, and Distributed Programming: (English)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Foundations of Multithreaded, Parallel, and Distributed Programming: (English)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    | | See All


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA