13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)最新文献_第3页

Resilient Intrusion Tolerance through Proactive and Reactive Recovery 通过主动和被动恢复实现弹性入侵容忍

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) Pub Date : 2007-12-17 DOI: 10.1109/PRDC.2007.52

Paulo Sousa, A. Bessani, M. Correia, N. Neves, P. Veríssimo

引用次数: 86

Applying a Threshold Scheme to the Pseudonymization of Health Data 阈值方案在健康数据假名化中的应用

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) Pub Date : 2007-12-17 DOI: 10.1109/PRDC.2007.24

Bernhard Riedl, V. Grascher, T. Neubauer

引用次数: 67

Self-Adjusting Indexing Techniques for Communication-Induced Checkpointing Protocols 通信诱导检查点协议的自调整索引技术

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) Pub Date : 2007-12-17 DOI: 10.1109/PRDC.2007.8

Jichiang Tsai, Chia-Yang Chen, Ming-Fa Hu, Jenn-Wei Lin

引用次数: 3

An Accurate Model of Software Reliability 软件可靠性的精确模型

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) Pub Date : 2007-12-17 DOI: 10.1109/PRDC.2007.12

Shiyi Xu

引用次数: 10

An On-Line Control Flow Checking Method for VLIW Processor VLIW处理器控制流在线检测方法

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) Pub Date : 2007-12-17 DOI: 10.1109/PRDC.2007.26

Shuming Chen, Xiao Hu, Biwei Liu, Jihua Chen

{"title":"An On-Line Control Flow Checking Method for VLIW Processor","authors":"Shuming Chen, Xiao Hu, Biwei Liu, Jihua Chen","doi":"10.1109/PRDC.2007.26","DOIUrl":"https://doi.org/10.1109/PRDC.2007.26","url":null,"abstract":"On-line control flow checking is able to detect wrong program execution paths caused by transient or intermittent hardware faults. Focusing on fault detection for YHFT-DSP, an embedded processor with very long instruction words (VLIW) structure, a hybrid control flow checking method (VLIW-CFC, V-CFC) based on signature monitoring is proposed. Signature instructions are designed for transmitting the redundancy information stored in signature and they are executed in unoccupied instruction slots to minimize the overhead of processor performance. Instruction signature is obtained by compressing instruction codes in a basic block, and it guarantees the execution integrality and correctness of this block. Branch signature is obtained from the program control flow graph (CFG) and dynamic offset signature instructions (DOSI), and it guarantees the correct execution sequences of multiple blocks. V-CFC with the two signatures is able to check control flow errors including execution sequences and bit flips of instruction codes. V-CFC reaches the high error-detection coverage, low performance loss and hardware costs, and it is well suited for embedded systems.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130106097","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

Improving Dependability Using Shared Supplementary Memory and Opportunistic Micro Rejuvenation in Multi-tasking Embedded Systems 在多任务嵌入式系统中使用共享补充内存和机会性微恢复来提高可靠性

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) Pub Date : 2007-12-17 DOI: 10.1109/PRDC.2007.54

V. Sundaram, Sandip HomChaudhuri, S. Garg, C. Kintala, S. Bagchi

{"title":"Improving Dependability Using Shared Supplementary Memory and Opportunistic Micro Rejuvenation in Multi-tasking Embedded Systems","authors":"V. Sundaram, Sandip HomChaudhuri, S. Garg, C. Kintala, S. Bagchi","doi":"10.1109/PRDC.2007.54","DOIUrl":"https://doi.org/10.1109/PRDC.2007.54","url":null,"abstract":"We propose a comprehensive solution to handle memory-overflow problems in multitasking embedded systems thereby improving their reliability and availability. In particular, we propose two complementary techniques to address two significant causes of memory-overflow problems. The first cause is errors in estimating appropriate stack and heap memory requirement. Our first technique, called shared supplementary memory (SSM), exploits the fact that the probability of multiple tasks requiring more than their estimated amount of memory concurrently is low. Using analytical model and simulations, we show that reliability can be considerably improved when SSM is employed. Furthermore, for the same reliability, SSM reduces total memory requirement by as much as 29.31% The second cause is the presence of coding Mandelbugs, which can cause abnormal memory requirement. To address this, we propose a novel technique, called opportunistic micro-rejuvenation, which when combined with SSM, provide several advantages: preventing critical-time outage, resource frugality and dependability enhancement.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121676547","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}

引用次数: 17

Heterogeneous Functional Units for High Speed Fault-Tolerant Execution Stage 高速容错执行阶段的异构功能单元

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) Pub Date : 2007-12-17 DOI: 10.1109/PRDC.2007.45

