The paper presents the analysis of dispersion forces effect on local properties in thin free films. Using a Coupled Fluctuated Dipole Method with developed methods for numerical calculations of dielectric properties, the films with different lateral sizes and thicknesses were studied. In particular, the molecular polarizabilities at different distance from the film interface were analyzed. It was shown that dispersion interaction between the molecules, even for the case of nonpolar liquid with weak intermolecular interactions, causes a notable variation in dielectric properties of thin film, which is associated with the boundary layer formation. This variation, in turn, causes a strong dependence of polarizability accuracy on the cut-off radius. It is demonstrated that parallel computing algorithms can be effectively applied for obtaining the reliable data on properties of liquids in wetting films and boundary layers even under resource-imposed constraint on the size of ensemble of molecules to be handled in the numerical studies.
{"title":"Analysis of the Effect of Dispersion Forces on the Dielectric Film Properties Using Parallel Computing","authors":"K. A. Emelyanenko, L. Boinovich, A. Emelyanenko","doi":"10.14529/JSFI180313","DOIUrl":"https://doi.org/10.14529/JSFI180313","url":null,"abstract":"The paper presents the analysis of dispersion forces effect on local properties in thin free films. Using a Coupled Fluctuated Dipole Method with developed methods for numerical calculations of dielectric properties, the films with different lateral sizes and thicknesses were studied. In particular, the molecular polarizabilities at different distance from the film interface were analyzed. It was shown that dispersion interaction between the molecules, even for the case of nonpolar liquid with weak intermolecular interactions, causes a notable variation in dielectric properties of thin film, which is associated with the boundary layer formation. This variation, in turn, causes a strong dependence of polarizability accuracy on the cut-off radius. It is demonstrated that parallel computing algorithms can be effectively applied for obtaining the reliable data on properties of liquids in wetting films and boundary layers even under resource-imposed constraint on the size of ensemble of molecules to be handled in the numerical studies.","PeriodicalId":338883,"journal":{"name":"Supercomput. Front. Innov.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126982267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Numerical solution of the Boltzmann equation for stationary high-speed flows around complex three-dimensional bodies is an extremely difficult computational problem. This is because of high dimension of the equation and lack of efficient implicit methods for the calculation of the collision integral on arbitrary non-uniform velocity grids. Therefore, the use of the so-called model (approximate) kinetic equations appears to be more appropriate and attractive. This article uses the numerical methodology recently developed by the second author which includes an implicit method for solving the approximating kinetic equation of E.M. Shakhov (S-model) on arbitrary unstructured grids in both velocity and physical spaces. Since most of model equations have a well-known drawback associated with the velocityindependent collision frequency it is important to determine the deviations of solutions of these equations from the solution of the complete Boltzmann equation or DSMC for high-speed gas flows. Our recent comparison of the DSMC and S-model solutions for monatomic gases with a soft interaction potential shows good agreement of surface coefficients of the pressure, heat transfer and friction, which are most important for industrial applications. In this paper, we compare the solution of model equations and the Boltzmann equation for the problem of supersonic gas flow around a cylinder when molecules interact according to the law of hard spheres. Since this law of molecular interaction is the most rigid, the difference in solutions can show the maximum error that can be obtained by using model equations instead of the exact Boltzmann equation in such problems. Our high-fidelity computations show that the use of model kinetic equations with adaptation in phase space is very promising for industrial applications.
{"title":"Recent Progress on Supercomputer Modelling of High-Speed Rarefied Gas Flows Using Kinetic Equations","authors":"A. Frolova, V. Titarev","doi":"10.14529/JSFI180322","DOIUrl":"https://doi.org/10.14529/JSFI180322","url":null,"abstract":"Numerical solution of the Boltzmann equation for stationary high-speed flows around complex three-dimensional bodies is an extremely difficult computational problem. This is because of high dimension of the equation and lack of efficient implicit methods for the calculation of the collision integral on arbitrary non-uniform velocity grids. Therefore, the use of the so-called model (approximate) kinetic equations appears to be more appropriate and attractive. This article uses the numerical methodology recently developed by the second author which includes an implicit method for solving the approximating kinetic equation of E.M. Shakhov (S-model) on arbitrary unstructured grids in both velocity and physical spaces. Since most of model equations have a well-known drawback associated with the velocityindependent collision frequency it is important to determine the deviations of solutions of these equations from the solution of the complete Boltzmann equation or DSMC for high-speed gas flows. Our recent comparison of the DSMC and S-model solutions for monatomic gases with a soft interaction potential shows good agreement of surface coefficients of the pressure, heat transfer and friction, which are most important for industrial applications. In this paper, we compare the solution of model equations and the Boltzmann equation for the problem of supersonic gas flow around a cylinder when molecules interact according to the law of hard spheres. Since this law of molecular interaction is the most rigid, the difference in solutions can show the maximum error that can be obtained by using model equations instead of the exact Boltzmann equation in such problems. Our high-fidelity computations show that the use of model kinetic equations with adaptation in phase space is very promising for industrial applications.","PeriodicalId":338883,"journal":{"name":"Supercomput. Front. Innov.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126149602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This work deals with quantum qubit modelling based on a silicon material with embedded phosphorus atoms because a future quantum computer can be built on the basis of this qubit. The building of atomic models of bulk crystalline silicon and silicene, as well as calculation of their total energies, were performed using the Quantum ESPRESSO software package, using highperformance computing (HPC). For silicon and phosphorus atoms the generalized gradient approximation (GGA) was used in terms of the spin-orbit non-collinear interaction by means of the Quantum ESPRESSO package. The equilibrium orientations of the phosphorus qubit spins and localization of the wave functions in the 2D and bulk crystalline silicon phases were theoretically investigated by means of quantum-mechanical calculations. The existence of an exchange interaction between qubits has been confirmed, which leads to a change in the wave function’s localization and spin orientation, and in the case of silicene, this interaction was stronger.
{"title":"Modelling of Quantum Qubit Behaviour for Future Quantum Computers","authors":"A. Chibisov, M. Chibisova","doi":"10.14529/JSFI180308","DOIUrl":"https://doi.org/10.14529/JSFI180308","url":null,"abstract":"This work deals with quantum qubit modelling based on a silicon material with embedded phosphorus atoms because a future quantum computer can be built on the basis of this qubit. The building of atomic models of bulk crystalline silicon and silicene, as well as calculation of their total energies, were performed using the Quantum ESPRESSO software package, using highperformance computing (HPC). For silicon and phosphorus atoms the generalized gradient approximation (GGA) was used in terms of the spin-orbit non-collinear interaction by means of the Quantum ESPRESSO package. The equilibrium orientations of the phosphorus qubit spins and localization of the wave functions in the 2D and bulk crystalline silicon phases were theoretically investigated by means of quantum-mechanical calculations. The existence of an exchange interaction between qubits has been confirmed, which leads to a change in the wave function’s localization and spin orientation, and in the case of silicene, this interaction was stronger.","PeriodicalId":338883,"journal":{"name":"Supercomput. Front. Innov.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130558784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
I. Neelov, O. Shavykin, M. Ilyash, V. Bezrodnyi, S. Mikhtaniuk, Anna A. Marchenko, E. Fatullaev, A. A. Darinskii, F. Leermakers
High performance computations were performed for comparison of size and other properties of big heavily charged biocompatible molecules of complex topology in water. Lysine dendrimer and short dendritic brush of the same molecular weight were studied by molecular dynamics simulation method and GROMACS software package. The size and structural properties of these two systems were compared. It was shown that dendritic brush has smaller size and more dense core than the dendrimer. Radial density profile for both molecules is not monotonous and has minimum near core of molecules. This minimum is wider and deeper for dendrimer than for dendritic brush. Thus dendrimer has larger region of low density than dendritic brush and is more suitable for use for encapsulation and delivery of hydrophobic drugs.
{"title":"Application of High Performance Computing for Comparison of Two Highly Branched Lysine Molecules of Different Topology","authors":"I. Neelov, O. Shavykin, M. Ilyash, V. Bezrodnyi, S. Mikhtaniuk, Anna A. Marchenko, E. Fatullaev, A. A. Darinskii, F. Leermakers","doi":"10.14529/JSFI180310","DOIUrl":"https://doi.org/10.14529/JSFI180310","url":null,"abstract":"High performance computations were performed for comparison of size and other properties of big heavily charged biocompatible molecules of complex topology in water. Lysine dendrimer and short dendritic brush of the same molecular weight were studied by molecular dynamics simulation method and GROMACS software package. The size and structural properties of these two systems were compared. It was shown that dendritic brush has smaller size and more dense core than the dendrimer. Radial density profile for both molecules is not monotonous and has minimum near core of molecules. This minimum is wider and deeper for dendrimer than for dendritic brush. Thus dendrimer has larger region of low density than dendritic brush and is more suitable for use for encapsulation and delivery of hydrophobic drugs.","PeriodicalId":338883,"journal":{"name":"Supercomput. Front. Innov.","volume":"PP 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126354332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An algorithm is proposed to convert the coarse-grained A-graft-B model of polylactic acid into the atomistic representation. In the A-graft-B model the atoms of the backbone are mapped onto A beads, which form the linear backbone of the coarse-grained macromolecule, the methyl groups are mapped onto B side pendants. The algorithm restores atomic positions based on positions of coarse-grained beads with the help of pre-defined chain fragments, called templates. The dimensions of the templates are adjusted by affine transformation to ensure coincidence of the backbone in coarse-grained and atomistic representation. The transition between coarse-grained and atomistic models conserves information about the fine structure of polymer chains. The restored configurations are suitable for further molecular-dynamic simulations. Both atomistic and coarse-grained representations require standard GROMACS software. The algorithm can be used for reverse mapping of other A-graft-B polymer models.
{"title":"Reverse Mapping Algorithm for Multi-scale Numerical Simulation of Polylactic Acid","authors":"M. K. Glagolev, V. Vasilevskaya","doi":"10.14529/jsfi180319","DOIUrl":"https://doi.org/10.14529/jsfi180319","url":null,"abstract":"An algorithm is proposed to convert the coarse-grained A-graft-B model of polylactic acid into the atomistic representation. In the A-graft-B model the atoms of the backbone are mapped onto A beads, which form the linear backbone of the coarse-grained macromolecule, the methyl groups are mapped onto B side pendants. The algorithm restores atomic positions based on positions of coarse-grained beads with the help of pre-defined chain fragments, called templates. The dimensions of the templates are adjusted by affine transformation to ensure coincidence of the backbone in coarse-grained and atomistic representation. The transition between coarse-grained and atomistic models conserves information about the fine structure of polymer chains. The restored configurations are suitable for further molecular-dynamic simulations. Both atomistic and coarse-grained representations require standard GROMACS software. The algorithm can be used for reverse mapping of other A-graft-B polymer models.","PeriodicalId":338883,"journal":{"name":"Supercomput. Front. Innov.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132859078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Pleshkevich, V. Lisitsa, D. Vishnevsky, V. Levchenko, B. Moroz
We present an original algorithm for seismic imaging, based on the depth wavefield extrapolation by the one-way wave equation. Parallel implementation of the algorithm is based on the several levels of parallelism. The input data parallelism allows processing full coverage for some area (up to one square km); thus, data are divided into several subsets and each subset is processed by a single MPI process. The mathematical approach allows dealing with each frequency independently and treating solution layer-by-layer; thus, a set of 2D cross-sections instead of the initial 3D common-offset vector gathers are processed simultaneously. This part of the algorithm is implemented suing GPU. Next, each common-offset vector image can be stacked, processed and stored independently. As a result, we designed and implemented the parallel algorithm based on the use of CPU-GPU architecture which allows computing common-offset vector images using one-way wave equation-based amplitude preserving migration. The algorithm was used to compute seismic images from real seismic land data.
{"title":"Parallel GPU-based Implementation of One-Way Wave Equation Migration","authors":"A. Pleshkevich, V. Lisitsa, D. Vishnevsky, V. Levchenko, B. Moroz","doi":"10.14529/jsfi180304","DOIUrl":"https://doi.org/10.14529/jsfi180304","url":null,"abstract":"We present an original algorithm for seismic imaging, based on the depth wavefield extrapolation by the one-way wave equation. Parallel implementation of the algorithm is based on the several levels of parallelism. The input data parallelism allows processing full coverage for some area (up to one square km); thus, data are divided into several subsets and each subset is processed by a single MPI process. The mathematical approach allows dealing with each frequency independently and treating solution layer-by-layer; thus, a set of 2D cross-sections instead of the initial 3D common-offset vector gathers are processed simultaneously. This part of the algorithm is implemented suing GPU. Next, each common-offset vector image can be stacked, processed and stored independently. As a result, we designed and implemented the parallel algorithm based on the use of CPU-GPU architecture which allows computing common-offset vector images using one-way wave equation-based amplitude preserving migration. The algorithm was used to compute seismic images from real seismic land data.","PeriodicalId":338883,"journal":{"name":"Supercomput. Front. Innov.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124068746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
I. Afanasyev, A. Antonov, D. Nikitenko, V. Voevodin, V. Voevodin, K. Komatsu, Osamu Watanabe, A. Musa, Hiroaki Kobayashi
The main goal of this work is to demonstrate that the development of data-intensive appli- cations for vector systems is not only important and interesting, but is also very possible. In this paper we describe possible implementations of two fundamental graph-processing algorithms for an NEC SX-ACE vector computer: the Bellman–Ford algorithm for single source shortest paths computation and the Forward-Backward algorithm for strongly connected components detection. The proposed implementations have been developed and optimised in accordance with features and properties of the target architecture, which allowed them to achieve performance comparable to other traditional platforms, such as Intel Skylake, Intel Knight Landing or IBM Power processors.
{"title":"Developing Efficient Implementations of Bellman-Ford and Forward-Backward Graph Algorithms for NEC SX-ACE","authors":"I. Afanasyev, A. Antonov, D. Nikitenko, V. Voevodin, V. Voevodin, K. Komatsu, Osamu Watanabe, A. Musa, Hiroaki Kobayashi","doi":"10.14529/JSFI180311","DOIUrl":"https://doi.org/10.14529/JSFI180311","url":null,"abstract":"The main goal of this work is to demonstrate that the development of data-intensive appli- cations for vector systems is not only important and interesting, but is also very possible. In this paper we describe possible implementations of two fundamental graph-processing algorithms for an NEC SX-ACE vector computer: the Bellman–Ford algorithm for single source shortest paths computation and the Forward-Backward algorithm for strongly connected components detection. The proposed implementations have been developed and optimised in accordance with features and properties of the target architecture, which allowed them to achieve performance comparable to other traditional platforms, such as Intel Skylake, Intel Knight Landing or IBM Power processors.","PeriodicalId":338883,"journal":{"name":"Supercomput. Front. Innov.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129043876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Understanding the conformational dynamics which affects ligand binding by Neuraminidases is needed to improve the in silico selection of novel drug candidates targeting these pathogenicity factors and to adequately estimate the efficacy of potential drugs. Conventional molecular dynamics (MD) is a powerful tool to study conformational sampling, drug-target recognition and binding, but requires significant computational effort to reach timescales relevant for biology. In this work the advances in a computer power and specialized architectures were evaluated at simulating long MD trajectories of the structural behavior of Neuraminidases. We conclude that modern GPU accelerators enable calculations at the timescales that would previously have been intractable, providing routine access to microsecond-long trajectories in a daily laboratory practice. This opens an opportunity to move away from the “static” affinity-driven strategies in drug design towards a deeper understanding of ligand-specific conformational adaptation of target sites in protein structures, leading to a better selection of efficient drug candidates in silico. However, the performance of modern GPUs is yet far behind the deeply-specialized supercomputers co-designed for MD. Further development of affordable specialized architectures is needed to move towards the much-desired millisecond timescale to simulate large proteins at a daily routine.
{"title":"Simulating the Long-timescale Structural Behavior of Bacterial and Influenza Neuraminidases with Different HPC Resources","authors":"Yana A. Sharapova, D. Suplatov, V. Svedas","doi":"10.14529/jsfi180303","DOIUrl":"https://doi.org/10.14529/jsfi180303","url":null,"abstract":"Understanding the conformational dynamics which affects ligand binding by Neuraminidases is needed to improve the in silico selection of novel drug candidates targeting these pathogenicity factors and to adequately estimate the efficacy of potential drugs. Conventional molecular dynamics (MD) is a powerful tool to study conformational sampling, drug-target recognition and binding, but requires significant computational effort to reach timescales relevant for biology. In this work the advances in a computer power and specialized architectures were evaluated at simulating long MD trajectories of the structural behavior of Neuraminidases. We conclude that modern GPU accelerators enable calculations at the timescales that would previously have been intractable, providing routine access to microsecond-long trajectories in a daily laboratory practice. This opens an opportunity to move away from the “static” affinity-driven strategies in drug design towards a deeper understanding of ligand-specific conformational adaptation of target sites in protein structures, leading to a better selection of efficient drug candidates in silico. However, the performance of modern GPUs is yet far behind the deeply-specialized supercomputers co-designed for MD. Further development of affordable specialized architectures is needed to move towards the much-desired millisecond timescale to simulate large proteins at a daily routine.","PeriodicalId":338883,"journal":{"name":"Supercomput. Front. Innov.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127550516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The paper deals with the problem of improving the performance of high-fidelity incompressible turbulent flow simulations on high performance computing systems. The ensemble averaging approach, combining averaging in time together with averaging over multiple ensembles, allows to speedup the corresponding simulations by increasing the computing intensity of the numerical method (flops per byte ratio). The current paper focuses on further improvement of the proposed computational methodology, and particularly, on the optimization of procedure to generate multiple independent turbulent flow states.
{"title":"Generation of Multiple Turbulent Flow States for the Simulations with Ensemble Averaging","authors":"B. Krasnopolsky","doi":"10.14529/JSFI180205","DOIUrl":"https://doi.org/10.14529/JSFI180205","url":null,"abstract":"The paper deals with the problem of improving the performance of high-fidelity incompressible turbulent flow simulations on high performance computing systems. The ensemble averaging approach, combining averaging in time together with averaging over multiple ensembles, allows to speedup the corresponding simulations by increasing the computing intensity of the numerical method (flops per byte ratio). The current paper focuses on further improvement of the proposed computational methodology, and particularly, on the optimization of procedure to generate multiple independent turbulent flow states.","PeriodicalId":338883,"journal":{"name":"Supercomput. Front. Innov.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130991595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The paper is devoted to a scalability study of Cimmino algorithm for linear inequality systems. This algorithm belongs to the class of iterative projection algorithms. For the analytical analysis of the scalability, the BSF (Bulk Synchronous Farm) parallel computation model is used. An implementation of the Cimmino algorithm in the form of operations on lists using higher-order functions Map and Reduce is presented. An analytical estimation of the upper scalability bound of the algorithm for cluster computing systems is derived. An information about the implementation of Cimmino algorithm on lists in C++ language using the BSF program skeleton and MPI parallel programming library is given. The results of large-scale computational experiments performed on a cluster computing system are demonstrated. A conclusion about the adequacy of the analytical estimations by comparing them with the results of computational experiments is made.
{"title":"Scalability Evaluation of Cimmino Algorithm for Solving Linear Inequality Systems on Multiprocessors with Distributed Memory","authors":"L. Sokolinsky, I. Sokolinskaya","doi":"10.14529/JSFI180202","DOIUrl":"https://doi.org/10.14529/JSFI180202","url":null,"abstract":"The paper is devoted to a scalability study of Cimmino algorithm for linear inequality systems. This algorithm belongs to the class of iterative projection algorithms. For the analytical analysis of the scalability, the BSF (Bulk Synchronous Farm) parallel computation model is used. An implementation of the Cimmino algorithm in the form of operations on lists using higher-order functions Map and Reduce is presented. An analytical estimation of the upper scalability bound of the algorithm for cluster computing systems is derived. An information about the implementation of Cimmino algorithm on lists in C++ language using the BSF program skeleton and MPI parallel programming library is given. The results of large-scale computational experiments performed on a cluster computing system are demonstrated. A conclusion about the adequacy of the analytical estimations by comparing them with the results of computational experiments is made.","PeriodicalId":338883,"journal":{"name":"Supercomput. Front. Innov.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121487790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：