| Titre : | Distributed Operating Systems and Algorithm | | Type de document : | texte imprimé | | Auteurs : | Randy Chow, Auteur ; Theodore Johnson, Auteur | | Editeur : | USA : Addison Wesley | | Année de publication : | 1997 | | Importance : | 569 p. | | Présentation : | couv. ill. en coul., ill. | | Format : | 23 cm. | | ISBN/ISSN/EAN : | 978-0-201-49838-7 | | Langues : | Anglais (eng) | | Index. décimale : | 08-06 Algorithme | | Résumé : | Distributed Operating Systems and Algorithms integrates into one text both the theory and implementation aspects of distributed operating systems for the first time. This innovative book provides the reader with knowledge of the important algorithms necessary for an in-depth understanding of distributed systems; at the same time it motivates the study of these algorithms by presenting a systems framework for their practical application.
The first part of the book is intended for use in an advanced course on operating systems and concentrates on parallel systems, distributed systems, real-time systems, and computer networks. The second part of the text is written for a course on distributed algorithms with a focus on algorithms for asynchronous distributed systems. While each of the two parts is self-contained, extensive cross-referencing allows the reader to emphasize either theory or implementation or to cover both elements of selected topics.Features:
Integrates and balances coverage of the advanced aspects of operating systems with the distributed algorithms used by these systems.
Includes extensive references to commercial and experimental systems to illustrate the concepts and implementation issues.
Provides precise algorithm description and explanation of why these algorithms were developed.
Structures the coverage of algorithms around the creation of a framework for implementing a replicated server-a prototype for implementing a fault-tolerant and highly available distributed system.
Contains programming projects on such topics as sockets, RPC, threads, and implementation of distributed algorithms using these tools.
Includes an extensive annotated bibliography for each chapter, pointing the reader to recent developments.
Solutions to selected exercises, templates to programming problems, a simulator for algorithms for distributed synchronization, and teaching tips for selected topics are available to qualified instructors from Addison Wesley. | | Note de contenu : | Table of contents
-Part 1. Distributed Operating Systems
Chapter 1: Operating System Fundamentals
-Evolution of Modern Operating Systems.
-Centralized Operating System Overview.
-Network Operating Systems.
-Distributed Operating Systems.
-Cooperative Autonomous Systems.
-Distributed Algorithms.
Chapter 2: Distributed System Concepts and Architecture's
-Goals.
-Transparency.
-Services.
-Architecture Models.
-Network Communication Protocols Major Design Issues.
-Distributed Computing Environment (DCE).
Chapter 3: Concurrent Processes and Programming.
-Processes and Threads.
-Graph Models for Process Representation.
-The Client/Server Model Time Services.
-Language Mechanisms for Synchronization.
-Object Model Resource Servers Concurrent Programming Languages.
-Distributed and Network Programming Languages.
Chapter 4: Interprocess Communication and Coordination.
-Message Passing Communication.
-Request/Reply Communication.
-Transaction Communication.
-Name and Directory Services.
-Distributed Mutual Exclusion.
-Leader Election.
Chapter 5: Distributed Process Scheduling.
-A System Performance Model.
-Static Process Scheduling with Communication.
-Dynamic Load Sharing and Balancing.
-Distributed process Implementation.
-Real-time Scheduling.
Chapter 6: Distributed File Systems.
-Transparencies and Characteristics of DFS.
-DFS Design and Implementation.
-Transaction Service and Concurrency Control.
-Data and File Replication.
Chapter 7: Distributed Shared Memory.
-Non-Uniform Memory Access Architecture's.
-Memory Consistency Models.
-Multiprocessor Cache Systems.
-Distributed Shared Memory.
-Implementation of DSM systems.
Chapter 8: Distributed Computer Security.
-Fundamentals of Computer Security.
-Discretionary Access Control Models.
-Mandatory Flow Control Models.
-Cryptography.
-Distributed Authentication and Key Distribution Issues Relevant to Distributed Security.
-Part 2. Distributed Algorithm
Chapter 9:Models of Distributed Computation.
-Preliminaries.
-Causality.
-Distributed Snapshots.
-Modeling a Distributed Computation Failures in a Distributed System.
Chapter 10: Synchronization and Election.
-Distributed Mutual Exclusion.
-Election.
Chapter 11: Distributed Agreement.
-Adversaries.
-Byzantine Agreement.
-Impossibility of Consensus.
-Randomized Distributed Agreement.
Chapter 12: Replicated Data Management
-Database Techniques.
-Atomic Multicast.
-Update Propagation.
Chapter 13: Checkpointing and Recovery.
-Problems in Rollback.
-Incarnation Numbers.
-Taxonomy of Solution Techniques Uncoordinated Checkpointing.
-Coordinated Checkpointing.
-Synchronous Logging Asynchronous Logging.
-Adaptive Logging.
-Index |
Distributed Operating Systems and Algorithm [texte imprimé] / Randy Chow, Auteur ; Theodore Johnson, Auteur . - USA : Addison Wesley, 1997 . - 569 p. : couv. ill. en coul., ill. ; 23 cm. ISBN : 978-0-201-49838-7 Langues : Anglais ( eng) | Index. décimale : | 08-06 Algorithme | | Résumé : | Distributed Operating Systems and Algorithms integrates into one text both the theory and implementation aspects of distributed operating systems for the first time. This innovative book provides the reader with knowledge of the important algorithms necessary for an in-depth understanding of distributed systems; at the same time it motivates the study of these algorithms by presenting a systems framework for their practical application.
The first part of the book is intended for use in an advanced course on operating systems and concentrates on parallel systems, distributed systems, real-time systems, and computer networks. The second part of the text is written for a course on distributed algorithms with a focus on algorithms for asynchronous distributed systems. While each of the two parts is self-contained, extensive cross-referencing allows the reader to emphasize either theory or implementation or to cover both elements of selected topics.Features:
Integrates and balances coverage of the advanced aspects of operating systems with the distributed algorithms used by these systems.
Includes extensive references to commercial and experimental systems to illustrate the concepts and implementation issues.
Provides precise algorithm description and explanation of why these algorithms were developed.
Structures the coverage of algorithms around the creation of a framework for implementing a replicated server-a prototype for implementing a fault-tolerant and highly available distributed system.
Contains programming projects on such topics as sockets, RPC, threads, and implementation of distributed algorithms using these tools.
Includes an extensive annotated bibliography for each chapter, pointing the reader to recent developments.
Solutions to selected exercises, templates to programming problems, a simulator for algorithms for distributed synchronization, and teaching tips for selected topics are available to qualified instructors from Addison Wesley. | | Note de contenu : | Table of contents
-Part 1. Distributed Operating Systems
Chapter 1: Operating System Fundamentals
-Evolution of Modern Operating Systems.
-Centralized Operating System Overview.
-Network Operating Systems.
-Distributed Operating Systems.
-Cooperative Autonomous Systems.
-Distributed Algorithms.
Chapter 2: Distributed System Concepts and Architecture's
-Goals.
-Transparency.
-Services.
-Architecture Models.
-Network Communication Protocols Major Design Issues.
-Distributed Computing Environment (DCE).
Chapter 3: Concurrent Processes and Programming.
-Processes and Threads.
-Graph Models for Process Representation.
-The Client/Server Model Time Services.
-Language Mechanisms for Synchronization.
-Object Model Resource Servers Concurrent Programming Languages.
-Distributed and Network Programming Languages.
Chapter 4: Interprocess Communication and Coordination.
-Message Passing Communication.
-Request/Reply Communication.
-Transaction Communication.
-Name and Directory Services.
-Distributed Mutual Exclusion.
-Leader Election.
Chapter 5: Distributed Process Scheduling.
-A System Performance Model.
-Static Process Scheduling with Communication.
-Dynamic Load Sharing and Balancing.
-Distributed process Implementation.
-Real-time Scheduling.
Chapter 6: Distributed File Systems.
-Transparencies and Characteristics of DFS.
-DFS Design and Implementation.
-Transaction Service and Concurrency Control.
-Data and File Replication.
Chapter 7: Distributed Shared Memory.
-Non-Uniform Memory Access Architecture's.
-Memory Consistency Models.
-Multiprocessor Cache Systems.
-Distributed Shared Memory.
-Implementation of DSM systems.
Chapter 8: Distributed Computer Security.
-Fundamentals of Computer Security.
-Discretionary Access Control Models.
-Mandatory Flow Control Models.
-Cryptography.
-Distributed Authentication and Key Distribution Issues Relevant to Distributed Security.
-Part 2. Distributed Algorithm
Chapter 9:Models of Distributed Computation.
-Preliminaries.
-Causality.
-Distributed Snapshots.
-Modeling a Distributed Computation Failures in a Distributed System.
Chapter 10: Synchronization and Election.
-Distributed Mutual Exclusion.
-Election.
Chapter 11: Distributed Agreement.
-Adversaries.
-Byzantine Agreement.
-Impossibility of Consensus.
-Randomized Distributed Agreement.
Chapter 12: Replicated Data Management
-Database Techniques.
-Atomic Multicast.
-Update Propagation.
Chapter 13: Checkpointing and Recovery.
-Problems in Rollback.
-Incarnation Numbers.
-Taxonomy of Solution Techniques Uncoordinated Checkpointing.
-Coordinated Checkpointing.
-Synchronous Logging Asynchronous Logging.
-Adaptive Logging.
-Index |
|  |
Affiner la recherche Interroger des sources externesDistributed Operating Systems and Algorithm / Randy Chow
