Treatment of Repeated Letdowns in Coordinated Consistent Recovery Line Compilation for Mobile Distributed Systems

doi:10.30534/ijatcse/2021/391042021

Treatment of Repeated Letdowns in Coordinated Consistent Recovery Line Compilation for Mobile Distributed Systems

International Journal of Advanced Trends in Computer Science and Engineering ◽

10.30534/ijatcse/2021/391042021 ◽

2021 ◽

Vol 10 (4) ◽

pp. 2903-2907

Keyword(s):

Distributed Systems ◽

Interactive Method ◽

Causal Dependency ◽

Wireless Connectivity

We put forward a least_int_method (least interactive method) orchestrated CRL-compilation (consistent recovery line compilation) etiquette for non- deterministic Mob_DS (Mobile Distributed Systems); where no inoperable reinstatement-points are recorded. Recurrent terminations of CRL-compilation procedure may happen in Mobile_DS due to exhausted battery, non-voluntary disconnections of Mob_Nodes, or poor wireless connectivity. Therefore, we put forward that in the first stage, all pertinent Mob_Nodes will capture transient reinstatement-point only. Transient reinstatement-point is stored on the memory of Mob_Node only. In this case, if some method fails to capture its reinstatement-point in the first stage, then Mob_Nodes need to abandon their transient reinstatement-points only. In this way, we try to abate the loss of CRL-compilation effort when any method fails to capture its reinstatement-point in harmonization with others. We also try to reduce the CRL- compilation time and intrusion time of methods by limiting CRL-compilation tree which may be formed in other etiquettes [2, 9, 10]. We captured the transitive dependencies during the normal execution by piggybacking causal-dependency-vectors onto computation communications.

Download Full-text

INCREMENTAL TRANSITIVE DEPENDENCY TRACKING IN DISTRIBUTED COMPUTATIONS

Parallel Processing Letters ◽

10.1142/s0129626496000406 ◽

1996 ◽

Vol 06 (03) ◽

pp. 427-435 ◽

Cited By ~ 4

Author(s):

CLAUDE JARD ◽

GUY-VINCENT JOURDAN

Keyword(s):

Distributed Systems ◽

Arbitrary Subset ◽

Causal Dependency ◽

Tracking Technique ◽

Distributed Computations ◽

Dependency Tracking ◽

Observable Event ◽

Direct Dependency

The notion of causal dependency between events in distributed systems plays a central role in reasoning about distributed program behaviours [14]. Different techniques have been designed to track these dependencies during execution. We suggest a new incremental transitive dependency tracking technique. Once the transitive dependencies are recorded for an observable event, the dependency tracking cost can be reduced by propagating only future dependencies beyond that event. Furthermore, in contrast with the direct dependency tracking technique already proposed in the literature, our technique allows to compute the dependencies among an arbitrary subset of observable events. This gives an interesting filtering capability.

Download Full-text