Global semigroup operations in faulty SIMD hypercubes

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

C. Raghavendra, M. Sridhar

{"title":"Global semigroup operations in faulty SIMD hypercubes","authors":"C. Raghavendra, M. Sridhar","doi":"10.1109/IPPS.1993.262794","DOIUrl":null,"url":null,"abstract":"The authors consider the problem of computing a global semigroup operation (such as addition and multiplication) on a faulty hypercube. In particular, they study the problem of performing such an operation in an n-dimensional SIMD hypercube Q/sub n/, with upto n-1 node and/or link faults. In an SIMD hypercube, during a communication step, nodes can exchange information with their neighbors only across a specific dimension. Given a set of most n-1 faults they develop an ordering d/sub 1/, d/sub 2/,. . .,d/sub n/ of n dimensions, depending on where the faults are located. An important and useful property of this dimension ordering is the following: if the n-cube is partitioned into k-subcubes using the first k dimensions f this ordering, namely d/sub 1/,d/sub 2/. . .d/sub k/ for any 1<or=k<or=n, then each k-subcube in the partition contains at most k-1 faults. They use this result to develop algorithms for global sum. This ordering can be obtained in the presence of node as well as link faults. They also consider larger fault size, and show how to extend the dimension ordering theorem to handle up to (/sub 2//sup n/) faults. Using this result, it seems possible to obtain even more fault-tolerant algorithms for the semigroup operation problem.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Seventh International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1993.262794","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

Abstract

The authors consider the problem of computing a global semigroup operation (such as addition and multiplication) on a faulty hypercube. In particular, they study the problem of performing such an operation in an n-dimensional SIMD hypercube Q/sub n/, with upto n-1 node and/or link faults. In an SIMD hypercube, during a communication step, nodes can exchange information with their neighbors only across a specific dimension. Given a set of most n-1 faults they develop an ordering d/sub 1/, d/sub 2/,. . .,d/sub n/ of n dimensions, depending on where the faults are located. An important and useful property of this dimension ordering is the following: if the n-cube is partitioned into k-subcubes using the first k dimensions f this ordering, namely d/sub 1/,d/sub 2/. . .d/sub k/ for any 1>

查看原文本刊更多论文

故障SIMD超多维数据集中的全局半群操作

研究了在故障超立方体上计算全局半群运算(如加法和乘法)的问题。特别是，他们研究了在n维SIMD超立方体Q/sub n/中执行此类操作的问题，其中最多有n-1个节点和/或链路故障。在SIMD超立方体中，在通信步骤期间，节点只能跨特定维度与其相邻节点交换信息。给定一组大多数为n-1的断层，它们根据断层所在的位置，发展出n维的d/sub 1/， d/sub 2/，…，d/sub n/的顺序。这个维数排序的一个重要而有用的性质是:如果用这个排序的前k个维，即d/下标1/，d/下标2/，d/下标k/，对任意1>

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

求助全文

约1分钟内获得全文求助全文

来源期刊

[1993] Proceedings Seventh International Parallel Processing Symposium

自引率

0.00%

发文量