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

2008 14th IEEE Pacific Rim International Symposium on Dependable Computing最新文献

筛选
英文 中文
Path Delay Fault Test Set for Two-Rail Logic Circuits 双轨逻辑电路路径延迟故障测试仪
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.8
K. Namba, Hideo Ito
{"title":"Path Delay Fault Test Set for Two-Rail Logic Circuits","authors":"K. Namba, Hideo Ito","doi":"10.1109/PRDC.2008.8","DOIUrl":"https://doi.org/10.1109/PRDC.2008.8","url":null,"abstract":"Two-rail logic circuits can be efficiently tested by non-codeword vector pairs. However, non-codeword vector pairs may sensitize some path delay faults which affect neither normal operation nor strongly fault secure property of the two-rail logic circuits. It means that testing with non-codeword vector pairs may be over-testing. This paper presents a construction of robust path delay fault test sets for two-rail logic circuits. The proposed test sets do not lead to the over-testing.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130287340","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
Eventual Leader Election in the Crash-Recovery Failure Model 崩溃恢复失败模型中的最终领导人选举
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.10
Cristian Martín, M. Larrea
{"title":"Eventual Leader Election in the Crash-Recovery Failure Model","authors":"Cristian Martín, M. Larrea","doi":"10.1109/PRDC.2008.10","DOIUrl":"https://doi.org/10.1109/PRDC.2008.10","url":null,"abstract":"Unreliable failure detectors provide information about process failures. A particular failure detector called Omega has been shown to be the weakest for solving consensus with a majority of correct processes. This work addresses the implementation of Omega in the crash-recovery failure model. Firstly, the definition of Omega is adapted to that model, assuming that processes do not use stable storage. After that, an algorithm implementing Omega under some weak assumptions on communication reliability and synchrony is proposed.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133780395","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
Countering IPC Threats in Multiserver Operating Systems (A Fundamental Requirement for Dependability) 应对多服务器操作系统中的IPC威胁(可靠性的基本要求)
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.25
J. Herder, H. Bos, Ben Gras, P. Homburg, A. Tanenbaum
{"title":"Countering IPC Threats in Multiserver Operating Systems (A Fundamental Requirement for Dependability)","authors":"J. Herder, H. Bos, Ben Gras, P. Homburg, A. Tanenbaum","doi":"10.1109/PRDC.2008.25","DOIUrl":"https://doi.org/10.1109/PRDC.2008.25","url":null,"abstract":"Multiserver operating systems have great potential to improve dependability, but, paradoxically, are paired with inherently more complex interprocess communication (IPC). Several projects have attempted to run drivers and extensions in isolated protection domains, but a systematic way to deal with IPC threats posed by untrusted parties is not yet available in the literature. IPC is fundamental to the dependability of multiserver systems.In this paper, we present a classification of IPC threats in multiserver systems with unreliable and hostile senders and receivers, such as resource exhaustion, spoofing, and unauthorized access. We also introduce an extended asymmetric trust model, describing two new IPC vulnerabilities relating to caller blockage. Based on our classification of IPC threats we present the IPC defense mechanisms and architecture of MINIX 3.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116787561","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
A Process Health Status Service for Safety Related Systems Using TT/ET Communication Scheduling 使用TT/ET通信调度的安全相关系统的进程健康状态服务
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.42
C. Bergenhem, J. Karlsson
{"title":"A Process Health Status Service for Safety Related Systems Using TT/ET Communication Scheduling","authors":"C. Bergenhem, J. Karlsson","doi":"10.1109/PRDC.2008.42","DOIUrl":"https://doi.org/10.1109/PRDC.2008.42","url":null,"abstract":"This paper describes a health status protocol for distributed real-time systems that use TTCAN, Flexray, or other networks which support both time-triggered and event-triggered communication. The protocol allows a group of co-operating processes to establish a consistent view of each other¿s health status over time. It extends the instantaneous view, of operational status of each process, provided by a process group membership protocol. The health status and membership protocols are intended for systems where processes (not nodes) are considered the smallest unit of failure, and where process failures can be detected and recovered locally by the host node. Such systems require a decision function that determines whether a process failure is temporary (the process is being recovered by the host node) or permanent (local recovery is not possible or was unsuccessful). Our protocol ensures that such decisions are made consistently among correct nodes despite symmetrical and asymmetrical omission failures.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129614375","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
Limitations of the Linux Fault Injection Framework to Test Direct Memory Access Address Errors Linux错误注入框架测试直接内存访问地址错误的局限性
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.44
Roberto Jung Drebes, T. Nanya
{"title":"Limitations of the Linux Fault Injection Framework to Test Direct Memory Access Address Errors","authors":"Roberto Jung Drebes, T. Nanya","doi":"10.1109/PRDC.2008.44","DOIUrl":"https://doi.org/10.1109/PRDC.2008.44","url":null,"abstract":"Device drivers can be traced as the source of most operating system (OS) bugs. The Linux kernel includes a fault injection framework which developers can use to implement simple fault injection tools to test device drivers. This paper presents our results in applying the fault injection framework to inject DMA address errors. Our experiments show that while the injected errors reach the device driver, the asynchronous nature of DMA makes the framework an ill-suited approach if the fault injection campaign expects the errors to reach the hardware I/O devices, as when trying to test IOMMU implementations.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134640900","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}
引用次数: 5
Versatile and Efficient Techniques for Speeding-Up Circuit Level Simulated Fault-Injection Campaigns 加速电路级模拟故障注入运动的通用高效技术
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.9
Weiguang Sheng, Liyi Xiao, Zhigang Mao
{"title":"Versatile and Efficient Techniques for Speeding-Up Circuit Level Simulated Fault-Injection Campaigns","authors":"Weiguang Sheng, Liyi Xiao, Zhigang Mao","doi":"10.1109/PRDC.2008.9","DOIUrl":"https://doi.org/10.1109/PRDC.2008.9","url":null,"abstract":"Fault injection in circuit level has proved to be cumbersome and time-consuming when employed to characterize the soft error sensitivity of digital circuits, hence new generation of CAD tool is required to automate the faults insertion and the validation of soft error mitigation mechanisms of the circuits. This paper outlines the characteristics of a new fault-injection platform HSECT-SPI (HIT Soft Error Characterization Toolkit-Spice Based) and its evaluation in some benchmark circuits implemented with distinct processes and soft error hardening techniques. It also details some techniques devised and implemented within the platform to automate and speed-up the circuit level fault-injection experiments. Experimental results are provided, showing that the platform is efficient, accurate and can direct the design of soft error immune circuits with at least three orders of magnitudes speed gain.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"30 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114394562","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
Language and Tool Support for Model Checking of Fault-Tolerant Distributed Algorithms 容错分布式算法模型检验的语言和工具支持
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.13
Takahiro Minamikawa, Tatsuhiro Tsuchiya, T. Kikuno
{"title":"Language and Tool Support for Model Checking of Fault-Tolerant Distributed Algorithms","authors":"Takahiro Minamikawa, Tatsuhiro Tsuchiya, T. Kikuno","doi":"10.1109/PRDC.2008.13","DOIUrl":"https://doi.org/10.1109/PRDC.2008.13","url":null,"abstract":"Model checking is a successful formal verification technique; however, its application to fault-tolerant distributed algorithms is still not common practice. One major reason for this is that model checking requires non-negligible users¿ efforts in representing the algorithm to be verified in the input language of a model checker. To alleviate this problem we propose an approach which encompasses (i) a language for concisely describing fault-tolerant distributed algorithms and (ii) a translator from the proposed language to PROMELA, the input language of the SPIN model checker. To demonstrate the feasibility of our approach, we show the results of an experiment where we described and verified several algorithms for consensus, a well-known distributed agreement problem.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124338481","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
Runtime Security Adaptation Using Adaptive SSL 使用自适应SSL进行运行时安全适配
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.27
C. J. Lamprecht, A. Moorsel
{"title":"Runtime Security Adaptation Using Adaptive SSL","authors":"C. J. Lamprecht, A. Moorsel","doi":"10.1109/PRDC.2008.27","DOIUrl":"https://doi.org/10.1109/PRDC.2008.27","url":null,"abstract":"Self-adaptive security offers great potential in providing timely and fine grained security control. In this paper we experimentally investigate the effects of a security adaptation in various client-server scenarios. We do this using SSL/TLS and show how client load patterns determine the overall performance effect of a security adaptation. We also demonstrate the viability of such a system using adaptive SSL. Experiments and analysis show that client arrival rate is not sufficient for making an adaptation decision. The average requested file size and the client session duration play key roles in the performance effect of such an adaptation. Adaptation with file sizes larger than 8192 bytes and small session durations result in greater performance impact when the server is under heavy load.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129513064","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}
引用次数: 9
A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network 寻找网络中最可靠边不相交路径集的贪心技术
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.16
Ruen Chze Loh, S. Soh, M. Lazarescu, S. Rai
{"title":"A Greedy Technique for Finding the Most Reliable Edge-Disjoint-Path-Set in a Network","authors":"Ruen Chze Loh, S. Soh, M. Lazarescu, S. Rai","doi":"10.1109/PRDC.2008.16","DOIUrl":"https://doi.org/10.1109/PRDC.2008.16","url":null,"abstract":"Multipath routing protocols (MRP) help improve the network quality of service (QoS), including load balancing, fault tolerance (reliability), aggregate bandwidth and delay. While multipaths communication provides better failure-tolerance, their resilience only holds if the multiple paths are selected carefully. Note that selecting an optimal path set is a NP-complete problem. Recently, several algorithms have appeared in the literature to help construct multiple node-disjoint paths or multiple edge-disjoint paths. This paper presents two algorithms, discussing the later issue. The first algorithm, called clique-based-approach (CBA), finds the edge-disjoint-path-set with the optimal reliability. The second algorithm, greedy-CBA (CBA-G), is a heuristic that reduces the computational complexity of CBA. Results show that CBA-G improves the efficiency of CBA without negatively affecting its effectiveness. We also provide an explanation as to why CBA-G is able to produce edge-disjoint-path-sets with reliabilities equal or better than a benchmark protocol, DPSP.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123717058","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
RAS Modeling of an HPC Switch System 高性能计算交换系统的RAS建模
2008 14th IEEE Pacific Rim International Symposium on Dependable Computing Pub Date : 2008-12-15 DOI: 10.1109/PRDC.2008.19
D. Tang, William Bryson, Richard Elling
{"title":"RAS Modeling of an HPC Switch System","authors":"D. Tang, William Bryson, Richard Elling","doi":"10.1109/PRDC.2008.19","DOIUrl":"https://doi.org/10.1109/PRDC.2008.19","url":null,"abstract":"The high end of high performance computing (HPC) systems is now moving toward petascale deployments, delivering petaflops of computational capacity and petabytes of storage capacity. Interconnection of the sheer number of server nodes in an HPC system plays a vital role in the developments. InfiniBand has emerged as a compelling interconnect technology, and provides more scalability and significantly better cost- performance than any other known protocols. This paper presents a reliability, availability, and serviceability (RAS) modeling and analysis of the Sun Datacenter Switch 3456 system, the world's largest standards-based InfiniBand switch, with direct capacity to host up to 3,456 server nodes, against hardware faults. The results show that the system reliability, in terms of connectivity between the server nodes physically connected to the switch, is high for configurations with redundant ports. The study also shows that practicing deferred repair strategies can significantly reduce unscheduled service events and system downtime. Further, the study identifies optimal service strategies by a tradeoff analysis on reliability and availability.","PeriodicalId":369064,"journal":{"name":"2008 14th IEEE Pacific Rim International Symposium on Dependable Computing","volume":"142 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114005355","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学术官方微信