- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
《操作系统概念Operating System Concepts》原配课件PPT-ch18 Distributed Coordination
Chapter 18: Distributed Coordination Chapter 18 Distributed Coordination Event Ordering Mutual Exclusion Atomicity Concurrency Control Deadlock Handling Election Algorithms Reaching Agreement 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 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 Relative Time for Three Concurrent Processes 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 Logical clock is monotonically increasing A process advances its logical clock when it receives a message whose timestamp is greater than the current value of its logical clock If the timestamps of two events A and B are the same, then the events are concurrent We may use the process identity numbers to break ties and to create a total ordering Distributed Mutual Exclusion (DME) Assumptions The system consists of n processes; each process Pi resides at a different processor Each process has a critical section that requires mutual exclusion Requirement If Pi is executing in its critical section, then no other process Pj is executing in its critical
您可能关注的文档
- 《土木工程CAD》课件PPT:chp2 CAD系统概论.ppt
- 《土木工程CAD》课件PPT:chp6 人机交互技术.ppt
- 《土木工程CAD》课件PPT:chp8 工程数据处理与交换.ppt
- 《土木工程CAD》课件PPT:chp7 工程分析与优化设计.ppt
- 《土木工程施工技术》课件0 土方工程-概述.ppt
- 《土木工程有限单元法及程序设计》讲义01 绪论.doc
- 《土木工程施工技术》课件3 土方工程-地下水.ppt
- 《土木工程施工技术》课件5 灌注桩工程.ppt
- 《土木工程材料》教案讲义01 绪论.doc
- 《土木工程施工技术》课件2 土方工程-基坑工程.ppt
- 《操作系统概念Operating System Concepts》原配课件PPT-ch19 Real-Time Systems.ppt
- 《操作系统概念Operating System Concepts》原配课件PPT-ch20 Multimedia Systems.ppt
- 《操作系统概念Operating System Concepts》原配课件PPT-ch22 Windows XP.ppt
- 《操作系统概念Operating System Concepts》原配课件PPT-ch21 The Linux System.ppt
- 《操作系统概念Operating System Concepts》原配课件PPT-UnixBSD.ppt
- 《政府绩效管理》课件PPT:第10章 政府绩效申诉.ppt
- 《操作系统概念Operating System Concepts》原配课件PPT-Windows 2000.ppt
- 《政府绩效管理》课件PPT:第1章 绪论.ppt
- 《政府绩效管理》课件PPT:第3章 政府绩效预算.ppt
- 《政府绩效管理》课件PPT:第5章 政府绩效程序.ppt
文档评论(0)