Formal analysis of control and termination of distributed computation in weaker spaces
The control and termination detection of a distributed computation involving large-scale distributed database is difficult in the presence of concurrency, random network delays, and varying reliability of computing nodes. The formal modeling and analysis of controllability as well as termination det...
Main Author: | Susmit Bagchi |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2018-01-01
|
Series: | Cogent Engineering |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/23311916.2018.1475033 |
Similar Items
-
Surjective Identifications of Convex Noetherian Separations in Topological (<i>C</i>, <i>R</i>) Space
by: Susmit Bagchi
Published: (2021-05-01) -
Computational modeling of consistent observation of asynchronous distributed computation on N–manifold
by: Susmit Bagchi
Published: (2018-01-01) -
Using weaker consistency models with monitoring and recovery for improving performance of key-value stores
by: Duong Nguyen, et al.
Published: (2019-10-01) -
On the Analysis and Computation of Topological Fuzzy Measure in Distributed Monoid Spaces
by: Susmit Bagchi
Published: (2018-12-01) -
Unimodality of Boolean and Monotone Stable Distributions
by: Hasebe Takahiro, et al.
Published: (2015-09-01)