发布求助
文献互助 智能选刊 最新文献

Proceedings of Annual Symposium on Fault Tolerant Computing最新文献

筛选
英文 中文
Compiler-assisted generation of error-detecting parallel programs 编译器辅助的错误检测并行程序的生成
Proceedings of Annual Symposium on Fault Tolerant Computing Pub Date : 1996-06-25 DOI: 10.1109/FTCS.1996.534621
Amber Roy-Chowdhury, P. Banerjee
{"title":"Compiler-assisted generation of error-detecting parallel programs","authors":"Amber Roy-Chowdhury, P. Banerjee","doi":"10.1109/FTCS.1996.534621","DOIUrl":"https://doi.org/10.1109/FTCS.1996.534621","url":null,"abstract":"We have developed an automated a compile time approach to generating error-detecting parallel programs. The compiler is used to identify statements implementing affine transformations within the program and to automatically insert code for computing, manipulating, and comparing checksums in order to detect data errors at runtime. Statements which do not implement affine transformations are checked by duplication. Checksums are reused from one loop to the next if this is possible, rather than recomputing checksums for every statement. A global dataflow analysis is performed in order to determine points at which checksums need to be recomputed. We also use a novel method of specifying the data distributions of the check data using data distribution directives so that the computations on the original data, and the corresponding check computations are performed on different processors. Results on the time overhead and error coverage of the error detecting parallel programs over the original programs are presented on an Intel Paragon distributed memory multicomputer.","PeriodicalId":191163,"journal":{"name":"Proceedings of Annual Symposium on Fault Tolerant Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121043800","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}
引用次数: 7
Verification of fault tolerance and real time 验证容错性和实时性
Proceedings of Annual Symposium on Fault Tolerant Computing Pub Date : 1996-06-25 DOI: 10.1109/FTCS.1996.534609
Zhiming Liu, M. Joseph
{"title":"Verification of fault tolerance and real time","authors":"Zhiming Liu, M. Joseph","doi":"10.1109/FTCS.1996.534609","DOIUrl":"https://doi.org/10.1109/FTCS.1996.534609","url":null,"abstract":"A transformational method is given for specifying and verifying fault-tolerant, real-time programs. Such a program needs to be provably correct according to both its functional and real-time requirements, despite the possible occurrence of system failures. The paper demonstrates that a suitably expressive logic for real-time systems makes it possible to naturally model the state changes caused by system failures and determine their effect on the functional and real-time properties of executions.","PeriodicalId":191163,"journal":{"name":"Proceedings of Annual Symposium on Fault Tolerant Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121345133","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}
引用次数: 27
Algebraic techniques for the optimization of control flow checking 控制流检查优化的代数技术
Proceedings of Annual Symposium on Fault Tolerant Computing Pub Date : 1996-06-25 DOI: 10.1109/FTCS.1996.534601
G. Noubir, B. Choueiry
{"title":"Algebraic techniques for the optimization of control flow checking","authors":"G. Noubir, B. Choueiry","doi":"10.1109/FTCS.1996.534601","DOIUrl":"https://doi.org/10.1109/FTCS.1996.534601","url":null,"abstract":"Leveugle (1990) addressed the problem of reducing the overhead of online testing in dedicated controllers. He introduced a low-overhead technique that allows the detection of illegal paths in finite state machines. Based on Leveugle's idea for detecting illegal paths, we introduce a new simple signature function. This signature function can be efficiently implemented in software. The assignment of values to the states is carried out algebraically by matrix inversion instead of using exhaustive search methods. We show that signatures computed using MISR or checksum are particular cases of our more general signature function. Thus, the state assignment problem can be solved more efficiently. Then, we address the problems of latency and checking from a formal perspective and show that finding the smallest set of checking states (i.e., states where the static signature as compared with the run-time signature) that induces a latency less than or equal to a given value L is NP-hard and there exists no polynomial time algorithm that solves this problem unless P=NP.","PeriodicalId":191163,"journal":{"name":"Proceedings of Annual Symposium on Fault Tolerant Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122460812","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}
引用次数: 6
The design of totally self-checking checkers for some classes of Hadamard codes 对某些类型的Hadamard代码进行了完全自检检查器的设计
Proceedings of Annual Symposium on Fault Tolerant Computing Pub Date : 1996-06-25 DOI: 10.1109/FTCS.1996.534617
Naoki Wakita, Ken-ich Takagi, Y. Iwadare
{"title":"The design of totally self-checking checkers for some classes of Hadamard codes","authors":"Naoki Wakita, Ken-ich Takagi, Y. Iwadare","doi":"10.1109/FTCS.1996.534617","DOIUrl":"https://doi.org/10.1109/FTCS.1996.534617","url":null,"abstract":"Hadamard codes are derived from the rows of Hadamard matrices, and are widely used in signal processing, feature extractions, communications, and so forth. In this paper, the designs of totally self-checking checkers for these codes are considered. On account of their property that total number of codewords are small and their patterns are limited, same extra ideas are required to establish self-testing properties. There are 3 kinds of Hadamard matrices, Sylvester type, M sequence type and Paley type. The checker design obtained here is applicable to Paley type matrices of degree 8m+4, where m is a nonnegative integer, by making use of the property of difference sets. In the case of matrices of degree 8m+8, the checker design is still an open question. It is also shown that Sylvester type and M sequence type Hadamard codes checkers are obtained by systematic code checker design. Therefore, the total results obtained here cover the majority of Hadamard codes known so far.","PeriodicalId":191163,"journal":{"name":"Proceedings of Annual Symposium on Fault Tolerant Computing","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125862153","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
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信