具有最小危险处理器数的容错数组重构算法

[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium Pub Date : 1991-06-25 DOI:10.1109/FTCS.1991.146700

C. Chen, A. Feng, T. Kikuno, K. Torii

{"title":"具有最小危险处理器数的容错数组重构算法","authors":"C. Chen, A. Feng, T. Kikuno, K. Torii","doi":"10.1109/FTCS.1991.146700","DOIUrl":null,"url":null,"abstract":"An algorithm for a reconfiguration problem (called the SPA problem) for n*n ordinary processors using spare processors is presented. The SPA problem is to find an assignment of spare processors to faulty processors that minimizes the number of dangerous processors. Here, dangerous processors are nonfaulty processors for which there remains no spare processor to be assigned if one more fault occurs. An O(n/sup 2/) algorithm is developed for a basic SPA problem where 2n spare processors are provided. An extension of the SPA problem is defined, and several interesting properties are clarified in order to solve it. In the extension, the spare processors ae assumed to become faulty.<<ETX>>","PeriodicalId":300397,"journal":{"name":"[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Reconfiguration algorithm for fault-tolerant arrays with minimum number of dangerous processors\",\"authors\":\"C. Chen, A. Feng, T. Kikuno, K. Torii\",\"doi\":\"10.1109/FTCS.1991.146700\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algorithm for a reconfiguration problem (called the SPA problem) for n*n ordinary processors using spare processors is presented. The SPA problem is to find an assignment of spare processors to faulty processors that minimizes the number of dangerous processors. Here, dangerous processors are nonfaulty processors for which there remains no spare processor to be assigned if one more fault occurs. An O(n/sup 2/) algorithm is developed for a basic SPA problem where 2n spare processors are provided. An extension of the SPA problem is defined, and several interesting properties are clarified in order to solve it. In the extension, the spare processors ae assumed to become faulty.<<ETX>>\",\"PeriodicalId\":300397,\"journal\":{\"name\":\"[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTCS.1991.146700\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTCS.1991.146700","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

针对n*n个普通处理器使用备用处理器的重构问题(称为SPA问题)，提出了一种算法。SPA问题是将备用处理器分配给故障处理器，以最小化危险处理器的数量。这里，危险处理器是没有故障的处理器，如果再发生一个故障，就没有备用处理器可分配。针对给定2n个备用处理器的基本SPA问题，提出了一种O(n/sup 2/)算法。定义了SPA问题的扩展，并阐明了几个有趣的性质以解决该问题。在扩展中，假设备用处理器发生故障

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

查看原文本刊更多论文

Reconfiguration algorithm for fault-tolerant arrays with minimum number of dangerous processors

An algorithm for a reconfiguration problem (called the SPA problem) for n*n ordinary processors using spare processors is presented. The SPA problem is to find an assignment of spare processors to faulty processors that minimizes the number of dangerous processors. Here, dangerous processors are nonfaulty processors for which there remains no spare processor to be assigned if one more fault occurs. An O(n/sup 2/) algorithm is developed for a basic SPA problem where 2n spare processors are provided. An extension of the SPA problem is defined, and several interesting properties are clarified in order to solve it. In the extension, the spare processors ae assumed to become faulty.<>

求助全文

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

来源期刊

[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium

自引率

0.00%

发文量