10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.最新文献_第4页

Ferret: a host vulnerability checking tool Ferret:主机漏洞检测工具

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI: 10.1109/PRDC.2004.1276595

A. Sharma, Jason Martin, N. Anand, M. Cukier, W. Sanders

引用次数: 12

Fault-tolerant message switching based on wormhole switching and backtracking 基于虫洞交换和回溯的容错消息交换

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI: 10.1109/PRDC.2004.1276569

Manabu Sueishi, M. Kitakami, Hideo Ito

{"title":"Fault-tolerant message switching based on wormhole switching and backtracking","authors":"Manabu Sueishi, M. Kitakami, Hideo Ito","doi":"10.1109/PRDC.2004.1276569","DOIUrl":"https://doi.org/10.1109/PRDC.2004.1276569","url":null,"abstract":"Parallel computers are now popularly applied to applications where many calculations are required. In a NO Remote memory Access model (NORA) parallel computer, many processors are connected by communication links and calculation results are obtained by communications among processors. The message switching method, which controls message transmission in the parallel computer, is one of the most important parameters to improve the performance of the parallel computer. Since parallel computers include many processors, its failure rate is very high and many fault-tolerant switching methods have been proposed. The existing methods have problems, however, such as low communication throughput, low fault-tolerant capability, and large hardware overhead. We propose fault-tolerant switching by improving wormhole switching. The proposed method inserts dummy flits, having no information, after the header flit, the first flit of the packet. By overwriting the header flit to the dummy flit, backtracking is implemented without hardware overhead. Computer simulation says that in a 16 by 16 2D torus, for example, the throughput of the proposed method is almost equal to that of existing methods which require large hardware overhead if the number of the faulty nodes is less then 40.","PeriodicalId":383639,"journal":{"name":"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130511101","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}

引用次数: 1

Analysis of read and write availability for generalized hybrid data replication protocol 通用混合数据复制协议的读写可用性分析

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI: 10.1109/PRDC.2004.1276565

M. Arai, Tabito Suzuki, Mamoru Ohara, S. Fukumoto, K. Iwasaki, H. Youn

引用次数: 13

Software rejuvenation policies for cluster systems under varying workload 不同工作负载下集群系统的软件恢复策略

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI: 10.1109/PRDC.2004.1276563

Wei Xie, Yiguang Hong, Kishor S. Trivedi

引用次数: 27

Node-to-node internally disjoint paths problem in bubble-sort graphs 冒泡排序图中的节点到节点内部不相交路径问题

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI: 10.1109/PRDC.2004.1276568

K. Kaneko, Yasuto Suzuki

引用次数: 16

Efficient built-in self-test techniques for memory-based FFT processors 基于内存的FFT处理器的高效内置自检技术

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI: 10.1109/PRDC.2004.1276582

Shyue-Kung Lu, Chien-Hung Yeh, Han-Wen Lin

{"title":"Efficient built-in self-test techniques for memory-based FFT processors","authors":"Shyue-Kung Lu, Chien-Hung Yeh, Han-Wen Lin","doi":"10.1109/PRDC.2004.1276582","DOIUrl":"https://doi.org/10.1109/PRDC.2004.1276582","url":null,"abstract":"Efficient built-in self-test techniques for memory-based FFT processors are proposed. The memory-based architecture is suitable for high computation point applications such as ADSL and OFDM systems. The FFT processor is first divided into the memory part and the logic part which can be tested under the supervision of the same BIST controller. The BIST controller can not only perform traditional memory test algorithms but also generates test patterns required for the logic part. The adopted memory test algorithm can be programmed by the users which covers different types of memory faults. For the logic part, the single cell fault model is assumed. Our BIST architecture tests both parts simultaneously such that the test time can be reduced greatly. The hardware overhead of our approach is also very low since novel design-for-testability techniques are applied for the logic part which mainly consists of multipliers. An experimental chip is designed and implemented with Synopsys synthesis tools. Experimental results show that the hardware overhead of the BIST architecture is only 4.06%. The fault coverage of the memory part depends on the March algorithm adopted. For the logic part, we can achieve 100% cell fault coverage with only 16 test patterns.","PeriodicalId":383639,"journal":{"name":"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134223030","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}

引用次数: 1

A freshness detection mechanism for railway applications 一种适用于铁路的新鲜度检测机制

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI: 10.1109/PRDC.2004.1276579

A. Bondavalli, E. Giudici, S. Porcarelli, Salvatore Sabina, F. Zanini

引用次数: 9

Periodic partial validation: cost-effective source code validation process in cross-platform software development environment 周期性的部分验证:在跨平台软件开发环境中具有成本效益的源代码验证过程

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI: 10.1109/PRDC.2004.1276597

Sheng Li, Jun Xu, Lijun Deng

引用次数: 2

Reliability evaluation of dependable distributed computing systems based on recursive merge and BDD 基于递归合并和BDD的可靠分布式计算系统可靠性评估

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI: 10.1109/PRDC.2004.1276570

Yung-Ruei Chang, Hung-Yau Lin, S. Kuo

{"title":"Reliability evaluation of dependable distributed computing systems based on recursive merge and BDD","authors":"Yung-Ruei Chang, Hung-Yau Lin, S. Kuo","doi":"10.1109/PRDC.2004.1276570","DOIUrl":"https://doi.org/10.1109/PRDC.2004.1276570","url":null,"abstract":"System reliability evaluation, sensitivity analysis, importance measures, failure frequency analysis and optimal design have become important issues for distributed dependable computing. Finding all the minimal file spanning trees (MFST) and avoiding repeatedly computing the redundant MFSTs is the key technique for evaluating the reliability of a distributed computing system (DCS) in previous works. However, identifying all the disjoint MFSTs is difficult and very time consuming for large-scale networks. Although existing algorithms have been demonstrated that they work fine on medium-scale networks, they have two inherent drawbacks. First, they do not support efficient manipulation of Boolean algebra. The sum-of-disjoint-products method used by them is inefficient in dealing with large Boolean functions. Second, the tree-based partitioning algorithm does not merge isomorphic subproblems and therefore, redundant computations cannot be avoided. We propose a new efficient algorithm for the reliability evaluation of a DCS based on recursive merge and binary decision diagram (BDD). Using the BDD substitution technique, we can easily apply our algorithm to a network with imperfect nodes. The experimental results show a significant improvement on the execution time compared to previous works.","PeriodicalId":383639,"journal":{"name":"10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133773761","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}

引用次数: 2

Nonsystematic M-ary asymmetric error correcting codes designed by multilevel coding method 采用多层编码方法设计非系统M-ary非对称纠错码

10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings. Pub Date : 2004-03-03 DOI: 10.1109/PRDC.2004.1276572

H. Kaneko, Mariko Numakami, E. Fujiwara

引用次数: 1