Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Event Ordering Mutual Exclusion Atomicity Concurrency Control Deadlock Handling Election Algorithms Reaching Agreement To describe various methods for achieving mutual exclusion in a distributed system To explain how atomic transactions can be implemented in a distributed system To show how some of the concurrency-control schemes discussed in Chapter 6 can be modified for use in a distributed environment To present schemes for handling deadlock prevention, deadlock avoidance, and deadlock detection in a distributed system. | Chapter 18 Distributed Coordination Chapter 18 Distributed Coordination Event Ordering Mutual Exclusion Atomicity Concurrency Control Deadlock Handling Election Algorithms Reaching Agreement Operating System Concepts - 7th Edition Apr 11 2005 18.2 Silberschatz Galvin and Gagne 2005 Chapter Objectives To describe various methods for achieving mutual exclusion in a distributed system To explain how atomic transactions can be implemented in a distributed system To show how some of the concurrency-control schemes discussed in Chapter 6 can be modified for use in a distributed environment To present schemes for handling deadlock prevention deadlock avoidance and deadlock detection in a distributed system Operating System Concepts - 7th Edition Apr 11 2005 18.3 Silberschatz Galvin and Gagne .
