Y. Mansouri, M. Moallemi, A. Rasoulifard, H. Deldari
{"title":"一种基于广播容错层次令牌的互斥算法","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":"{\"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}","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}
A Broadcast Fault-Tolerant Hierarchical Token-Based Mutual Exclusion Algorithm
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.