2009 IEEE/IFIP International Conference on Dependable Systems & Networks最新文献_第3页

A self-diagnosis technique using Reed-Solomon codes for self-repairing chips 一种使用里德-所罗门代码的自我诊断技术，用于自我修复芯片

2009 IEEE/IFIP International Conference on Dependable Systems & Networks Pub Date : 2009-09-29 DOI: 10.1109/DSN.2009.5270327

Xiangyu Tang, Seongmoon Wang

{"title":"A self-diagnosis technique using Reed-Solomon codes for self-repairing chips","authors":"Xiangyu Tang, Seongmoon Wang","doi":"10.1109/DSN.2009.5270327","DOIUrl":"https://doi.org/10.1109/DSN.2009.5270327","url":null,"abstract":"A self-diagnosis circuit that can be used for builtin self-repair is proposed. The circuit under diagnosis is assumed to be comprised of a large number of field repairable units (FRUs), which can be replaced with spares when they are found to be defective. Since the proposed self-diagnosis circuit is implemented on the chip, responses that are scanned out of scan chains are compressed first by the space compression circuit and then by the time compression circuit to reduce the volume of test response data. Both the space and the time compression circuit implement a Reed-Solomon code. Unlike prior work, in the proposed technique, responses of all FRUs are observed at the same time to reduce diagnosis time. The proposed diagnosis circuit can locate up to l defective FRUs. We propose a novel space-compression circuit that reduces hardware overhead by exploiting the frequency difference of the scan shift clock and the system clock. When the size of constituent multiple-input signature-register (MISR) is m, the total number of signatures to be stored for the fault-free signature is 2lmB bits, where 1 ≤ B ≤ m. The experimental results show that the proposed diagnosis circuit that can locate up to 4 defective FRUs in the same test session can be implemented with less than 1 % of hardware overhead for a large industrial design. Hardware overhead for the diagnosis circuit is lower for large CUDs.","PeriodicalId":376982,"journal":{"name":"2009 IEEE/IFIP International Conference on Dependable Systems & Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115560670","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

Decoupling Dynamic Information Flow Tracking with a dedicated coprocessor 用专用协处理器解耦动态信息流跟踪

2009 IEEE/IFIP International Conference on Dependable Systems & Networks Pub Date : 2009-09-29 DOI: 10.1109/DSN.2009.5270347

Hari Kannan, Michael Dalton, C. Kozyrakis

引用次数: 82

Power supply induced common cause faults-experimental assessment of potential countermeasures 电源共因故障——潜在对策的实验评估

2009 IEEE/IFIP International Conference on Dependable Systems & Networks Pub Date : 2009-09-29 DOI: 10.1109/DSN.2009.5270308

Peter Tummeltshammer, A. Steininger

引用次数: 12

Maximizing system lifetime by battery scheduling 通过电池调度最大化系统寿命

2009 IEEE/IFIP International Conference on Dependable Systems & Networks Pub Date : 2009-09-29 DOI: 10.1109/DSN.2009.5270351

M. Jongerden, B. Haverkort, H. Bohnenkamp, J. Katoen

引用次数: 40

An energy efficient circuit level technique to protect register file from MBUs and SETs in embedded processors 一种在嵌入式处理器中保护寄存器文件免受MBUs和set侵害的高能效电路级技术

2009 IEEE/IFIP International Conference on Dependable Systems & Networks Pub Date : 2009-09-29 DOI: 10.1109/DSN.2009.5270337

M. Fazeli, Alireza Namazi, S. Miremadi

{"title":"An energy efficient circuit level technique to protect register file from MBUs and SETs in embedded processors","authors":"M. Fazeli, Alireza Namazi, S. Miremadi","doi":"10.1109/DSN.2009.5270337","DOIUrl":"https://doi.org/10.1109/DSN.2009.5270337","url":null,"abstract":"This paper presents a circuit level soft errortolerant- technique, called RRC (Robust Register Caching), for the register file of embedded processors. The basic idea behind the RRC is to effectively cache the most vulnerable registers in a small highly robust register cache built by circuit level SEU and SET protected memory cells. To decide which cache entry should be replaced, the average number of read operations during a register ACE time is used as a criterion to judge. In fact, the victim cache entry is one which has the maximum read count. To minimize the power overhead of the RRC, the clock gating technique is efficiently exploited for the main register file resulting in significantly low power consumption. The RRC is able to protect the register file not only against Single Bit Upsets (SBUs) but also against Multiple Bit Upsets (MBUs) and Single Event Transients (SETs). The RRC is experimentally evaluated using the LEON processor. The experimental results show that, if the cache size is selected properly, the Architectural Vulnerability Factor (AVF) of the register file becomes about 1% while it imposes low power, area and performance overheads to the processor.","PeriodicalId":376982,"journal":{"name":"2009 IEEE/IFIP International Conference on Dependable Systems & Networks","volume":"51 89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124604573","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}

引用次数: 21

On the effectiveness of structural detection and defense against P2P-based botnets 基于p2p的僵尸网络结构检测与防御的有效性研究

2009 IEEE/IFIP International Conference on Dependable Systems & Networks Pub Date : 2009-09-29 DOI: 10.1109/DSN.2009.5270322

Duc T. Ha, Guanhua Yan, S. Eidenbenz, H. Ngo

{"title":"On the effectiveness of structural detection and defense against P2P-based botnets","authors":"Duc T. Ha, Guanhua Yan, S. Eidenbenz, H. Ngo","doi":"10.1109/DSN.2009.5270322","DOIUrl":"https://doi.org/10.1109/DSN.2009.5270322","url":null,"abstract":"Recently, peer-to-peer (P2P) networks have emerged as a covert communication platform for malicious programs known as bots. As popular distributed systems, they allow bots to communicate easily while protecting the botmaster from being discovered. Existing work on P2P-based botnets mainly focuses on measurement-based studies of botnet behaviors. In this work, through simulation, we study extensively the structure of P2P networks running Kademlia, one of a few widely used P2P protocols in practice. Our simulation testbed not only incorporates the actual code of a real Kademlia client software to achieve high realism, but also applies distributed event-driven simulation techniques to achieve high scalability. Using this testbed, we analyze the scaling, clustering, reachability, and various centrality properties of P2P-based botnets from a graph-theoretical perspective. We further demonstrate experimentally and theoretically that monitoring bot activities in a P2P network is difficult, suggesting that the P2P mechanism indeed helps botnets hide their communication effectively. Finally, we evaluate the effectiveness of some potential mitigation techniques, such as content poisoning, sybil-based and eclipse-based mitigation. Conclusions drawn from this work shed light on the structure of P2P botnets, how to monitor bot activities in P2P networks, and how to mitigate botnet operations effectively.","PeriodicalId":376982,"journal":{"name":"2009 IEEE/IFIP International Conference on Dependable Systems & Networks","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124636240","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}

引用次数: 50

Dynamic content web applications: Crash, failover, and recovery analysis 动态内容web应用程序:崩溃、故障转移和恢复分析

2009 IEEE/IFIP International Conference on Dependable Systems & Networks Pub Date : 2009-09-29 DOI: 10.1109/DSN.2009.5270331

L. E. Buzato, G. M. D. Vieira, W. Zwaenepoel

引用次数: 10

LFI: A practical and general library-level fault injector LFI:一个实用的通用库级故障注入器

2009 IEEE/IFIP International Conference on Dependable Systems & Networks Pub Date : 2009-09-29 DOI: 10.1109/DSN.2009.5270313

P. Marinescu, George Candea

引用次数: 90

An end-to-end approach for the automatic derivation of application-aware error detectors 用于自动派生应用程序感知错误检测器的端到端方法

2009 IEEE/IFIP International Conference on Dependable Systems & Networks Pub Date : 2009-09-29 DOI: 10.1109/DSN.2009.5270291

Galen Lyle, Shelley Cheny, K. Pattabiraman, Z. Kalbarczyk, R. Iyer

引用次数: 34

A low-tech solution to avoid the severe impact of transient errors on the IP interconnect 一个低技术含量的解决方案，以避免瞬态错误对IP互连的严重影响

2009 IEEE/IFIP International Conference on Dependable Systems & Networks Pub Date : 2009-09-29 DOI: 10.1109/DSN.2009.5270301

D. Graham, P. Strid, Scott Roy, Fernando Rodriguez

引用次数: 5