TAILIEUCHUNG - Lecture Operating system concepts (Fifth edition): Module 18 - Avi Silberschatz, Peter Galvin

Module 18 - Distributed coordination. Chapter 18 examines various mechanisms for process synchronization and communication, as well as methods for dealing with the deadlock problem, in a distributed environment. In addition, since a distributed system may suffer from a variety of failures that are not encountered in a centralized system, we also discuss here the issue of failure in a distributed system. | Module 18: Distributed Coordination Event Ordering Mutual Exclusion Atomicity Concurrency Control Deadlock Handling Election Algorithms Reaching Agreement Operating System Concepts Event Ordering Happened-before relation (denoted by ). If A and B are events in the same process, and A was executed before B, then A B. If A is the event of sending a message by one process and B is the event of receiving that message by another process, then A B. If A B and B C then A C. Operating System Concepts Implementation of Associate a timestamp with each system event. Require that for every pair of events A and B, if A B, then the timestamp of A is less than the timestamp of B. Within each process Pi a logical clock, LCi is associated. The logical clock can be implemented as a simple counter that is incremented between any two successive events executed within a process. A process advances its logical clock when it receives a message whose timestamp is greater than the current value

• Hệ điều hành
• Operating system concepts
• Lecture Operating system concepts
• Operating system
• Hệ điều hành
• Computer system organization
• Distributed coordination
• Operating system services
• Operating system structures
• Operating system design
• Operating system structure
• Operating System Debugging
• Operating System Generation
• Types of System Calls
• Computer system structures
• File system interface
• File system implementation
• Computer system architecture
• The Linux system