Concept of a multitask grid system with a flexible allocation of idle computational resources of supercomputers

Afanasiev, Alexander; Bychkov, I. V.; Zaikin, Oleg; Manzyuk, Maxim; Posypkin, Mikhail; Семенов, А. А.

doi:10.1134/s1064230717040025

Cited by 8 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…• гибридная система распределенных вычислений на узлах суперкомпьютеров и вычислительных кластеров [5][6][7]. Краткий об-зор гибридных систем распределенных вычислений и особенностей управления заданиями в подобных системах приведен в работе [8];…”

Section: вычислительные системы Desktop Gridunclassified

A survey of task scheduling in Desktop Grid

Chernov¹,

Ivashko²,

Nikitina³

2017

PSTA

View full text Add to dashboard Cite

Section: вычислительные системы Desktop Gridunclassified

A survey of task scheduling in Desktop Grid

Chernov¹,

Ivashko²,

Nikitina³

2017

PSTA

View full text Add to dashboard Cite

“…The described scheme of calculations parallelization suits ideally the distributed environments where the control processor interacts with the other processor only for sending a new job or for receiving calculation results. Many grid systems which are widely used today belong to this class of environments [4].…”

Section: Introductionmentioning

confidence: 99%

Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem

Kolpakov

Posypkin

2020

Open Computer Science

View full text Add to dashboard Cite

In this paper we study the question of parallelization of a variant of Branch-and-Bound method for solving of the subset sum problem which is a special case of the Boolean knapsack problem. The following natural approach to the solution of this question is considered. At the first stage one of the processors (control processor) performs some number of algorithm steps of solving a given problem with generating some number of subproblems of the problem. In the second stage the generated subproblems are sent to other processors for solving (one subproblem per processor). Processors solve completely the received subproblems and return their solutions to the control processor which chooses the optimal solution of the initial problem from these solutions. For this approach we define formally a model of parallel computing (frontal parallelization scheme) and the notion of complexity of the frontal scheme. We study the asymptotic behavior of the complexity of the frontal scheme for two special cases of the subset sum problem.

show abstract

“…where C denotes the complexity of solving a system of linear equations over GF (2). The next widely known attack on the A5/1 was presented in [12].…”

Section: Andersonattack@home Projectmentioning

confidence: 99%

“…This reduction made it possible to construct a guess-anddetermine attack with a much smaller set of bits to guess (30-33 variables) compared to Anderson's attack. In particular, 20 cryptanalysis instances of the A5/1 generator were solved in the volunteer computing project SAT@home using the CluBORun tool [2].…”

Section: Andersonattack@home Projectmentioning

confidence: 99%

A Bitslice Implementation of Anderson’s Attack on A5/1

et al. 2018

View full text Add to dashboard Cite

Abstract:The A5/1 keystream generator is a part of Global System for Mobile Communications (GSM) protocol, employed in cellular networks all over the world. Its cryptographic resistance was extensively analyzed in dozens of papers. However, almost all corresponding methods either employ a specific hardware or require an extensive preprocessing stage and significant amounts of memory. In the present study, a bitslice variant of Anderson's Attack on A5/1 is implemented. It requires very little computer memory and no preprocessing. Moreover, the attack can be made even more efficient by harnessing the computing power of modern Graphics Processing Units (GPUs). As a result, using commonly available GPUs this method can quite efficiently recover the secret key using only 64 bits of keystream. To test the performance of the implementation, a volunteer computing project was launched. 10 instances of A5/1 cryptanalysis have been successfully solved in this project in a single week.

show abstract

Concept of a multitask grid system with a flexible allocation of idle computational resources of supercomputers

Cited by 8 publications

References 7 publications

A survey of task scheduling in Desktop Grid

A survey of task scheduling in Desktop Grid

Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem

A Bitslice Implementation of Anderson’s Attack on A5/1

Contact Info

Product

Resources

About