IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)最新文献_第5页

Mitigating the impact of ambient noise on Wireless Mesh Networks using adaptive link-quality-based packet replication 利用基于链路质量的自适应分组复制减轻环境噪声对无线Mesh网络的影响

IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) Pub Date : 2012-06-25 DOI: 10.1109/DSN.2012.6263918

Jesus Friginal, Juan-Carlos Ruiz-Garcia, D. Andrés, Antonio Bustos

{"title":"Mitigating the impact of ambient noise on Wireless Mesh Networks using adaptive link-quality-based packet replication","authors":"Jesus Friginal, Juan-Carlos Ruiz-Garcia, D. Andrés, Antonio Bustos","doi":"10.1109/DSN.2012.6263918","DOIUrl":"https://doi.org/10.1109/DSN.2012.6263918","url":null,"abstract":"Wireless Mesh networks (WMN) typically rely on proactive routing protocols to establish optimal communication routes between every pair of system nodes. These protocols integrate link-quality-based mechanisms to minimise the adverse effect of ambient noise on communications. This paper shows the limitations existing in such mechanisms by analysing the impact of ambient noise on three state-of-the-art proactive routing protocols: OLSR, B.A.T.M.A.N and Babel. As will be shown, the lack of context-awareness in their link-quality mechanisms prevents the protocols from adjusting their behaviour according to persistent levels of ambient noise, which may vary along the time. Consequently, they cannot minimise the impact of such noise on the availability of network routes. This issue is very serious for a WMN since the loss communication links may strongly increase the convergence time of the network. An adaptive extension to studied link-quality-based mechanisms is proposed to avoid the loss of communication links in the presence of high levels of ambient noise. The effectiveness of the proposal is experimentally assessed, thus establishing a new method to reduce the impact of ambient noise on WMN.","PeriodicalId":236791,"journal":{"name":"IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)","volume":"36 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123484039","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

Practical scrubbing: Getting to the bad sector at the right time 实用擦洗:在正确的时间到达坏扇区

IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) Pub Date : 2012-06-25 DOI: 10.1109/DSN.2012.6263919

George Amvrosiadis, Alina Oprea, Bianca Schroeder

引用次数: 20

Understanding soft error propagation using Efficient vulnerability-driven fault injection 使用高效漏洞驱动的故障注入理解软错误传播

IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) Pub Date : 2012-06-25 DOI: 10.1109/DSN.2012.6263923

Xin Xu, Man-Lap Li

{"title":"Understanding soft error propagation using Efficient vulnerability-driven fault injection","authors":"Xin Xu, Man-Lap Li","doi":"10.1109/DSN.2012.6263923","DOIUrl":"https://doi.org/10.1109/DSN.2012.6263923","url":null,"abstract":"Extreme CMOS scaling is expected to significantly impact the reliability of future microprocessors, prompting recent research effort on low-cost hardware-software cross-layer reliability solutions. To evaluate, statistical fault injection (SFI) is often used to estimate the error coverage of the underlying method. Unfortunately, because a significant number of errors injected by SFI are often derated, the evaluation becomes less rigorous and less efficient. This paper makes the observation that many derated errors can be gracefully avoided to allow the fault injection campaign to focus on likely non-derated faults that stress the method-under-test. We propose a biased injection framework called CriticalFault that employs vulnerability analysis to map out relevant faults for stress testing. With CriticalFault, our results show that the injection space is reduced by 29% and 59% of the biased injections cause either software aborts or silent data corruptions, both are improvements from SFI. Moreover, we characterize different propagation behaviors of these non-derated faults and discuss the implications of designing future cross-layer solutions. Overall, not only CriticalFault is highly effective in identifying relevant test cases for current systems, but reliability researchers and engineers can also conduct more in-depth and meaningful analysis in deveoping future reliability solutions using CriticalFault.","PeriodicalId":236791,"journal":{"name":"IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)","volume":"70 49","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120888706","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}

引用次数: 45

Toward comprehensive and accurate simulation performance prediction of parallel file systems 迈向全面准确的并行文件系统仿真性能预测

IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) Pub Date : 2012-06-25 DOI: 10.1109/DSN.2012.6263930

M. Erazo, Ting Li, Jason Liu, S. Eidenbenz

引用次数: 9

ExtraTime: Modeling and analysis of wearout due to transistor aging at microarchitecture-level 微结构级晶体管老化损耗的建模与分析

IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) Pub Date : 2012-06-25 DOI: 10.1109/DSN.2012.6263957

