A cloud parallelprogramming system CPPS being under development at the Institute of Informatics Systems is aimed to be an interactive visual environment of functional andparallelprogramming for supporting of comput...
详细信息
ISBN:
(纸本)9781728166957
A cloud parallelprogramming system CPPS being under development at the Institute of Informatics Systems is aimed to be an interactive visual environment of functional andparallelprogramming for supporting of computer science teaching and learning. The system will support the development, verification and debugging of architecture-independent parallel Cloud Sisal programs and their correct conversion into efficient code of parallel computing systems for its execution in clouds. In the paper, methods andtools of the CPPS system intended for formal verification of Cloud Sisal programs are described.
Dangling pointer error is pervasive in C/C++ programs and it is very hard to detect. This paper introduces an efficient detector to detect dangling pointer error in C/C++ programs. By selectively leave some memory acc...
详细信息
Organization of high performance execution of fragmented programs met the problem of choice of acceptable way of their execution. The possibilities of execution optimization on the stages of fragmented program develop...
详细信息
ISBN:
(纸本)9783642148217
Organization of high performance execution of fragmented programs met the problem of choice of acceptable way of their execution. The possibilities of execution optimization on the stages of fragmented program development, compilation and execution are considered. The methods and algorithms of optimizations are suggested to be included both in fragmented programming language and in run-time system.
Discrete simulation method of physicochemical kinetic processes is proposed and investigated. The method is based on formal representation of classical Von-Neumann's Cellular Automaton (CA) extension, which allow ...
详细信息
ISBN:
(纸本)9783642148217
Discrete simulation method of physicochemical kinetic processes is proposed and investigated. The method is based on formal representation of classical Von-Neumann's Cellular Automaton (CA) extension, which allow all kind of discrete alphabets, probabilistic transition functions, and asynchronous mode of operation. Some techniques for simple CA composition are given for simulating complex processes. Transformation of asynchronous CA into block-synchronous type is used to provide high efficiency of parallel implementation.
parallelization of Marchuk's method for solution of inverse problems based on adjoint equations and dual representation of contaminant concentration functional is considered here. There are N individual adjoint eq...
详细信息
ISBN:
(纸本)9783642148217
parallelization of Marchuk's method for solution of inverse problems based on adjoint equations and dual representation of contaminant concentration functional is considered here. There are N individual adjoint equations independently solved at each time step. Such conditions of numerical investigation allow application of high performance computations. For this purpose the following ways of parallelization are used: geometrical decomposition, functional decomposition and combination of geometrical and functional decompositions.
The task of the calculation of the dipole-dipole interaction between cobalt nanodot and magnetic tip was formalized and the computing algorithm was implemented in parallel C++ code with using of the MPI standard. The ...
详细信息
ISBN:
(纸本)9783642148217
The task of the calculation of the dipole-dipole interaction between cobalt nanodot and magnetic tip was formalized and the computing algorithm was implemented in parallel C++ code with using of the MPI standard. The parallelization is fulfilled by means of the dividing total cycle and the passing the part of cycle in one process. Our parallel program allows obtain Magnetic-Force-Microscopy (MFM) images and to establish the magnetic configuration which one correspond given experimental MFM picture.
In this paper, we present a fast scalable method to reduce the computation time of genetic algorithms for traveling salesman problem, called the parallel Pattern Reduction Enhanced Genetic Algorithm (PPREGA). The gene...
详细信息
ISBN:
(纸本)9783642148217
In this paper, we present a fast scalable method to reduce the computation time of genetic algorithms for traveling salesman problem, called the parallel Pattern Reduction Enhanced Genetic Algorithm (PPREGA). The general idea behind the proposed algorithm is twofold: (1) Eliminate the redundant computations of GA on its convergence process by pattern reduction and (2) Minimize the completion time of GA by parallel computing. Our simulation result shows that the proposed algorithm can significantly reduce not only the computation time but also the maximum completion time of GA. Moreover, our simulation result shows further that the loss of the quality of the end result is small.
The paper describes investigations of some aspects of creating stochastic wave models of dynamic acoustic noise. The problem about sound radiation by homogeneous and stationary pressure fluctuations on a surface of la...
详细信息
ISBN:
(纸本)9783642148217
The paper describes investigations of some aspects of creating stochastic wave models of dynamic acoustic noise. The problem about sound radiation by homogeneous and stationary pressure fluctuations on a surface of layered waveguide is considered. The method of statistical modeling based on the randomization of spectral density of surface sources is used. It allows calculating random realizations of sound pressure and particle velocity that are exact solution of the equations of linear acoustics. The software for calculation of statistical characteristics of surface noise in a distributed computing environment is developed. Some examples of its applications are given.
With the advancement of network and techniques of clusters, joining clusters to construct a wide parallel system becomes;a trend. Irregular array redistribution employs generalized blocks to help utilize the resource ...
详细信息
ISBN:
(纸本)9783642148217
With the advancement of network and techniques of clusters, joining clusters to construct a wide parallel system becomes;a trend. Irregular array redistribution employs generalized blocks to help utilize the resource while executing scientific application on such platforms. Research for irregular array redistribution is focused on scheduling heuristics because communication cost could be saved if this operation follows an efficient schedule. In this paper, a two-step communication cost modification (T2CM) and a synchronization delay-aware scheduling heuristic (SDSH) are proposed to normalize the communication cost and reduce transmission delay in algorithm level. The performance evaluations show the contributions of proposed method for irregular array redistribution.
parallel implementation of the algorithm of numerical solution of the Navier-Stokes equations for large eddy simulation (LES) of turbulence is presented in this research. The Smagorinsky model has been applied for sub...
详细信息
ISBN:
(纸本)9783642148217
parallel implementation of the algorithm of numerical solution of the Navier-Stokes equations for large eddy simulation (LES) of turbulence is presented in this research. The Smagorinsky model has been applied for sub-grid simulation of turbulence. This model with numerical Van Leer's scheme for advection terms is in good agreement with experimental data. Various ways of geometrical decomposition for the parallel numerical solution of the transport equations have been investigated. A theoretical analysis of the parallel algorithms effectiveness was performed and the recommendations for their application were developed. The parallel realization of the iteration methods for the numerical solution of the Poisson equation for velocity and pressure coupling are discussed. Special techniques such as the order of nested loops and the effect of cash memory have been applied to increase the performance of the developed parallel programs.
暂无评论