检索结果-内蒙古大学图书馆

failure detectors for crash faults in cloud

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2019年第11期10卷 4407-4415页

作者： Sinha, Bharati Singh, Awadhesh Kumar Saini, Poonam Natl Inst Technol Kurukshetra 136119 Haryana India Punjab Engn Coll Chandigarh 160012 India

failure detector (FD) is an inherent component in atomic broadcast and consensus protocols. failures are broadly categorized into two types: crash and byzantine. The crash failures simply discontinue the working of a system whereas byzantine reflects the malicious behavior while ongoing communication. The problem to detect a failure becomes more challenging in a dynamic asynchronous environment like cloud computing. The paper proposes a failure detector in order to handle crash faults in cloud while addressing scalability. We introduce BCMP networks in order to compute performance parameters of the proposed algorithm, thereby, detecting failures in an accurate manner. Although, failure detection schemes have a tradeoff between efficiency and latency, the proposed algorithm achieves optimal balance between both metrics.

关键词： failure detectors Cloud computing Crash faults

来源：评论

学校读者我要写书评

暂无评论

failure detectors encapsulate fairness

引用

DISTRIBUTED COMPUTING 2012年第4期25卷 313-333页

作者： Pike, Scott M. Sastry, Srikanth Welch, Jennifer L. MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA

failure detectors have long been viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsulated by a given failure detector have met with limited success. The reason for this is that traditionally, models of partial synchrony are specified with respect to real time, but failure detectors do not encapsulate real time. Instead, we argue that failure detectors encapsulate the fairness in computation and communication. Fairness is a measure of the number of steps executed by one process relative either to the number of steps taken by another process or relative to the duration for which a message is in transit. We argue that failure detectors are substitutable for the fairness properties (rather than real-time properties) of partially synchronous systems. We propose four fairness-based models of partial synchrony and demonstrate that they are, in fact, the 'weakest system models' to implement the canonical failure detectors from the Chandra-Toueg hierarchy. We also propose a set of fairness-based models which encapsulate the parametric failure detectors which eventually and permanently suspect crashed processes, and eventually and permanently trust some fixed set of c correct processes.

关键词： failure detectors Partial synchrony Fairness Crash faults Fault tolerance Schedulers

来源：评论

学校读者我要写书评

暂无评论

failure detectors for wireless sensor-actuator systems

引用

AD HOC NETWORKS 2009年第5期7卷 1001-1013页

作者： Zia, Hamza A. Sridhar, Nigamanth Sastry, Shivakumar Cleveland State Univ Cleveland OH 44115 USA Univ Akron Akron OH 44325 USA

Wireless sensor-actuator systems (WSAS) offer exciting opportunities for emerging applications by facilitating fine-grained monitoring and control, and dense instrumentation. The large scale of such systems increases the need for such systems to tolerate and cope with failures, in a localized and decentralized manner. We present abstractions for detecting node failures and link failures caused by topology changes in a WSAS. These abstractions were designed and implemented as a set of reusable components in nesC under TinyOS. Results, which demonstrate the performance and viability of the abstractions, based on experiments oil an 80 node testbed are presented. In the future. these abstractions call be extended to detect and cope with larger classes of failures in WSAS. (c) 2008 Elsevier B.V. All rights reserved.

关键词： Sensor networks failure detectors Fault-tolerance Middleware

来源：评论

学校读者我要写书评

暂无评论

failure detectors in Loosely Named Systems

Failure Detectors in Loosely Named Systems

引用

27th Annual ACM Symposium on Principles of Distributed Computing

作者： Afek, Yehuda Nir, Israel Tel Aviv Univ & Cisco Syst Sch Comp Sci Tel Aviv Israel

ISBN: (纸本)9781595939890

