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

Proceedings 1999 Pacific Rim International Symposium on Dependable Computing最新文献

筛选
英文 中文
Reconfiguration of two-dimensional meshes embedded in hypercubes 在超立方体中嵌入二维网格的重构
Proceedings 1999 Pacific Rim International Symposium on Dependable Computing Pub Date : 1999-12-16 DOI: 10.1109/PRDC.1999.816234
S. Nakano, N. Kamiura, Y. Hata, N. Matsui
{"title":"Reconfiguration of two-dimensional meshes embedded in hypercubes","authors":"S. Nakano, N. Kamiura, Y. Hata, N. Matsui","doi":"10.1109/PRDC.1999.816234","DOIUrl":"https://doi.org/10.1109/PRDC.1999.816234","url":null,"abstract":"Proposes a method of reconfiguring 2D meshes embedded in hypercubes. Our reconfiguration for link failures consists of two stages. The first stage assigns the d dimensions of the hypercubes to two directions with respect to rows and columns in the mesh, so that the number of disconnected pairs with adjacent rows and columns becomes smaller. The second stage re-establishes the mesh communication by assigning the Cartesian product of two Gray code sequences, which represent the order of healthy rows and columns to every node. We introduce graphs with edges corresponding to connections between rows or columns, and search the sequences. Then either an approach based on the depth-first search or one based on a genetic algorithm is applied to the graphs. The approach is made valid for node failures by regarding a faulty node as a node without healthy links. Simulation results show that our method reconfigures embedded meshes efficiently with relatively short computation time.","PeriodicalId":389294,"journal":{"name":"Proceedings 1999 Pacific Rim International Symposium on Dependable Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129763281","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
Self-validating diagnosis of hypercube systems 超立方体系统的自验证诊断
Proceedings 1999 Pacific Rim International Symposium on Dependable Computing Pub Date : 1999-12-16 DOI: 10.1109/PRDC.1999.816232
P. Santi, P. Maestrini
{"title":"Self-validating diagnosis of hypercube systems","authors":"P. Santi, P. Maestrini","doi":"10.1109/PRDC.1999.816232","DOIUrl":"https://doi.org/10.1109/PRDC.1999.816232","url":null,"abstract":"A novel approach to the diagnosis of hypercubes, called self-validating diagnosis (SVD), is introduced. An algorithm bared on this approach, called the SVD algorithm, is presented and evaluated. Given any fault set and the resulting syndrome, the algorithm returns a diagnosis and a syndrome-dependent bound, T/sub /spl sigma//, with the property that the diagnosis is correct (although possibly incomplete) if the actual number of faulty units is less than T/sub /spl sigma//. The average of T/sub /spl sigma// is very large and the diagnosis is almost complete even when the percentage of faulty units in the system approaches 50%. Moreover, the diagnosis correctness can be validated deterministically by individually probing a very small number of units. These results suggest that the SVD algorithm is suitable for applications requiring a large degree of diagnosability, as is the case for wafer-scale testing of VLSI chips, where the percentage of faulty units may be as large us 50%.","PeriodicalId":389294,"journal":{"name":"Proceedings 1999 Pacific Rim International Symposium on Dependable Computing","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115157179","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 fuzzy based approach for the design and evaluation of dependable systems using the Markov model 基于模糊的马尔可夫模型可靠系统设计与评价方法
Proceedings 1999 Pacific Rim International Symposium on Dependable Computing Pub Date : 1999-12-16 DOI: 10.1109/PRDC.1999.816220
P. Cugnasca, M. C. Andrade, J. Camargo
{"title":"A fuzzy based approach for the design and evaluation of dependable systems using the Markov model","authors":"P. Cugnasca, M. C. Andrade, J. Camargo","doi":"10.1109/PRDC.1999.816220","DOIUrl":"https://doi.org/10.1109/PRDC.1999.816220","url":null,"abstract":"Dependability is a subject of great importance in the development of critical systems and may be quantified in terms of various factors, such as reliability, maintainability and availability, whose significance may vary between different applications. A generic technique based on the Markov model is proposed in this paper, using fuzzy theory, for the reliability and safety assessment of fault-tolerant computational systems, composed of replicated modules. As the Markov model requires some parameters which may not be precisely known during the calculation, this method allows uncertainty-based parameters that are represented as fuzzy numbers. As a consequence, the reliability and the safety time response are composed by several curves which have associated degrees of confidence. This result may be used to estimate the reliability and safety value range at a given instant of time where each value has an associated possibility degree in which the developer believes the system has.","PeriodicalId":389294,"journal":{"name":"Proceedings 1999 Pacific Rim International Symposium on Dependable Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125212505","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 simple and efficient deadlock recovery scheme for wormhole routed 2-dimensional meshes 一种简单有效的虫洞路由二维网格死锁恢复方案
Proceedings 1999 Pacific Rim International Symposium on Dependable Computing Pub Date : 1999-12-16 DOI: 10.1109/PRDC.1999.816231
Shih-Chang Wang, Hung-Yau Lin, S. Kuo, Yennun Huang
{"title":"A simple and efficient deadlock recovery scheme for wormhole routed 2-dimensional meshes","authors":"Shih-Chang Wang, Hung-Yau Lin, S. Kuo, Yennun Huang","doi":"10.1109/PRDC.1999.816231","DOIUrl":"https://doi.org/10.1109/PRDC.1999.816231","url":null,"abstract":"In order to avoid deadlocks, prevention-based routing algorithms impose certain routing restrictions which lead to high hardware complexity or low adaptability. If deadlock occurrences are extremely rare, recovery-based routing algorithms become more attractive with respect to hardware complexity and routing adaptability. A simple architecture where each router is provided with an additional special flit buffer was developed to achieving deadlock recovery. Disha-SEQ and Disha-CON are two deadlock recovery schemes based on such an architecture to accomplish sequential recovery and concurrent recovery, respectively. In this paper, we propose a simple recovery scheme for a 2D mesh with the same router architecture, and reduce drawbacks in Disha-SEQ or Disha-CON, such as hardwired tokens, finding the Hamiltonian cycle, Hamiltonian path labeling for each node, and non-minimal path routing. Moreover, the simulation results show that the proposed scheme has a similar performance to Disha-CON and is better than Disha-SEQ.","PeriodicalId":389294,"journal":{"name":"Proceedings 1999 Pacific Rim International Symposium on Dependable Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132713226","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}
引用次数: 3
A novel NMR structure with concurrent output error location capability 一种具有并发输出误差定位能力的新型核磁共振结构
Proceedings 1999 Pacific Rim International Symposium on Dependable Computing Pub Date : 1999-12-16 DOI: 10.1109/PRDC.1999.816209
Jianhui Jiang, Hongbao Shi, Y. Min, Xi Chen
{"title":"A novel NMR structure with concurrent output error location capability","authors":"Jianhui Jiang, Hongbao Shi, Y. Min, Xi Chen","doi":"10.1109/PRDC.1999.816209","DOIUrl":"https://doi.org/10.1109/PRDC.1999.816209","url":null,"abstract":"This paper proposes a novel N-modular redundancy (NMR) structure with concurrent output error location (COEL) capability. The concurrent output error locatable NMR structure consists of a conventional NMR structure and a totally self-checking (TSC) extra circuit with N+1 two-rail code outputs. This extra circuit is used for locating the output error produced by any replicated module or the voter, and the internal fault produced by the extra circuit itself. Such a self-checking extra circuit is called the output error locator (OEL). It is constructed by conventional TSC two-rail code checkers (TRCs) and self-testing multi-input comparators. Each comparator is made by adding one extra two-rail code input to the cascaded multi-input comparator. The error handling capabilities, hardware complexity and propagation delay are analyzed for the proposed OEL. The performance of the proposed scheme and that of the Gaitanis's scheme are compared for a triple modular redundancy (TMR) structure.","PeriodicalId":389294,"journal":{"name":"Proceedings 1999 Pacific Rim International Symposium on Dependable Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115014485","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}
引用次数: 3
Cost of ensuring safety in distributed database management systems 分布式数据库管理系统的安全保障成本
Proceedings 1999 Pacific Rim International Symposium on Dependable Computing Pub Date : 1999-12-16 DOI: 10.1109/PRDC.1999.816229
M. Sabaratnam, Svein-Olaf Hvasshovd, Øystein Torbjørnsen
{"title":"Cost of ensuring safety in distributed database management systems","authors":"M. Sabaratnam, Svein-Olaf Hvasshovd, Øystein Torbjørnsen","doi":"10.1109/PRDC.1999.816229","DOIUrl":"https://doi.org/10.1109/PRDC.1999.816229","url":null,"abstract":"Generally, applications employing database management systems (DBMS) require that the integrity of the data stored in the database be preserved during normal operation as well as after crash recovery. Preserving database integrity and availability needs extra safety measures in the form of consistency checks. Increased safety measures inflict adverse effect on performance by reducing throughput and increasing response time. This may not be agreeable for some critical applications and thus, a tradeoff is needed. This study evaluates the cost of extra consistency checks introduced in the data buffer cache in order to preserve the database integrity, in terms of performance loss. In addition, it evaluates the improvement in error coverage and fault tolerance, and occurrence of double failures causing long unavailability, with the help of fault injection. The evaluation is performed on a replicated DBMS, ClustRa. The results show that the checksum overhead in a DBMS inflicted with a very high TPC-B-like workload caused a reduction in throughput up to 5%. The error detection coverage improved from 62% to 92%. Fault injection experiments shows that corruption in database image went down from 13% to 0%. This indicates that the applications that require high safety, but can afford up to 5% performance loss can adopt checksum mechanisms.","PeriodicalId":389294,"journal":{"name":"Proceedings 1999 Pacific Rim International Symposium on Dependable Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116148277","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
Empirical-Bayesian availability indices of safety and time critical software systems with corrective maintenance 具有纠正性维护的安全和时间关键型软件系统的经验贝叶斯可用性指标
Proceedings 1999 Pacific Rim International Symposium on Dependable Computing Pub Date : 1999-12-16 DOI: 10.1109/PRDC.1999.816216
M. Sahinoglu, E. Chow
{"title":"Empirical-Bayesian availability indices of safety and time critical software systems with corrective maintenance","authors":"M. Sahinoglu, E. Chow","doi":"10.1109/PRDC.1999.816216","DOIUrl":"https://doi.org/10.1109/PRDC.1999.816216","url":null,"abstract":"If the recovery or remedial time is not incorporated in the reliability of a software module in a safety and time-critical integrated system operation, then a mere reliability index based on failure characteristics is simply not adequate and realistic. In deriving the probability density function (pdf) of the software availability, empirical Bayesian procedures will be used to employ expert engineering judgment through appropriate noninformative and informative prior distribution functions employing various definitions of risk functions. It is emphasized that the usage of maximum likelihood estimators regardless of the extent of historical data is erroneous and misleading.","PeriodicalId":389294,"journal":{"name":"Proceedings 1999 Pacific Rim International Symposium on Dependable Computing","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132200514","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
Availability and performance evaluation for automatic protection switching in TDMA wireless system TDMA无线系统中自动保护切换的有效性及性能评估
Proceedings 1999 Pacific Rim International Symposium on Dependable Computing Pub Date : 1999-12-16 DOI: 10.1109/PRDC.1999.816207
Hairong Sun, Y. Cao, Kishor S. Trivedi, James J. Han
{"title":"Availability and performance evaluation for automatic protection switching in TDMA wireless system","authors":"Hairong Sun, Y. Cao, Kishor S. Trivedi, James J. Han","doi":"10.1109/PRDC.1999.816207","DOIUrl":"https://doi.org/10.1109/PRDC.1999.816207","url":null,"abstract":"In this paper, we compare the availability and performance of a wireless TDMA system with and without automatic protection switching. Stochastic reward net models are constructed and solved by SPNP (Stochastic Petri Net Package). Hierarchical decomposition is adopted to simplify the analysis. The optimization of the number of guard channels reserved for the handoff calls is studied. Numerical results prove the accuracy of the decomposition and show the significant improvement of the availability and the performance indexed as the new call blocking probability and handoff call dropping probability, brought by automatic protection switching.","PeriodicalId":389294,"journal":{"name":"Proceedings 1999 Pacific Rim International Symposium on Dependable Computing","volume":"42 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127987920","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
Experimental assessment of COTS DBMS robustness under transient faults 瞬态故障下COTS DBMS鲁棒性的实验评估
Proceedings 1999 Pacific Rim International Symposium on Dependable Computing Pub Date : 1999-12-16 DOI: 10.1109/PRDC.1999.816230
D. Costa, H. Madeira
{"title":"Experimental assessment of COTS DBMS robustness under transient faults","authors":"D. Costa, H. Madeira","doi":"10.1109/PRDC.1999.816230","DOIUrl":"https://doi.org/10.1109/PRDC.1999.816230","url":null,"abstract":"This paper evaluates the behavior of a common off-the-shelf (COTS) database management system (DBMS) in presence of transient faults. Database applications have traditionally been a field with fault-tolerance needs, concerning both data integrity and availability. While most of the commercially available DBMS provide support for data recovery and fault-tolerance, very limited knowledge was available regarding the impact of transient faults in a COTS database system. In this experimental study, a strict off-the-shelf target system is used (Oracle 7.3 server running on top of Wintel platform), combined with a TPC-A based workload and a software implemented fault injection tool, XceptionNT. It was found out that a non-negligible amount of induced faults, 13%, lead to the database server hanging or premature termination. However, the results also show that COTS DBMS products has a reasonable behavior concerning data integrity, none of the injected faults affected end user data.","PeriodicalId":389294,"journal":{"name":"Proceedings 1999 Pacific Rim International Symposium on Dependable Computing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126897363","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}
引用次数: 8
LLT and LTn schemes: error recovery schemes in mobile environments LLT和LTn方案:移动环境中的错误恢复方案
Proceedings 1999 Pacific Rim International Symposium on Dependable Computing Pub Date : 1999-12-16 DOI: 10.1109/PRDC.1999.816208
Mikio Yagi, K. Kaneko, Hideo Ito
{"title":"LLT and LTn schemes: error recovery schemes in mobile environments","authors":"Mikio Yagi, K. Kaneko, Hideo Ito","doi":"10.1109/PRDC.1999.816208","DOIUrl":"https://doi.org/10.1109/PRDC.1999.816208","url":null,"abstract":"Recently various mobile stations become widely available due to the advance of communication and computer technologies. Because of the mobility of terminal devices and the bandwidth limitation of wireless networks, it is difficult to apply traditional error recovery schemes for fixed networks to mobile network environments directly. So, several recovery schemes for mobile environments have been proposed. They are improved versions of the backward recoveries, especially the checkpointing and the message logging. However these schemes consider either the total cost or the recovery time. In this paper we propose two new schemes which consider both of the cost and the time.","PeriodicalId":389294,"journal":{"name":"Proceedings 1999 Pacific Rim International Symposium on Dependable Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115335939","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学术官方微信