A time-out based resilient token transfer algorithm for mutual exclusion in computer networks

S. Nishio, K. F. Li, E. Manning
{"title":"A time-out based resilient token transfer algorithm for mutual exclusion in computer networks","authors":"S. Nishio, K. F. Li, E. Manning","doi":"10.1109/ICDCS.1989.37969","DOIUrl":null,"url":null,"abstract":"Two algorithms, control token transfer algorithm (CTTA) and regenerate, are proposed to realize mutual exclusion in a computer network environment using a resilient circulating token. The algorithm CTTA uses a message called token to transfer the privilege of entering a critical region among the participating sites. The algorithm regenerate checks whether the token is lost during system failures, and regenerates it if necessary. Failures in a computer network are classified into three types. The execution of these two algorithms is described for each type of system failure. To detect system failures, a time-out mechanism based on message delay is used.<<ETX>>","PeriodicalId":266544,"journal":{"name":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings. The 9th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.1989.37969","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Two algorithms, control token transfer algorithm (CTTA) and regenerate, are proposed to realize mutual exclusion in a computer network environment using a resilient circulating token. The algorithm CTTA uses a message called token to transfer the privilege of entering a critical region among the participating sites. The algorithm regenerate checks whether the token is lost during system failures, and regenerates it if necessary. Failures in a computer network are classified into three types. The execution of these two algorithms is described for each type of system failure. To detect system failures, a time-out mechanism based on message delay is used.<>
计算机网络中基于超时的互斥弹性令牌传输算法
为了在计算机网络环境中利用弹性循环令牌实现互斥,提出了控制令牌传输算法(CTTA)和再生算法。CTTA算法使用令牌消息在参与站点之间传递进入关键区域的权限。算法regenerate检查令牌是否在系统故障期间丢失,并在必要时重新生成它。计算机网络中的故障分为三种类型。针对每种类型的系统故障,描述了这两种算法的执行。为了检测系统故障,使用了基于消息延迟的超时机制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信