International Conference on Dependable Systems and Networks, 2004最新文献_第4页

Why PCs are fragile and what we can do about it: a study of Windows registry problems 为什么个人电脑很脆弱，我们能做些什么:对Windows注册表问题的研究

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311926

A. Ganapathi, Yi-Min Wang, N. Lao, Ji-Rong Wen

引用次数: 30

Assessing the impact of dynamic power management on the functionality and the performance of battery-powered appliances 评估动态电源管理对电池供电设备的功能和性能的影响

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311944

A. Acquaviva, A. Aldini, M. Bernardo, A. Bogliolo, E. Bontà, E. Lattanzi

{"title":"Assessing the impact of dynamic power management on the functionality and the performance of battery-powered appliances","authors":"A. Acquaviva, A. Aldini, M. Bernardo, A. Bogliolo, E. Bontà, E. Lattanzi","doi":"10.1109/DSN.2004.1311944","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311944","url":null,"abstract":"In this paper we provide an incremental methodology to assess the effect of the introduction of a dynamic power manager in a mobile embedded computing device. The methodology consists of two phases. In the first phase, we verify whether the introduction of the dynamic power manager alters the functionality of the system. We show that this can be accomplished by employing standard techniques based on equivalence checking for noninterference analysis. In the second phase, we quantify the effectiveness of the introduction of the dynamic power manager in terms of power consumption and overall system efficiency. This is carried out by enriching the functional model of the system with information about the performance aspects of the system, and by comparing the values of the power consumption and the overall system efficiency obtained from the solution of the performance model with and without dynamic power manager. To this purpose, first we employ a more abstract performance model based on the Markovian assumption, then we use a more realistic performance model - to be validated against the Markovian one - where general probability distributions are considered. The methodology is illustrated by means of its application to the study of a remote procedure call mechanism - through which a battery-powered device is used by some application requesting information - and of a streaming video service - which is accessed by a mobile client equipped with a power-manageable network interface card.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"44 5-6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114033558","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}

引用次数: 11

A decentralized algorithm for erasure-coded virtual disks 用于擦除编码的虚拟磁盘的分散算法

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311883

Svend Frølund, A. Merchant, Yasushi Saito, Susan Spence, Alistair C. Veitch

引用次数: 61

Dependable initialization of large-scale distributed software 大规模分布式软件的可靠初始化

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311903

J. Ren, R. Buskens, O. J. Gonzalez

{"title":"Dependable initialization of large-scale distributed software","authors":"J. Ren, R. Buskens, O. J. Gonzalez","doi":"10.1109/DSN.2004.1311903","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311903","url":null,"abstract":"Most documented efforts in fault-tolerant computing address the problem of recovering from failures that occur during normal system operation. To bring a system to a point where it can begin performing its duties first requires that the system successfully complete initialization. Large-scale distributed systems may take hours to initialize. For such systems, a key challenge is tolerating failures that occur during initialization, while still completing initialization in a timely manner. In this paper, we present a dependable initialization model that captures the architecture of the system to be initialized, as well as interdependencies among system components. We show that overall system initialization may sometimes complete more quickly if recovery actions are deferred as opposed to commencing recovery actions as soon as a failure is detected. This observation leads us to introduce a recovery decision function that dynamically assesses when to take recovery actions. We then describe a dependable initialization algorithm that combines the dependable initialization model and the recovery decision function for achieving fast initialization. Experimental results show that our algorithm incurs lower initialization overhead than that of a conventional initialization algorithm. This work is the first effort we are aware of that formally studies the challenges of initializing a distributed system in the presence of failures.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122106921","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

Checkpointing of control structures in main memory database systems 主存数据库系统中控制结构的检查点

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311939

Long Wang, Z. Kalbarczyk, R. Iyer, H. Vora, T. Chahande

引用次数: 7

Failure data analysis of a large-scale heterogeneous server environment 大规模异构服务器环境的故障数据分析

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311948

R. Sahoo, A. Sivasubramaniam, M. Squillante, Yanyong Zhang

{"title":"Failure data analysis of a large-scale heterogeneous server environment","authors":"R. Sahoo, A. Sivasubramaniam, M. Squillante, Yanyong Zhang","doi":"10.1109/DSN.2004.1311948","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311948","url":null,"abstract":"The growing complexity of hardware and software mandates the recognition of fault occurrence in system deployment and management. While there are several techniques to prevent and/or handle faults, there continues to be a growing need for an in-depth understanding of system errors and failures and their empirical and statistical properties. This understanding can help evaluate the effectiveness of different techniques for improving system availability, in addition to developing new solutions. In this paper, we analyze the empirical and statistical properties of system errors and failures from a network of nearly 400 heterogeneous servers running a diverse workload over a year. While improvements in system robustness continue to limit the number of actual failures to a very small fraction of the recorded errors, the failure rates are significant and highly variable. Our results also show that the system error and failure patterns are comprised of time-varying behavior containing long stationary intervals. These stationary intervals exhibit various strong correlation structures and periodic patterns, which impact performance but also can be exploited to address such performance issues.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124113752","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}

引用次数: 243

On benchmarking the dependability of automotive engine control applications 汽车发动机控制应用可靠性的基准测试

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311956

Juan-Carlos Ruiz-Garcia, P. Yuste, P. Gil, Lenin Lemus

引用次数: 30

Robust aggregation protocols for large-scale overlay networks 大规模覆盖网络的鲁棒聚合协议

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311873

A. Montresor, Márk Jelasity, Özalp Babaoglu

{"title":"Robust aggregation protocols for large-scale overlay networks","authors":"A. Montresor, Márk Jelasity, Özalp Babaoglu","doi":"10.1109/DSN.2004.1311873","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311873","url":null,"abstract":"Aggregation refers to a set of functions that provide global information about a distributed system. These junctions operate on numeric values distributed over the system and can be used to count network size, determine extremal values and compute averages, products or sums. Aggregation allows important basic functionality to be achieved in fully distributed and peer-to-peer networks. For example, in a monitoring application, some aggregate reaching a specific value may trigger the execution of certain operations; distributed storage systems may need to know the total free space available; load-balancing protocols may benefit from knowing the target average load so as to minimize the transfered load. Building on the simple but efficient idea of antientropy aggregation (a scheme based on the antientropy epidemic communication model), in this paper we introduce practically applicable robust and adaptive protocols for proactive aggregation, including the calculation of average, product and extremal values. We show how the averaging protocol can be applied to compute further aggregates like sum, variance and the network size. We present theoretical and empirical evidence supporting the robustness of the averaging protocol under different scenarios.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124260802","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}

引用次数: 102

Improving system dependability with functional alternatives 通过功能替代提高系统可靠性

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311899

C. Shelton, P. Koopman

引用次数: 23

A framework for dynamic Byzantine storage 用于动态拜占庭式存储的框架

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311902

Jean-Philippe Martin, L. Alvisi

引用次数: 62