HPC-based parallel software for solving applied Boolean satisfiability problems

Bogdanova, Vera; Gorsky, Sergey; Pashinin, Anton A.

doi:10.23919/mipro48935.2020.9245400

Cited by 3 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The runtime for k = 31 is 51m 54.39s (for Trivium) as shown in [24]. In our case, the runtime of the parallel HPCAllsat [21] running on 32 core (Intel(R) Xeon(R) CPU E5-2695 v4 2.10 GHz) for k = 31 is 34m 56.03s (for Trivium) using the BCM-based approach.…”

Section: Features Of Our Approach To Solving the Problemmentioning

confidence: 81%

“…In the case of small and medium BDS dimensions, the sequential AllSAT solver [20] is used (launched by the non-resource intensive microservice BM SAT-S). In another case, parallel AllSAT solver HPCAllsat [21] developed by authors is used (launched by the resource-intensive microservice BM SAT-P). The BM SAT-P requires a high-performance resource for its running.…”

Section: Features Of the Implementation Of Microservices For Solving The Problemmentioning

confidence: 99%

“…In contrast to [23], we use the standard AllSAT solver [20]. For BDS of high dimension, the developed parallel solver [21] is used. In comparison to [23,24], the Boolean model based on BCM includes a BDS dynamics description (1) and, additionally, a property specification of the presence of k-cycles (2).…”

Section: Features Of Our Approach To Solving the Problemmentioning

confidence: 99%

“…Unlike [24], we use a sparse strategy for ANF to CNF converting [26]. In detail, computational experiments for the considered problem are presented in [21]. In particular, the comparison of the BCM-based approach with the approach described in [18] is given.…”

Section: Features Of Our Approach To Solving the Problemmentioning

confidence: 99%

See 3 more Smart Citations

Application of user dew agent in hybrid-computing environments

Pashinin¹,

Bogdanova²

2021

1st International Workshop on Advanced Information and Computation Technologies and Systems 2020

Self Cite

View full text Add to dashboard Cite

In recent years, research in Dew computing as a new layer in the vertical hierarchy of scalable computing has been developing. Directions for the development of this technology include research into the possibilities of Dew computing and its applications. Our research belongs to the second direction. We use this technology in a package of applied microservices for solving complex problems of the qualitative study of binary dynamic systems based on the Boolean constraint method in a hybrid cloud environment. This environment includes on-premises, high-performance, and cloud resources. In this paper, the usage of Dew computing technology in a hybrid cloud environment is discussed. A user dew agent installed on an on-premises resource is proposed to provide the possibility of the applied microservices package collaboration with cloud services in a hybrid cloud environment. The advantages of using a user dew agent are considered. The architecture, functionality, operation modes, and the installation of the dew agent are presented.

show abstract

Section: Features Of Our Approach To Solving the Problemmentioning

confidence: 81%

Section: Features Of the Implementation Of Microservices For Solving The Problemmentioning

confidence: 99%

Section: Features Of Our Approach To Solving the Problemmentioning

confidence: 99%

Section: Features Of Our Approach To Solving the Problemmentioning

confidence: 99%

See 2 more Smart Citations

Application of user dew agent in hybrid-computing environments

Pashinin¹,

Bogdanova²

2021

1st International Workshop on Advanced Information and Computation Technologies and Systems 2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…These microservices are implemented based on the AllSAT solver nbc_minisat_all-1.0.2 [26] and the QSAT solver DepQBF [27]. In the case of a high dimension of the BDS state vector, previously developed parallel solvers [28,29] of a similar purpose are used.…”

Section: Some Aspects Of Program Implementationmentioning

confidence: 99%

Investigation of observability property of controlled binary dynamical systems: a logical approach

Oparin¹,

Bogdanova²,

Pashinin³

2021

3rd International Workshop on Information, Computation, and Control Systems for Distributed Environments 2021

Self Cite

View full text Add to dashboard Cite

The property of observability of controlled binary dynamical systems is investigated. A formal definition of the property is given in the language of applied logic of predicates with bounded quantifiers of existence and universality. A Boolean model of the property is built in the form of a quantified Boolean formula accordingly to the Boolean constraints method developed by the authors. This formula satisfies both the logical specification of the property and the equations of the binary system dynamics. Aspects of the proposed approach implementation for the study of the observability property are considered. The technology of checking the feasibility of the property using an applied microservice package is demonstrated in several examples.

show abstract