This paper explores the power of failure detectors in read write shared memory systems with n processes whose names are drawn from the set {1, ... , m}, m >= 2n-1. We do so by making an additional assumption, name obliviousness, on top of the three failure detector assumptions introduced by Zielinski. We present name non-oblivious failure detectors that are strong enough to wait-free solve the Symmetry Breaking (SB) problem, but not enough to solve the (n - 1)-Set Consensus problem. Furthermore a family of weakest such failure detectors is presented. On the other hand we show that any non trivial name oblivious failure detector can wait-free solve (n - 1)-Set Consensus, by introducing a simple extension to anti-Omega, the Loose-anti-Omega failure detector, and proving that it is the weakest failure detector that confirms to the four assumptions above.

关键词： Wait-Free Symmetry Breaking Set Consensus failure detectors Anti-Omega Loosely Named Systems

来源：评论

学校读者我要写书评

暂无评论

A methodology to design arbitrary failure detectors for distributed protocols

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2008年第7期54卷 619-637页

作者： Baldoni, Roberto Helary, Jean-Michel Piergiovanni, Sara Tucci Univ Roma La Sapienza Dipartimento Informat & Sistemist Antonio Ruberti Rome Italy IRISA F-35042 Rennes France

Nowadays, there are many protocols able to cope with process crashes, but, unfortunately, a process crash represents only a particular faulty behavior. Handling tougher failures (e.g. sending omission failures, receive omission failures, arbitrary failures) is a real practical challenge due to malicious attacks or unexpected software errors. This is usually achieved either by changing, in an ad hoc manner, the code of a crash resilient protocol or by devising a new protocol from scratch. This paper proposes an alternative methodology to detect processes experiencing arbitrary failures. On this basis, it introduces the notions of liveness failure detector and safety failure detector as two independent software components. With this approach, the nature of failures experienced by processes becomes transparent to the protocol using the components. This methodology brings a few advantages: it makes possible to increase the resilience of a protocol designed in a crash failure context without changing its code by concentrating only on the design of a few well-specified components, and second, it clearly separates the task of designing the protocol from the task of detecting faulty processes, a methodological improvement. Finally, the feasibility of this approach is shown, by providing an implementation of liveness failure detectors and of safety failure detectors for two protocols: one solving the consensus, and the second solving the problem of global data computation. (c) 2007 Elsevier B.V. All rights reserved.

关键词： failure detectors arbitrary failures adaptive fault tolerance consensus global data computation problem distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Probabilistic and temporal failure detectors for solving distributed problems

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2021年 158卷 1-15页

作者： Guerraoui, Rachid Kozhaya, David Pignolet, Yvonne-Anne Ecole Polytech Fed Lausanne Lausanne Switzerland ABB Res Baden Switzerland DFINITY Zurich Switzerland

failure detectors (FD)s are celebrated for their modularity in solving distributed problems. Algorithms are constructed using FD building blocks. Synchrony assumptions to implement FDs are studied separately and are typically expressed as eventual guarantees that need to hold, after some point in time, foreverand deterministically. But in practice, they may hold only probabilistically and temporarily. This paper studies FDs in a realistic system N, where asynchrony is inflicted by probabilistic synchronous communication. We first address a problem with lozenge S, the weakest FD to solve consensus: an implementation of "consensus with probability 1" is possible in Nwithout randomness in the algorithm, while an implementation of "lozenge Swith probability 1" is impossible in N. We introduce lozenge S*, a new FD with probabilistic and temporal accuracy. We prove that lozenge S*(i) is implementable in Nand (ii) can replace lozenge S, in several existing deterministic consensus algorithms that use lozenge S, to yield an algorithm that solves "consensus with probability 1". We extend our results to other FD classes, e.g., lozenge P, and to a larger set of problems (beyond consensus), which we call decisive problems. (C) 2021 Elsevier Inc. All rights reserved.

关键词： failure detectors Probabilistic links Message loss Consensus Modular algorithms

来源：评论

学校读者我要写书评

暂无评论

failure detectors in Dynamic Distributed Systems

Failure Detectors in Dynamic Distributed Systems

引用

作者： Denis Jeanneau EDITE Sorbonne Universite

学位级别：博士