Yousuke Nakamura, K. Hiraki

引用次数: 6

A Hybrid Redundancy Approach for Data Availability in Structured P2P Network Systems 结构化P2P网络系统中数据可用性的混合冗余方法

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) Pub Date : 2007-12-17 DOI: 10.1109/PRDC.2007.7

Guangping Xu, G. Wang, Jing Liu

引用次数: 16

Failure Detectors and Extended Paxos for k-Set Agreement k-Set协议的故障检测器和扩展Paxos

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) Pub Date : 2007-12-17 DOI: 10.1109/PRDC.2007.20

Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu

{"title":"Failure Detectors and Extended Paxos for k-Set Agreement","authors":"Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu","doi":"10.1109/PRDC.2007.20","DOIUrl":"https://doi.org/10.1109/PRDC.2007.20","url":null,"abstract":"Failure detector class Omegakappa has been defined in (G. Neiger, 1995) as an extension to failure detector Omega, and an algorithm has been given in (A. Mostefaoui et al., 2005) to solve k-set agreement using Omegakappa in asynchronous message-passing systems. In this paper, we extend these previous work in two directions. First, we define two new classes of failure detectors Omegakappa ' and Omegakappa \",which are new ways of extending Omega and show that they are equivalent to Omegakappa. Class Omegakappa ' is more flexible than Omegakappa in that it does not require the outputs to stabilize eventually, while class Omegakappa \" does not refer to other processes in its outputs. Second, we present a new algorithm that solves k-set agreement using Omegakappa \" when a majority of processes do not crash. The algorithm is a faithful extension of the Paxos algorithm (L. Lamport, 1998), and thus it inherits the efficiency, flexibility, and robustness of the Paxos algorithm. In particular, it has better message complexity than the algorithm in (A. Mostefaoui et al., 2005). Both the new failure detectors and the new algorithm enrich our understanding of the k-set agreement problem.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127101117","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

A New Concurrent Detection of Control Flow Errors Based on DCT Technique 一种新的基于DCT技术的控制流误差并发检测方法

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007) Pub Date : 2007-12-17 DOI: 10.1109/PRDC.2007.61

H. Lai, S. Horng, Yong-Yuan Chen, P. Fan, Yi Pan

{"title":"A New Concurrent Detection of Control Flow Errors Based on DCT Technique","authors":"H. Lai, S. Horng, Yong-Yuan Chen, P. Fan, Yi Pan","doi":"10.1109/PRDC.2007.61","DOIUrl":"https://doi.org/10.1109/PRDC.2007.61","url":null,"abstract":"In this paper, a program is first divided into several data computing blocks (DCBs) by the branch instruction; each DCB can then be recognized as an image. We then use the one dimension discrete cosine transform (1-D DCT) to compute each DCB to generate several signatures including 5-bits relay DCT signature (R-DCT-S) and 32-bits final DCT signature (F-DCT-S). These generated signatures are embedded into the instruction memory and then used to do the run time error checking. The watchdog should not reduce the processor performance, not increase the fault detection latency and not increase the memory overhead to store the signatures; in this paper, the processor degradation can be improved by doing the whole block error checking after the branch instruction, the fault detection latency is improved by doing the intermediate error checking at the R-type instruction, and the memory overhead is reduced by storing the R-DCT-S to the R-type instruction. The experimental results show that the proposed watchdog has very high error detection coverage and shortest error detection latency to detect either single fault or multi-faults, no matter what the fault is transient or intermittent.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128262472","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