{"title":"Scalable Sender-Based Message Logging Protocol with Little Communication Overhead for Distributed Systems","authors":"Jinho Ahn","doi":"10.1142/S0129626419500051","DOIUrl":null,"url":null,"abstract":"The inherent shortcoming of the conventional Sender-Based Message Logging (SBML) protocols is to require additional control message interactions per application message to satisfy the always-no-orphans condition in case of sequential failures. In this paper, a scalable SBML protocol is introduced to lower the communication overhead by handling a sequence of messages consecutively received by each process before sending as a party. The protocol enables the process to delay the update of their receive sequence numbers to their senders until there comes out the first message it is willing to send, and then perform the collective filling out task with each sender requiring only one control message exchange. Experimental results show that our protocol outperforms the previous one in terms of the number of control messages generated.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Process. Lett.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0129626419500051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
The inherent shortcoming of the conventional Sender-Based Message Logging (SBML) protocols is to require additional control message interactions per application message to satisfy the always-no-orphans condition in case of sequential failures. In this paper, a scalable SBML protocol is introduced to lower the communication overhead by handling a sequence of messages consecutively received by each process before sending as a party. The protocol enables the process to delay the update of their receive sequence numbers to their senders until there comes out the first message it is willing to send, and then perform the collective filling out task with each sender requiring only one control message exchange. Experimental results show that our protocol outperforms the previous one in terms of the number of control messages generated.