Your company is building a computer network,and you are asked to write an algorithm for achieving distributed mutual exclusion.Which scheme will you use? Explain your choice.
问题信息
-
扫描二维码，关注牛客网
- 意见反馈
-
下载牛客APP，随时随地刷题
扫一扫，把题目装进口袋
- 求职之前，先上牛客
-
扫描二维码，进入QQ群
扫描二维码，关注牛客公众号
- 公司地址：北京市朝阳区北苑路北美国际商务中心K1座一层-北京牛客科技有限公司
- 联系方式：010-60728802 投诉举报电话：010-57596212（朝阳人力社保局）
- 牛客科技© All rights reserved admin@nowcoder.com
- 京ICP备14055008号-4 增值电信业务经营许可证 营业执照 人力资源服务许可证
-
京公网安备
11010502036488号
The options are a (1) centralized,(2) fully -distributed,or (3) token-passing approach.We reject the centralized approach as the centralized coordinator becomes a bottleneck.We also reject the token-passing approach for its difficulty in re-establishing the ring in case of failure.
We choose the fully-distributed approach for the following reasons:
Mutual exclusion is obtained.
Freedom from dead lock is ensured.
Freedom from star ation is ensured,since entry to the critical section is scheduled according to the timestamp ordering.
The number of messages percritical-sectionentry is 2 × (n- 1).
This number is the minimum number of required messages per critical-section entry when processes act independently and concurrently.