[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing最新文献

筛选
英文 中文
Two software techniques for on-line error detection 在线错误检测的两种软件技术
S. Miremadi, J. Karlsson, U. Gunneflo, J. Torin
{"title":"Two software techniques for on-line error detection","authors":"S. Miremadi, J. Karlsson, U. Gunneflo, J. Torin","doi":"10.1109/FTCS.1992.243568","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243568","url":null,"abstract":"Two software-based techniques for online detection of control flow errors were evaluated by fault injection. One technique, called block signature self-checking (BSSC), checks the control flow between program blocks. The other, called error capturing instructions (ECIs), inserts ECIs in the program area, the data area, and the unused area of the memory. To demonstrate these techniques, a program has been developed which modifies the executable code for the MC6809E 8-b microprocessor. The error detection techniques were evaluated using two fault injection techniques: heavy-ion radiation from a californium-252 source and power supply disturbances. Combinations of the two error detection techniques were tested for three different workloads. A combination BSSC, ECIs, and a watchdog timer was also evaluated.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122445787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 124
A study of the effects of transient fault injection into a 32-bit RISC with built-in watchdog 带看门狗的32位RISC暂态故障注入效应的研究
J. Ohlsson, M. Rimén, U. Gunneflo
{"title":"A study of the effects of transient fault injection into a 32-bit RISC with built-in watchdog","authors":"J. Ohlsson, M. Rimén, U. Gunneflo","doi":"10.1109/FTCS.1992.243569","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243569","url":null,"abstract":"An error-detecting 32-b reduced instruction set computer (RISC) designed in a 1.2- mu m CMOS technology with an on-chip watchdog using embedded signature monitoring is presented. It was evaluated through simulation-based fault injection, using a register level model written in VHDL (very high-speed IC (VHSIC) description language). A chip area increase of 4.7% was caused by the watchdog. Two application programs were executed to study workload dependencies. The insertion of watchdog instructions resulted in a memory overhead of between 13% and 25% as well as a performance overhead of between 9% and 19%. A total of 2779 faults were injected into the processor during execution of the application programs. Only 23% of these resulted in effective errors. A minimum detection coverage of 95% was reached for effective errors classified as control flow errors with a median latency of one clock cycle. Few effective data errors, between 22% and 50%, were detected.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"53-54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125691486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 87
Improved construction methods for error correcting constant weight codes 改进了定权码纠错的构造方法
S. Al-Bassam, Gowri Ramanathan, B. Bose
{"title":"Improved construction methods for error correcting constant weight codes","authors":"S. Al-Bassam, Gowri Ramanathan, B. Bose","doi":"10.1109/FTCS.1992.243582","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243582","url":null,"abstract":"Two construction methods for t error correcting constant weight codes are developed. Both of these methods are improvements over the existing codes. One construction is recursive, which is based on the observation that a 2t error correcting code can be built by concatenating two t error correcting codes. This results in the reduction of code word length for higher t values. The other construction method also builds a 2t error correcting code by augmenting the codes of smaller error correcting capabilities as check symbols. Existing construction methods are used to build these check symbols so that the length of the code word will be optimized.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128084339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fault-tolerant real-time communication in distributed computing systems 分布式计算系统中的容错实时通信
Q. Zheng, K. Shin
{"title":"Fault-tolerant real-time communication in distributed computing systems","authors":"Q. Zheng, K. Shin","doi":"10.1109/FTCS.1992.243612","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243612","url":null,"abstract":"An increasing number of applications require packets to be delivered reliably within prespecified delay bounds. It is shown how this can be achieved by using real-time channels that make soft reservation of network resources to ensure the timely delivery of real-time packets. Algorithms are presented for the establishment of real-time channels, and it is shown how the basic real-time channels can be enhanced to be fault tolerant using the multiple paths between a pair of communicating nodes. The contribution of the former is a tighter schedulability condition that makes more efficient use of network resources than other existing approaches, and the contribution of the latter is a significant improvement in fault tolerance over the basic real-time channel, which is inherently susceptible to component failures.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128376289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 85
Optimal algorithms for exact, inexact, and approval voting 精确、不精确和批准投票的最优算法
B. Parhami
{"title":"Optimal algorithms for exact, inexact, and approval voting","authors":"B. Parhami","doi":"10.1109/FTCS.1992.243595","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243595","url":null,"abstract":"The design of optimal n-way voting algorithms based on the structure of the input object space is considered. The design techniques are then extended to inexact and approval voting schemes. It is shown that efficient theta (n)-time voting algorithms can be designed when the input object space is small. Next in the hierarchy is the case of a totally-ordered object space that supports worst-case theta (nlogn) algorithms for both exact and inexact voting as well as for certain approval-voting schemes. An unordered input object space leads to worst-case Omega (n/sup 2/) algorithms, even when a distance metric can be defined on the input object space. Some observations on the relationship of voting to other well-studied problems, particularly sorting, are also included.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128520645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 31
Design of static CMOS self-checking circuits using built-in current sensing 采用内置电流传感的静态CMOS自检电路设计
Jien-Chung Lo, J. Daly, M. Nicolaidis
{"title":"Design of static CMOS self-checking circuits using built-in current sensing","authors":"Jien-Chung Lo, J. Daly, M. Nicolaidis","doi":"10.1109/FTCS.1992.243610","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243610","url":null,"abstract":"The authors present a novel scheme for implementing self-checking circuits in static CMOS. A strongly code disjoint (SCD) built-in current sensor (BICS) is presented. It is used to cover faults whose detection cannot be guaranteed by logic monitoring. A previously fabricated and tested high-speed BICS is examined for its behavior in the presence of faults. Then, a self-exercising mechanism is designed to obtain the SCD property. The integration of this SCD BICS with a self-checking circuit achieves the well-known goal of total self-checking.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133907484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 43
Scheduling with rollback constraints in high-level synthesis of self-recovering ASICs 基于回滚约束的高级自恢复集成电路综合调度
R. Karri, A. Orailoglu
{"title":"Scheduling with rollback constraints in high-level synthesis of self-recovering ASICs","authors":"R. Karri, A. Orailoglu","doi":"10.1109/FTCS.1992.243581","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243581","url":null,"abstract":"The authors develop software mechanisms for incorporating on-chip self-recovery-using checkpointing and rollback-during high-level synthesis. They propose an algorithm for rollback point insertion to minimize rollback overhead. It identifies good rollback points by successively eliminating clock cycle boundaries that are either expensive or violate the recovery time constraint. Only the minimum number of rollback points are inserted. A flexible synthesis methodology is presented in which rollback point insertion can precede, succeed, or be intertwined with scheduling. A novel edge-based scheduling algorithm is described that schedules edges to clock cycle boundaries, in addition to scheduling nodes to clock cycles. The system has been used to schedule flow graphs from the literature. Experimental results are presented.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124072259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 36
On combining off-line BIST and on-line control flow checking 离线BIST与在线控制流检测相结合的研究
B. Eschermann
{"title":"On combining off-line BIST and on-line control flow checking","authors":"B. Eschermann","doi":"10.1109/FTCS.1992.243571","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243571","url":null,"abstract":"If offline testing is complemented by online checks, in general some of the test hardware is only used either for online checking or for testing. A novel target structure for self-testable and self-monitoring controllers is presented, and a formal framework for the synthesis of self-monitoring controllers is established. It combines a method of monitoring the control flow with a self-test structure in such a way, that the self-test hardware is utilized for facilitating control flow checking. The corresponding design procedure considers this target structure while synthesizing the controller from a behavioral description, and thus minimizes hardware overheads. Existing approaches for designing concurrently checked controllers can be represented as special cases in the formal framework established. Experimental results are summarized.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125463712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Single b-bit byte error correcting and double bit error detecting codes for high-speed memory systems 高速存储系统的单b位字节纠错和双比特错误检测代码
E. Fujiwara, M. Hamada
{"title":"Single b-bit byte error correcting and double bit error detecting codes for high-speed memory systems","authors":"E. Fujiwara, M. Hamada","doi":"10.1109/FTCS.1992.243584","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243584","url":null,"abstract":"The authors propose a novel design method for single b-bit byte error correcting and double bit error detecting code, called Sb EC-DED code, suitable for high-speed memory systems using byte organized RAM chips. This type of byte error control code is practical from the viewpoint of having less redundancy and stronger error control capability than the existing codes. A code design method using elements from a coset of a subfield under addition gives the practical Sb EC-DED code with 64 information bits and 4-bit byte length which has the same check-bit length, 12 bits, as that of the single byte error correcting code. This also has very high error detection capabilities of random double byte errors and of random triple bit errors.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125290513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
More robust tests in algorithm-based fault-tolerant matrix multiplication 基于算法的容错矩阵乘法的鲁棒性测试
Fikri T. Assaad, S. Dutt
{"title":"More robust tests in algorithm-based fault-tolerant matrix multiplication","authors":"Fikri T. Assaad, S. Dutt","doi":"10.1109/FTCS.1992.243592","DOIUrl":"https://doi.org/10.1109/FTCS.1992.243592","url":null,"abstract":"The authors propose a novel algorithm-based testing scheme for matrix multiplication that supplements the standard sum test. An integer-based equality test is presented for matrix multiplication that is able to detect up to three errors in the scalar floating-point multiplication component of the computation. They present schemes that augment this integer-based test by a floating-point equality test so that errors in the floating-point addition component of matrix multiplication are also covered. As shown by simulation results, the hybrid testing method is much more accurate in detecting errors than previous floating-point equality tests with thresholding. A small architectural change is suggested in the floating-point multiplication unit that restricts the time overhead of the scheme to only 18% over that of the simple floating-point equality test.<<ETX>>","PeriodicalId":360985,"journal":{"name":"[1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128706422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书