扩展超立方体网络中用于崩溃恢复的并发回滚

Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI:10.1109/AISPAS.1995.401336

T. Juang, C. Chiu, Kun-Ming Yu

{"title":"扩展超立方体网络中用于崩溃恢复的并发回滚","authors":"T. Juang, C. Chiu, Kun-Ming Yu","doi":"10.1109/AISPAS.1995.401336","DOIUrl":null,"url":null,"abstract":"Recovering from processor failures is an important problem in the design and development of reliable systems. We present a concurrent rollback algorithm in extended hypercube networks to recover from crash failures which involves small message and time complexities. The network of an extended hypercube is a hierarchical, low diameter, recursive structure. By appending only O(1) additional information to each message, we use less than O(Nlog N) message exchanges and O(log/sup 2/ N) time elapsed for recovery work where N is the number of processors of the extended hypercube network. The algorithms can be used to recover from the failure of an arbitrary number of processors.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"537 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Concurrent rollback for crash recovery in extended hypercube networks\",\"authors\":\"T. Juang, C. Chiu, Kun-Ming Yu\",\"doi\":\"10.1109/AISPAS.1995.401336\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recovering from processor failures is an important problem in the design and development of reliable systems. We present a concurrent rollback algorithm in extended hypercube networks to recover from crash failures which involves small message and time complexities. The network of an extended hypercube is a hierarchical, low diameter, recursive structure. By appending only O(1) additional information to each message, we use less than O(Nlog N) message exchanges and O(log/sup 2/ N) time elapsed for recovery work where N is the number of processors of the extended hypercube network. The algorithms can be used to recover from the failure of an arbitrary number of processors.<<ETX>>\",\"PeriodicalId\":321580,\"journal\":{\"name\":\"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis\",\"volume\":\"537 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AISPAS.1995.401336\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AISPAS.1995.401336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

从处理器故障中恢复是可靠系统设计和开发中的一个重要问题。我们提出了一种扩展超立方体网络中的并发回滚算法，用于从涉及小消息和时间复杂性的崩溃故障中恢复。扩展超立方体的网络是一个分层的、低直径的递归结构。通过仅向每条消息附加O(1)个额外信息，我们使用少于O(Nlog N)个消息交换和O(log/sup 2/ N)个恢复工作时间，其中N是扩展超立方体网络的处理器数量。该算法可用于从任意数量的处理器故障中恢复。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Concurrent rollback for crash recovery in extended hypercube networks

Recovering from processor failures is an important problem in the design and development of reliable systems. We present a concurrent rollback algorithm in extended hypercube networks to recover from crash failures which involves small message and time complexities. The network of an extended hypercube is a hierarchical, low diameter, recursive structure. By appending only O(1) additional information to each message, we use less than O(Nlog N) message exchanges and O(log/sup 2/ N) time elapsed for recovery work where N is the number of processors of the extended hypercube network. The algorithms can be used to recover from the failure of an arbitrary number of processors.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis

自引率

0.00%

发文量