MTU Cork Library Catalogue

Syndetics cover image
Image from Syndetics

Principles of concurrent and distributed programming / M. Ben-Ari.

By: Ben-Ari, M, 1948-.
Material type: materialTypeLabelBookSeries: Prentice-Hall international series in computer science.Publisher: New York : Prentice Hall, 1990Description: x, 225 p. : ill. ; 24 cm.ISBN: 013711821X .Subject(s): Parallel processing (Electronic computers) | Electronic data processing -- Distributed processingDDC classification: 005.42
Holdings
Item type Current library Call number Copy number Status Date due Barcode Item holds
General Lending MTU Bishopstown Library Store Item 005.42 (Browse shelf(Opens below)) 1 Available 00029513
Total holds: 0

Enhanced descriptions from Syndetics:

Principles of Concurrent and Distributed Programming provides an introduction to concurrent programming focusing on general principles and not on specific systems.

Includes bibliographical references (p. 218-221) and index.

Table of contents provided by Syndetics

  • I Concurrent Programming
  • á1 What is Concurrent Programming?
  • 2 The Concurrent Programming Abstraction
  • 3 The Mutal Exclusion Problem
  • 4 Semaphores
  • 5 Monitors
  • 6 the Problem of Dining Philosophers
  • áII Distributed Programming
  • á7 Distributed Programming Models
  • 8 Ada
  • 9 occam
  • 10 Linda
  • 11 Distributed Mutual Exclusion
  • 12 Distributed Termination
  • 13 The Byzantine Generals Problem
  • áIII Implementation Principles
  • á14 Single Processor Implementation
  • 15 Multi-processor Implementation
  • 16 Real-Time Programming
  • áAppendixA Ada Overview
  • B Concurrent Programs in Ada
  • C Implementation of the Ada Emulations
  • D Distributed Algoriths in Ada
  • Biblography
  • Index

Reviews provided by Syndetics

CHOICE Review

Ben-Ari provides an excellent introduction to the general principles of concurrent programming and distributed systems. Initial chapters covering classical concurrent programming are similar to his Principles of Concurrent Programming (1982). These chapters focus on the mutual exclusion problem for access to shared variables and shared routines and include presentation of Dekker's algorithm, semaphore primitives, and monitors. In addition to classical problems that illustrate synchronization among processes, there are problems such as the producer-consumer problem, which illustrate how communication among processes can be achieved. The second part of the text focuses on distributed programming models that support communication among processes by sending messages. Models for both synchronous and asynchronous communication are considered, and implementation of specific primitives for distributed programming in three languages, Ada, Occam, and Linda, are described in detail. The final chapters address implementation issues of concurrent programming, and include implementation of concurrency in terms of sharing a single processor and main memory among several processes, implementation in multiprocessor models, and concurrent programming techniques designed for real-time systems. Advanced undergraduates and up. -A.-M. Lancaster, Bowling Green State University

Powered by Koha