2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.最新文献

筛选
英文 中文
Level oriented formal model for asynchronous circuit verification and its efficient analysis method 面向层次的异步电路验证形式化模型及其高效分析方法
T. Kitai, Yusuke Oguro, T. Yoneda, Eric Mercer, C. Myers
{"title":"Level oriented formal model for asynchronous circuit verification and its efficient analysis method","authors":"T. Kitai, Yusuke Oguro, T. Yoneda, Eric Mercer, C. Myers","doi":"10.1109/PRDC.2002.1185640","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185640","url":null,"abstract":"Using a level-oriented model for verification of asynchronous circuits helps users to easily construct formal models with high readability or to naturally model datapath circuits. On the other hand, in order to use such a model on large circuits, techniques to avoid the state explosion problem must be developed. This paper first introduces a level-oriented formal model based on time Petri nets, and then proposes its partial order reduction algorithm that prunes unnecessary state generation while guaranteeing the correctness of the verification.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"905 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132563041","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
A control theory approach for analyzing the effects of data errors in safety-critical control systems 安全关键控制系统中数据误差影响的控制理论分析方法
Örjan Askerdal, M. Gäfvert, M. Hiller, N. Suri
{"title":"A control theory approach for analyzing the effects of data errors in safety-critical control systems","authors":"Örjan Askerdal, M. Gäfvert, M. Hiller, N. Suri","doi":"10.1109/PRDC.2002.1185625","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185625","url":null,"abstract":"Computers are increasingly used for implementing control algorithms in safety-critical embedded applications, such as engine control, braking control and flight surface control. Addressing the consequent coupling of control performance with computer related errors, this paper develops a composite computer dependability/control theory methodology for analyzing the effects data errors have on control system dependability. The effect is measured as the resulting control error (defined as the difference between the desired value of a physical properly and its actual value). We use maximum bounds on this measure as the criterion for control system failure (i.e., if the control error exceeds a certain threshold, the system has failed). In this paper we a) present suitable models of computer faults for analysis of control level effects and related analysis methods, and b) apply traditional control theory analysis methods for understanding the effects of data errors on system dependability An automobile slip-control brake-system is used as an example showing the viability of our approach.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130635698","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
Fault-tolerant properties of generalized hierarchical completely-connected networks 广义层次全连通网络的容错特性
T. Takabatake, M. Kitakami, Hideo Ito
{"title":"Fault-tolerant properties of generalized hierarchical completely-connected networks","authors":"T. Takabatake, M. Kitakami, Hideo Ito","doi":"10.1109/PRDC.2002.1185630","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185630","url":null,"abstract":"As a network topology for a massively parallel computer system, generalized hierarchical completely-connected networks (HCC), which include conventional hierarchical networks, have been proposed. To apply an HCC to a parallel computer system effectively and to execute data processing on the HCC efficiently, the inherent fault-tolerant properties in the HCC must be revealed. However, the properties have not been clarified enough. In this paper, the properties, such as node-connectivity, node-disjoint paths or container, and wide/fault diameter, are verified for the HCC. The concept of the block-connectivity related to the node-connectivity of HCC is introduced, and the fault-tolerance of HCC is discussed. Furthermore, to clear those properties of HCC the unknown properties of other hierarchical networks are also cleared. As a result, the HCC has a fault-diameter that is about 1.5 times as long as the diameter of HCC.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127481072","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
Evaluation of convolutional-code-based FEC under limited recovery time and its application to real-time transmission 有限恢复时间下基于卷积码的FEC评估及其在实时传输中的应用
M. Arai, H. Kurosu, S. Fukumoto, K. Iwasaki
{"title":"Evaluation of convolutional-code-based FEC under limited recovery time and its application to real-time transmission","authors":"M. Arai, H. Kurosu, S. Fukumoto, K. Iwasaki","doi":"10.1109/PRDC.2002.1185643","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185643","url":null,"abstract":"In this paper we evaluate the effectiveness of using convolutional codes under a time limit for recovery as a method for packet loss recovery. We analyze the method's operation when a limitation on the number of received packets is substituted for the time limitation, and derive the probability for a lost packet being recovered before the arrival of the limiting number of succeeding packets. We also evaluate this probability in the results of simulation and estimate the buffer size required for a decoder. Moreover we apply this method in constructing a dependable videoconference system and observe the resulting improvement in QoS.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121832058","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 the effects of real and injected software faults: Linux as a case study 分析真实的和注入的软件故障的影响:以Linux为例
T. Jarboui, J. Arlat, Y. Crouzet, K. Kanoun, Thomas Marteau
{"title":"Analysis of the effects of real and injected software faults: Linux as a case study","authors":"T. Jarboui, J. Arlat, Y. Crouzet, K. Kanoun, Thomas Marteau","doi":"10.1109/PRDC.2002.1185618","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185618","url":null,"abstract":"The application of fault injection in the context of dependability benchmarking is far from being straightforward. One decisive issue to be addressed is to what extent injected faults are representative of actual faults. This paper proposes an approach to analyze the effects of real and injected faults.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123674776","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}
引用次数: 40
The cost of checkpointing, logging and recovery for the mobile agent systems 移动代理系统的检查点、日志记录和恢复成本
Hyunjoo Kim, H. Yeom, T. Park, Hyoungwoo Park
{"title":"The cost of checkpointing, logging and recovery for the mobile agent systems","authors":"Hyunjoo Kim, H. Yeom, T. Park, Hyoungwoo Park","doi":"10.1109/PRDC.2002.1185617","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185617","url":null,"abstract":"The reliable execution of a mobile agent is a very important design issue to build a mobile agent system and many fault-tolerant schemes have been proposed. Hence, we present the experimental evaluation of the performance of the fault-tolerant schemes for the mobile agent environment. Our evaluation focuses on the checkpointing schemes and deals with the cooperating agents.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122662719","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
A low overhead checkpointing protocol for mobile computing systems 用于移动计算系统的低开销检查点协议
Chi-Yi Lin, Szu-Chi Wang, S. Kuo, Ing-Yi Chen
{"title":"A low overhead checkpointing protocol for mobile computing systems","authors":"Chi-Yi Lin, Szu-Chi Wang, S. Kuo, Ing-Yi Chen","doi":"10.1109/PRDC.2002.1185616","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185616","url":null,"abstract":"Checkpointing protocols for distributed computing systems can also be applied to mobile computing systems, but the unique characteristics of the mobile environment need to be taken into account. In this paper, an improved time-based checkpointing protocol is proposed, which is suitable for mobile computing systems based on Mobile IP. The main improvement over a traditional time-based protocol is that our protocol reduces the number of checkpoints per checkpointing process to nearly minimum, so that fewer checkpoints need to be transmitted through the bandwidth-limited wireless links. The proposed protocol also performs very well in the aspects of minimizing the number and the size of messages transmitted in the wireless network. Therefore, the protocol brings very little overhead to a mobile host which has limited resource. Additionally, by integrating the improved timer synchronization technique, our protocol can also be applied to wide area networks.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128694447","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}
引用次数: 4
A class of random multiple bits in a byte error correcting (S/sub t/b/EC) codes for semiconductor memory systems 用于半导体存储系统的字节纠错(S/ t/b/EC)码中的一类随机多比特
G. Umanesan, E. Fujiwara
{"title":"A class of random multiple bits in a byte error correcting (S/sub t/b/EC) codes for semiconductor memory systems","authors":"G. Umanesan, E. Fujiwara","doi":"10.1109/PRDC.2002.1185644","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185644","url":null,"abstract":"Recent high density wide I/O DRAM chips are highly vulnerable to multiple random bit errors. Therefore, correcting multiple random bit errors that corrupt a single DRAM chip becomes very important in certain applications, such as semiconductor memories used in computer and communication systems, mobile systems, aircraft and satellites. This is because, in these applications, the presence of strong electromagnetic waves in the environment or the bombardment of an energetic particle on a DRAM chip is likely to upset more than just one bit stored in that chip. Under this situation, codes capable of correcting random multiple bit errors that are confined to a single DRAM chip output are suitable for application in high speed semiconductor memory systems. This paper proposes a class of codes called single t/b-error correcting (S/sub t/b/EC) codes which are capable of correcting random t-bit errors occurring within a single b-bit byte. For the case where the chip data output is 16 bits, i.e., b = 16, the S/sub 3/16/EC code proposed in this paper requires only 16 check bits, that is, only one chip is required for check bits at practical information lengths such as 64, 128 and 256 bits. Furthermore, this S/sub 3/16/EC code is capable of detecting more than 95% of all single 16 bit byte errors at information length 64 bits.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121357946","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
An alternative method of generating tests for path delay faults using N/sub i/-detection test sets 使用N/sub / i -检测测试集生成路径延迟故障测试的另一种方法
Hiroshi Takahashi, K. Saluja, Y. Takamatsu
{"title":"An alternative method of generating tests for path delay faults using N/sub i/-detection test sets","authors":"Hiroshi Takahashi, K. Saluja, Y. Takamatsu","doi":"10.1109/PRDC.2002.1185647","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185647","url":null,"abstract":"In order to generate tests for path delay faults we propose an alternative method that does not generate a test for each path delay fault directly. The proposed method generates an n-propagation test-pair set by using an N/sub i/-detection test set for single stuck-at faults. The n-propagation test-pair set is a set of vector pairs which contains n distinct vector pairs for every transition fault at a checkpoint (primary inputs and fanout branches in a circuit are called check points). We do not target the path delay faults for test generation, instead, the n-propagation test-pair set is generated for the transition (both rising and falling) faults of check points in the circuit, and simulated to determine their effectiveness for singly testable path delay faults and robust path delay faults. Results of experiments on the ISCAS'85 benchmark circuits show that the n-propagation test-pair sets obtained by our method are very effective in testing path delay faults.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126122612","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}
引用次数: 12
Event log based dependability analysis of Windows NT and 2K systems 基于事件日志的Windows NT和2K系统可靠性分析
Cristina Simache, M. Kaâniche, Ayda Saïdane
{"title":"Event log based dependability analysis of Windows NT and 2K systems","authors":"Cristina Simache, M. Kaâniche, Ayda Saïdane","doi":"10.1109/PRDC.2002.1185651","DOIUrl":"https://doi.org/10.1109/PRDC.2002.1185651","url":null,"abstract":"This paper presents a measurement-based dependability study using event logs collected during about 3 years from 133 Windows NT and 2K workstations and servers interconnected through a LAN. We focus on the identification of machine reboots, the classification of of their causes, and the evaluation of statistics characterizing the uptimes, downtimes, and the availability of the Windows NT and 2K machines.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133385457","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}
引用次数: 44
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学术官方微信