MTU Library Catalogue

Syndetics cover image
Image from Syndetics

Operating systems : advanced concepts / Mamoru Maekawa, Arthur E. Oldehoeft, Rodney R. Oldehoeft.

By: Maekawa, M. (Mamoru), 1942-.
Contributor(s): Oldehoeft, Arthur E | Oldehoeft, Rodney R.
Material type: materialTypeLabelBookPublisher: Menlo Park, Calif. : Benjamin/Cummings Pub. Co, 1987Description: xvi, 414 p. : ill. ; 25 cm.ISBN: 0805371214.Subject(s): Operating systems (Computers)DDC classification: 005.43
Contents:
Overview -- Process Synchronization -- Language Mechanisms for Concurrency -- Deadlock -- Virtual Memory -- Distributed Systems -- Distributed Concurrency Control, Deadlock and Recovery -- Computer Security -- Queuing Models of Computer Systems.
Holdings
Item type Current library Call number Copy number Status Barcode
General lending MTU Bishopstown Library Store 005.43 (Browse shelf(Opens below)) 1 Available 00021096
Total holds: 0

Includes bibliographical references and index.

Overview -- Process Synchronization -- Language Mechanisms for Concurrency -- Deadlock -- Virtual Memory -- Distributed Systems -- Distributed Concurrency Control, Deadlock and Recovery -- Computer Security -- Queuing Models of Computer Systems.

Reviews provided by Syndetics

CHOICE Review

An in-depth examination of major subject areas of computer operating systems theory and concepts-process synchronization, concurrency, deadlock, virtual memory, distributed systems, security, and queuing models. Each topic is structured in a manner that will enable knowledgeable practitioners to grasp the content without perusing preceding materials. In each case the authors tell you what they are going to tell you, then they tell you, and then they tell you what they told you. Myriad charts, tables, and schematics should aid substantially in comprehension of the theories and models presented. Each chapter ends with a large number of references and suggested readings plus a selection of questions and problems designed to assure more firmly the assimilation of concepts. When appropriate, program excerpts are included to support some of the algorithms presented. This timely and comprehensive work is recommended for use either as a textbook or as a reference source for graduate students in computer science.-E. Hook, formerly Gettysburg College