{"title":"A dynamic multiple copy approach for message passing in a virtual cut-through environment","authors":"Moncef Hamdaoui, P. Ramanathan","doi":"10.1109/IPPS.1993.262786","DOIUrl":null,"url":null,"abstract":"The paper proposes a scheme where nodes adaptively send multiple copies of time-critical messages to increase the probability of their timely delivery. A message is replicated only when the time remaining to its deadline is below a pre-computed threshold. An off-line algorithm for computing the number of copies and the deadline thresholds is presented. Simulation results indicate that the reductions in the expected cost due to missed deadlines are substantial as a result of using the proposed scheme.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Seventh International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1993.262786","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
The paper proposes a scheme where nodes adaptively send multiple copies of time-critical messages to increase the probability of their timely delivery. A message is replicated only when the time remaining to its deadline is below a pre-computed threshold. An off-line algorithm for computing the number of copies and the deadline thresholds is presented. Simulation results indicate that the reductions in the expected cost due to missed deadlines are substantial as a result of using the proposed scheme.<>