Article
The distributed calculators model for molecular-dynamic simulation of strong interaction systems
The model of distributed calculators makes it possible a parallel calculation of the correlated N-particle system with a complex multi-particle interaction (long-range ionic and short-range repulsive, two- and three-particle covalent interactions) with MPI and CUDA technologies. The computational model is based on the mathematical model of heterogeneous descriptors developed by the authors, that allows shift the focus from the describing the physical interactions in the system to the description of data flow between the descriptors. The results of computer experiments, which compare the time of the simulation on the cluster of 16 calculators and GPU NVIDIA are given. The model of distributed calculators was being tested with the software package of RIS «MD-SLAG-MELT»
One of the most important problems, by development of the automated systems of scientific researches is providing efficient performance of computers. The algorithm for tasks division among the processors of molecular-dynamic sub-systems modeling of the research-informational system Slag Melt system is described. The authors recommend the method of optimizing the algorithm as well as an estimation and calculation of the system efficiency and improving its operation.
The article is devoted to inclusion of the topic "parallel computing" in the school informatics . Some methodical materials prepared in the course of work on the "Permian version" of a propaedeutic course of computer science (the author team is M.A. Plaksin, N.I. Ivanova, O.L. Rusakova) are described.
This book constitutes the refereed proceedings of the 12th International Conference on Parallel Computational Technologies, PCT 2018, held in Rostov-on-Don, Russia, in April 2018.
The 24 revised full papers presented were carefully reviewed and selected from 167 submissions. The papers are organized in topical sections on high performance architectures, tools and technologies; parallel numerical algorithms; supercomputer simulation.
This book is collection of research papers included in the program of the International Scientific Conference "Parallel Computing Technologies 2016". The conference was held from 28 March to 1 April 2016 the Northern (Arctic) Federal University (Arkhangelsk). For more information about the conference can be found on the Internet at the following address http://agora.guru.ru/pavt.
Population annealing is a novel Monte Carlo algorithm designed for simulations of systems of statistical mechanics with rugged free-energy landscapes. We discuss a realization of the algorithm for the use on a hybrid computing architecture combining CPUs and GPGPUs. The particular advantage of this approach is that it is fully scalable up to many thousands of threads. We report on applications of the developed realization to several interesting problems, in particular the Ising and Potts models, and review applications of population annealing to further systems.
Now we have the need for methodics of teaching the topic "parallel computing" in secondary school. The paper presents a three-year experience of the author in this field: a methodical approach, the selection of materials, the business games, experience of tasks on parallel computing at the contest "TRIZformashka", classes of tasks, examples of tasks, program executors, texts for propaedeutic textbook on informatics.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability