Always Learning

Concurrent Programming: Principles and Practice
Greg Andrews, University of Arizona

ISBN-10: 0805300864
ISBN-13:  9780805300864

Publisher:  Addison-Wesley
Copyright:  1991
Format:  Paper; 550 pp
Published:  07/02/1991
Status: Instock


Customers outside the U.S., click here.


Print this content

In this section:


Description

This book provides an in-depth overview of underlying principles as well as practical techniques that can be used to design concurrent programs. Anyone interested in sequential and concurrent computing will find this book to be an essential reference and innovative work. Andrews's shows how to approach key decisions, discusses the tradeoffs between how processes should be used, and explains how those processes should interact.


Table of Contents

I. BASIC CONCEPTS.

Sequential Programming.

Language Notation.

Logic, Propositions, and Predicates.

A Programming Logic.

Proofs in Programming Logic.

Program Derivation.

Historical Notes and References.

Exercises.

Concurrency and Synchronization.

Specifying Concurrent Execution.

Atomic Actions and Synchronization.

Semantics of Concurrent Execution.

Techniques for Avoiding Interference.

Auxiliary Variables.

Safety and Liveness Properties.

Historical Notes and References.

Exercises.

II. SHARED VARIABLES.

Fine-Grained Synchronization.

The Critical Section Problem.

Critical Sections: Tie-Breaker Algorithm.

Critical Sections: Ticket Algorithm.

Critical Sections: Bakery Algorithm.

Barrier Synchronization.

Data Parallel Algorithms.

On-The-Fly Garbage Collection.

Implementing Processes.

Historical Notes and References.

Exercises.

Semaphores.

Notation and Semantics.

Basic Uses and Programming Techniques.

Selective Mutual Exclusion.

General Condition Synchronization.

Resource Allocation.

Implementation.

Historical Notes and References.

Exercises.

Conditional Critical Regions.

Notation and Semantics.

Dining Philosophers Revisited.

Reader/Writers Revisited.

Interprocess Communication.

Scheduling and Resource Allocation.

Implementations.

Historical Notes and References.

Exercises.

Monitors.

Programming Notation.

Formal Semantics and Program Proofs.

Synchronization Techniques.

Disk Scheduling: Program Structures.

Alternative Approaches to Synchronization.

Implementations.

Historical Notes and References.

Exercises.

III. MESSAGE PASSING.

Asynchronous Message Passing.

Programming Notation.

Formal Semantics.

Filters: A Sorting Network.

Clients and Servers.

Heartbeat Algorithms.

Probe/Echo Algorithms.

Broadcast Algorithms.

Token-Passing Algorithms.

Replicated Servers.

Implementations.

Historical Notes and References.

Exercises.

Synchronous Message Passing.

Programming Notation.

Formal Semantics.

Networks of Filters.

Interacting Parallel Processes.

Clients and Servers.

Implementations.

Historical Notes and References.

Exercises.

RPC and Rendezvous.

Remote Procedure Call.

Rendezvous.

A Multiple Primitives Notation.

Clients and Servers.

Parallel Algorithms.

Implementation.

Historical Notes and References.

Exercises.

IV. PRACTICE.

Language Overviews.

Turing Plus: Monitors.

Occam: Synchronous Message Passing.

Ada: Rendezvous.

SR: Multiple Primitives.

Linda: Distributed Data Structures.

Comparison and Performance.

Historical Notes and References.

Exercises.

Glossary.

Bibliography.

Index. 0805300864T04062001



Back to top

Print this content

In this section:


Author Bios

Gregory Andrews received a B.S. degree in Mathematics from Stanford University in 1969 and a Ph.D. degree in Computer Science from the University of Washington in 1974. From 1974-79 he was an Assistant Professor at Cornell University. Since 1979 he has been at The University of Arizona, where he is currently Professor of Computer Science. From 1986-93 he chaired the department; in 1986 he received a distinguished teaching award.

Greg has been on the editorial board of Information Processing Letters since 1979. He was the general chair of the Twelfth ACM Symposium on Operating Systems Principles in 1989 and has been on the program committees of numerous conferences. From 1988-92 he was on advisory committees for the computing directorate of the National Science Foundation. Since 1991 he has been on the Board of Directors of the Computing Research Association (CRA).

Greg's research interests include all aspects of concurrent programming. A long-term project has been the design and implementation of the SR programming language. Current work focuses on the development of Filaments, a software package that provides efficient fine-grain parallelism on a variety of parallel machines.

0805300864AB04062001


Backcover Copy

This book provides an in-depth overview of underlying principles as well as practical techniques that can be used to design concurrent programs. Anyone interested in sequential and concurrent computing will find this book to be an essential reference and innovative work. Andrews shows how to approach key decisions, discusses the tradeoffs between how processes should be used, and explains how those processes should interact.



0805300864B04062001

Back to top

Log in to the Instructor Resource Center

Login name: 

  Password: 

Forgot login/password?  |  Need to redeem an access code?

        

Instructor Resource Center File Download

This work is protected by local and international copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning. Dissemination or sale of any part of this work (including on the World Wide Web) will destroy the integrity of the work and is not permitted. The work and materials from this site should never be made available to students except by instructors using the accompanying text in their classes. All recipients of this work are expected to abide by these restrictions and to honor the intended pedagogical purposes and the needs of other instructors who rely on these materials.

Cancel     I accept, proceed with download

Print this content

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.

Back to top