SR Programming Language: Concurrency Pract - Tapa blanda

Acerca del autor

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.

De la contraportada

SR (Synchronizing Resources) is a powerful and flexible language for concurrent programming. With its explicit mechanisms and concurrency, communication, and synchronization, programmers can easily learn to write programs for both shared- and distributed-memory applications and machines.This book, written by the language designers, provides a complete introduction to SR and gives the reader the tools for learning about and experimenting with concurrency.

Features

• Provides an accessible, clear introduction to SR by the language designers.
• Teaches practical techniques through numerous realistic examples of parallel and distributed programming problems.
• Examines 'classic' concurrent programming problems as well as many important parallel and distributed programming problems.
• Illustrates trade-offs between language mechanisms to help the reader understand and make optimum design decisions
• Reinforces key points with numerous end-of-chapter exercises
• Includes six appendices that summarize the language for quick reference, show how to develop and execute programs, and describe the implementation.

The SR language implementation is available, free, from the SR Project, University of Arizona, at ftp://cs.arizona.edu/sr/.