A Broadcast Fault-Tolerant Hierarchical Token-Based Mutual Exclusion Algorithm

Y. Mansouri, M. Moallemi, A. Rasoulifard, H. Deldari
{"title":"A Broadcast Fault-Tolerant Hierarchical Token-Based Mutual Exclusion Algorithm","authors":"Y. Mansouri, M. Moallemi, A. Rasoulifard, H. Deldari","doi":"10.1109/ISCIT.2006.339910","DOIUrl":null,"url":null,"abstract":"Fault tolerance is a key feature for every grid based algorithm. In this paper we have proposed a fault tolerance technique for hierarchical mutual exclusion problem solver algorithm. This algorithm is based on Naimi-Trehel's token-based mutual exclusion algorithm. Our algorithm uses some intra cluster broadcasts to achieve this end and tolerate N-l permanent crashes of N nodes. We have also proposed a sketch of the proof for our algorithm and its integrity.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Information and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2006.339910","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Fault tolerance is a key feature for every grid based algorithm. In this paper we have proposed a fault tolerance technique for hierarchical mutual exclusion problem solver algorithm. This algorithm is based on Naimi-Trehel's token-based mutual exclusion algorithm. Our algorithm uses some intra cluster broadcasts to achieve this end and tolerate N-l permanent crashes of N nodes. We have also proposed a sketch of the proof for our algorithm and its integrity.
一种基于广播容错层次令牌的互斥算法
容错是每一种网格算法的关键特征。本文提出了一种层次互斥问题求解算法的容错技术。该算法基于Naimi-Trehel的基于令牌的互斥算法。我们的算法使用一些集群内部广播来实现这一目的,并容忍N个节点的N- 1永久崩溃。我们还为我们的算法及其完整性提出了一个证明草图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信