Dynamic systems are distributed systems in which (1) processes can join or leave the system during the run, and (2) the communication graph evolves over time. The failure detector abstraction was introduced as a way to circumvent the impossibility of solving consensus in asynchronous systems prone to crash failures. A failure detector is a local oracle that provides processes in the system with unreliable information on process failures. But a failure detector that is sufficient to solve a given problem in a static system is not necessarily sufficient to solve the same problem in a dynamic system. Additionally, some existing failure detectors cannot be implemented in dynamic systems. Therefore, it is necessary to redefine existing failure detectors and provide new algorithms. In this thesis, we provide a new definition of a failure detector for k-set agreement, and prove that it is sufficient to solve k-set agreement in dynamic systems. We also design a dynamic system model and an algorithm that implements this new failure detector. Additionally, we adapt an existing failure detector for mutual exclusion and prove that it is still the weakest failure detector to solve mutual exclusion in dynamic systems, which means that it is weaker than any other failure detector capable of solving mutual exclusion.

关键词： distributed systems failure detectors dynamic systems k-set agreement mutual exclusion

来源：评论

学校读者我要写书评

暂无评论

Implementing unreliable failure detectors with unknown membership

引用

INFORMATION PROCESSING LETTERS 2006年第2期100卷 60-63页

作者： Jimenez, Ernesto Arevalo, Sergio Fernandez, Antonio Univ Politecn Madrid EUI Madrid 28031 Spain Univ Rey Juan Carlos GSyC LADyR Mostoles 28933 Spain

No abstract available

关键词： failure detectors crash failures membership fault tolerance

来源：评论

学校读者我要写书评

暂无评论

On the Quality of Service of Crash-Recovery failure detectors

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2010年第3期7卷 271-283页

作者： Ma, Tiejun Hillston, Jane Anderson, Stuart Univ London Imperial Coll Sci Technol & Med Dept Comp S Kensington Campus180 Queens Gate London London SW7 2AZ England Univ Edinburgh Sch Informat Lab Fdn Comp Sci Edinburgh EH8 9AB Midlothian Scotland

We model the probabilistic behavior of a system comprising a failure detector and a monitored crash-recovery target. We extend failure detectors to take account of failure recovery in the target system. This involves extending QoS measures to include the recovery detection speed and proportion of failures detected. We also extend estimating the parameters of the failure detector to achieve a required QoS to configuring the crash-recovery failure detector. We investigate the impact of the dependability of the monitored process on the QoS of our failure detector. Our analysis indicates that variation in the MTTF and MTTR of the monitored process can have a significant impact on the QoS of our failure detector. Our analysis is supported by simulations that validate our theoretical results.

关键词： failure detectors crash recovery quality of service availability dependability performance

来源：评论

学校读者我要写书评

暂无评论

On the quality of service of failure detectors

引用

IEEE TRANSACTIONS ON COMPUTERS 2002年第5期51卷 561-580页

作者： Chen, W Toueg, S Aguilera, MK Oracle Corp Nashua NH 03062 USA Univ Toronto Dept Comp Sci Toronto ON M5S 3H5 Canada Compaq Syst Res Ctr Palo Alto CA 94301 USA

We study the quality of service (QoS) of failure detectors. By QoS, we mean a specification that quantifies 1) how fast the failure detector detects actual failures and 2) how well it avoids false detections. We first propose a set of QoS metrics to specify failure detectors for systems with probabilistic behaviors, i.e., for systems where message delays and message losses follow some probability distributions. We then give a new failure detector algorithm and analyze its QoS in terms of the proposed metrics. We show that, among a large class of failure detectors, the new algorithm is optimal with respect to some of these QoS metrics. Given a set of failure detector QoS requirements, we show how to compute the parameters of our algorithm so that it satisfies these requirements and we show how this can be done even if the probabilistic behavior of the system is not known. We then present some simulation results that show that the new failure detector algorithm provides a better QoS than an algorithm that is commonly used in practice. Finally, we suggest some ways to make our failure detector adaptive to changes in the probabilistic behavior of the network.

关键词： failure detectors quality of service fault tolerance distributed algorithm probabilistic analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：