Failure Detector of Perfect P Class for Synchronous Hierarchical Distributed Systems

2016 ◽  
Vol 7 (2) ◽  
pp. 57-74 ◽  
Author(s):  
Anshul Verma ◽  
K. K. Pattanaik
Keyword(s):  
Distributed Systems ◽  
Real Time ◽  
Failure Detection ◽  
Communication Overhead ◽  
Real Time Systems ◽  
Failure Detector ◽  
Detection Algorithms ◽  
Synchronous Environments ◽  
Time Systems ◽  
Detection Mechanisms

Present failure detection algorithms for distributed systems are designed to work in asynchronous or partially synchronous environment on mesh connected systems and maintain status of every other process. Several real time systems are not mesh connected and require working in strict synchronous environment. Use of current failure detection mechanisms in such systems would generate excess computation and communication overhead. This paper proposes a new failure detector of Perfect P class for real time hierarchical distributed systems working in synchronous environments. Strong completenessand strong accuracy properties of the new failure detector is evaluated.

Failure Detectors of Strong S and Perfect P Classes for Time Synchronous Hierarchical Distributed Systems

2019 ◽  
pp. 246-280
Author(s):  
Anshul Verma ◽  
Mahatim Singh ◽  
Kiran Kumar Pattanaik
Keyword(s):  
Distributed Systems ◽  
Failure Detection ◽  
Communication Overhead ◽  
Failure Detectors ◽  
Failure Detector ◽  
Strong Completeness ◽  
Link Failures ◽  
Detection Algorithms ◽  
Crash Failures ◽  
Synchronous Environments

Present failure detection algorithms for distributed systems are designed to work in asynchronous or partially synchronous environments on mesh (all-to-all) connected systems and maintain status of every other process. Several real-time systems are hierarchically connected and require working in strict synchronous environments. Use of existing failure detectors for such systems would generate excess computation and communication overhead. The chapter describes two suspicion-based failure detectors of Strong S and Perfect P classes for hierarchical distributed systems working in time synchronous environments. The algorithm of Strong S class is capable of detecting permanent crash failures, omission failures, link failures, and timing failures. Strong completeness and weak accuracy properties of the algorithm are evaluated. The failure detector of Perfect P class is capable of detecting crash failures, crash-recovery failures, omission failures, link failures, and timing failures. Strong completeness and strong accuracy properties of the failure detector are evaluated.

Failure Detectors of Strong S and Perfect P Classes for Time Synchronous Hierarchical Distributed Systems

2021 ◽  
pp. 1317-1343
Author(s):  
Anshul Verma ◽  
Mahatim Singh ◽  
Kiran Kumar Pattanaik
Keyword(s):  
Distributed Systems ◽  
Failure Detection ◽  
Communication Overhead ◽  
Failure Detectors ◽  
Failure Detector ◽  
Strong Completeness ◽  
Link Failures ◽  
Detection Algorithms ◽  
Crash Failures ◽  
Synchronous Environments

Present failure detection algorithms for distributed systems are designed to work in asynchronous or partially synchronous environments on mesh (all-to-all) connected systems and maintain status of every other process. Several real-time systems are hierarchically connected and require working in strict synchronous environments. Use of existing failure detectors for such systems would generate excess computation and communication overhead. The chapter describes two suspicion-based failure detectors of Strong S and Perfect P classes for hierarchical distributed systems working in time synchronous environments. The algorithm of Strong S class is capable of detecting permanent crash failures, omission failures, link failures, and timing failures. Strong completeness and weak accuracy properties of the algorithm are evaluated. The failure detector of Perfect P class is capable of detecting crash failures, crash-recovery failures, omission failures, link failures, and timing failures. Strong completeness and strong accuracy properties of the failure detector are evaluated.

scholarly journals Synthesis method of orthogonal encoding and decoding matrices based on integers, providing the implementation of code division of channels

2021 ◽  
Vol 2094 (3) ◽  
pp. 032065
Author(s):  
P O Vinar ◽  
S V Rabin ◽  
A V Rabin
Keyword(s):  
Distributed Systems ◽  
Real Time ◽  
Information Transfer ◽  
Synthesis Method ◽  
Communication Technologies ◽  
Convolutional Codes ◽  
Reliable Information ◽  
Real Time Systems ◽  
Time Systems ◽  
Binary Channels

Abstract The method of code division of binary channels based on the arithmetic analogue of convolutional codes is investigated. The synthesis method of encoding and decoding matrices is proposed for implementing a code division of channels regardless of the number of users. The synthesis and implementation of theses pairs of matrices will significantly simplify the schemes for constructing encoding and decoding devices. Research results can be used in various communication technologies: in real-time systems, in distributed systems in on-board equipment complexes, to ensure reliable information transfer.

scholarly journals Modeling Distributed Real-time Elevator System by Three Model Checkers

2018 ◽  
Vol 14 (04) ◽  
pp. 94
Author(s):  
Qian Zhongsheng ◽  
Li Xin ◽  
Wang Xiaojin
Keyword(s):  
Distributed Systems ◽  
Model Checking ◽  
Real Time ◽  
Experimental Results ◽  
System Model ◽  
Modeling Language ◽  
Real Time Systems ◽  
Time Systems

The characteristics of three popular model checking tools called SPIN, UPPAAL and NuSMV respectively, are compared and analyzed to determine which type of systems is propitious to be described. And a distributed elevator system model is built, whose related properties are verified and compared by these three model checking tools. To begin with, SPIN, UPPAAL and NuSMV, whose modeling language features are compared, are employed to construct an elevator system model respectively. Then, the three validation tools are used to verify several important properties of the elevator model, and the result is analyzed and their own characteristics are summarized. Finally, the experimental results show that SPIN and NuSMV are more suitable for verifying distributed systems while UPPAAL is better for verifying real-time systems.

scholarly journals On the Designing of Model Checkers for Real-Time Distributed Systems

2015 ◽  
Vol 19 (6) ◽  
pp. 45-56 ◽  
Author(s):  
D. Yu. Volkanov ◽  
V. A. Zakharov ◽  
D. A. Zorin ◽  
I. V. Konnov ◽  
V. V. Podymov
Keyword(s):  
Distributed Systems ◽  
Model Checking ◽  
Real Time ◽  
Query Language ◽  
Formal Model ◽  
Timed Automata ◽  
Operational Semantics ◽  
Real Time Systems ◽  
Conversion Algorithm ◽  
Time Systems

To verify real-time properties of UML statecharts one may apply a UPPAAL, toolbox for model checking of real-time systems. One of the most suitable ways to specify an operational semantics of UML statecharts is to invoke the formal model of Hierarchical Timed Automata. Since the model language of UPPAAL is based on Networks of Timed Automata one has to provide a conversion of Hierarchical Timed Automata to Networks of Timed Automata. In this paper we describe this conversion algorithm and prove that it is correct w.r.t. UPPAAL query language which is based on the subset of Timed CTL.

Software Engineering for Real Time Systems

IEE Review ◽  
1992 ◽  
Vol 38 (3) ◽  
pp. 112
Author(s):  
Stuart Bennett
Keyword(s):  
Software Engineering ◽  
Real Time ◽  
Real Time Systems ◽  
Time Systems
Sign in / Sign up

Export Citation Format

Share Document