Fabian Oboril, M. Tahoori

引用次数: 109

NINEPIN: Non-invasive and energy efficient performance isolation in virtualized servers NINEPIN:虚拟化服务器中的非侵入性和节能性能隔离

IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) Pub Date : 2012-06-25 DOI: 10.1109/DSN.2012.6263956

P. Lama, Xiaobo Zhou

{"title":"NINEPIN: Non-invasive and energy efficient performance isolation in virtualized servers","authors":"P. Lama, Xiaobo Zhou","doi":"10.1109/DSN.2012.6263956","DOIUrl":"https://doi.org/10.1109/DSN.2012.6263956","url":null,"abstract":"A virtualized data center faces important but challenging issue of performance isolation among heterogeneous customer applications. Performance interference resulting from the contention of shared resources among co-located virtual servers has significant impact on the dependability of application QoS. We propose and develop NINEPIN, a non-invasive and energy efficient performance isolation mechanism that mitigates performance interference among heterogeneous applications hosted in virtualized servers. It is capable of increasing data center utility. Its novel hierarchical control framework aligns performance isolation goals with the incentive to regulate the system towards optimal operating conditions. The framework combines machine learning based self-adaptive modeling of performance interference and energy consumption, utility optimization based performance targeting and a robust model predictive control based target tracking. We implement NINEPIN on a virtualized HP ProLiant blade server hosting SPEC CPU2006 and RUBiS benchmark applications. Experimental results demonstrate that NINEPIN outperforms a representative performance isolation approach, Q-Clouds, improving the overall system utility and reducing energy consumption.","PeriodicalId":236791,"journal":{"name":"IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122368110","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}

引用次数: 39

Perspectives on software safety case development for unmanned aircraft 无人机软件安全案例开发展望

IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) Pub Date : 2012-06-25 DOI: 10.1109/DSN.2012.6263939

E. Denney, Ganesh J. Pai, I. Habli

引用次数: 41

BLOCKWATCH: Leveraging similarity in parallel programs for error detection BLOCKWATCH:利用并行程序中的相似性进行错误检测

IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) Pub Date : 2012-06-25 DOI: 10.1109/DSN.2012.6263959

Jiesheng Wei, K. Pattabiraman

引用次数: 18

Binary mutation testing through dynamic translation 通过动态翻译进行二进制突变检测

IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) Pub Date : 2012-06-25 DOI: 10.1109/DSN.2012.6263914

Markus Becker, C. Kuznik, Mabel M. Joy, Tao Xie, W. Müller

引用次数: 9

Robust data sharing with key-value stores 与键值存储的健壮数据共享

IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) Pub Date : 2011-06-06 DOI: 10.1145/1993806.1993843

Cristina Basescu, C. Cachin, Ittay Eyal, R. Haas, A. Sorniotti, M. Vukolic, Ido Zachevsky

{"title":"Robust data sharing with key-value stores","authors":"Cristina Basescu, C. Cachin, Ittay Eyal, R. Haas, A. Sorniotti, M. Vukolic, Ido Zachevsky","doi":"10.1145/1993806.1993843","DOIUrl":"https://doi.org/10.1145/1993806.1993843","url":null,"abstract":"A key-value store (KVS) offers functions for storing and retrieving values associated with unique keys. KVSs have become the most popular way to access Internet-scale “cloud” storage systems. We present an efficient wait-free algorithm that emulates multi-reader multi-writer storage from a set of potentially faulty KVS replicas in an asynchronous environment. Our implementation serves an unbounded number of clients that use the storage concurrently. It tolerates crashes of a minority of the KVSs and crashes of any number of clients. Our algorithm minimizes the space overhead at the KVSs and comes in two variants providing regular and atomic semantics, respectively. Compared with prior solutions, it is inherently scalable and allows clients to write concurrently. Because of the limited interface of a KVS, textbook-style solutions for reliable storage either do not work or incur a prohibitively large storage overhead. Our algorithm maintains two copies of the stored value per KVS in the common case, and we show that this is indeed necessary. If there are concurrent write operations, the maximum space complexity of the algorithm grows in proportion to the point contention. A series of simulations explore the behavior of the algorithm, and benchmarks obtained with KVS cloud-storage providers demonstrate its practicality.","PeriodicalId":236791,"journal":{"name":"IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126516015","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}

引用次数: 61