故障超立方体中二叉树的重构

[1993] Proceedings Seventh International Parallel Processing Symposium Pub Date : 1993-04-13 DOI:10.1109/IPPS.1993.262916

P. Yang, C. Raghavendra

{"title":"故障超立方体中二叉树的重构","authors":"P. Yang, C. Raghavendra","doi":"10.1109/IPPS.1993.262916","DOIUrl":null,"url":null,"abstract":"The authors present a distributed scheme for reconfiguration of embedded binary trees in hypercubes. Their scheme can reconfigure around any 3n/2 faulty nodes in O(n) time, in an n-dimensional hypercube. Their technique, which is based on a key concept called degree of occupancy, can be generalized to any task graph.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Reconfiguration of binary trees in faulty hypercubes\",\"authors\":\"P. Yang, C. Raghavendra\",\"doi\":\"10.1109/IPPS.1993.262916\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present a distributed scheme for reconfiguration of embedded binary trees in hypercubes. Their scheme can reconfigure around any 3n/2 faulty nodes in O(n) time, in an n-dimensional hypercube. Their technique, which is based on a key concept called degree of occupancy, can be generalized to any task graph.<<ETX>>\",\"PeriodicalId\":248927,\"journal\":{\"name\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"volume\":\"114 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1993.262916\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Seventh International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1993.262916","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

提出了一种超立方体中嵌入式二叉树重构的分布式方案。在n维超立方体中，他们的方案可以在O(n)时间内围绕任意3n/2个故障节点进行重新配置。他们的技术基于一个叫做占用度的关键概念，可以推广到任何任务图。

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

查看原文本刊更多论文

Reconfiguration of binary trees in faulty hypercubes

The authors present a distributed scheme for reconfiguration of embedded binary trees in hypercubes. Their scheme can reconfigure around any 3n/2 faulty nodes in O(n) time, in an n-dimensional hypercube. Their technique, which is based on a key concept called degree of occupancy, can be generalized to any task graph.<>

求助全文

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

来源期刊

[1993] Proceedings Seventh International Parallel Processing Symposium

自引率

0.00%

发文量