Search results for "Parallel"
showing 10 items of 667 documents
Numerical experiments with a parallel fast direct elliptic solver on Cray T3E
1997
A parallel fast direct O(N log N) solver is shortly described for linear systems with separable block tridiagonal matrices. A good parallel scalability of the proposed method is demonstrated on a Cray T3E parallel computer using MPI in communication. Also, the sequential performance is compared with the well-known BLKTRI-implementation of the generalized. cyclic reduction method using a single processor of Cray T3E.
Parallelization strategies for density matrix renormalization group algorithms on shared-memory systems
2003
Shared-memory parallelization (SMP) strategies for density matrix renormalization group (DMRG) algorithms enable the treatment of complex systems in solid state physics. We present two different approaches by which parallelization of the standard DMRG algorithm can be accomplished in an efficient way. The methods are illustrated with DMRG calculations of the two-dimensional Hubbard model and the one-dimensional Holstein-Hubbard model on contemporary SMP architectures. The parallelized code shows good scalability up to at least eight processors and allows us to solve problems which exceed the capability of sequential DMRG calculations.
Parallelization of a Lattice Boltzmann Suspension Flow Solver
2002
We have applied a parallel Lattice Boltzmann method to solve the behaviour of the suspension flow. The complex behaviour of the suspension flow cannot be solved by analytical methods, so simulations are the only way to study it. Usually the size of an interesting problem is so big that calculation time on one processor is too long, and this can be solved by parallel program. We have written a parallel suspension flow solver and tested it on massive parallel computers. The measured performance of our program show that the parallelization of suspension particles was successful. We also show that over one million particles can be simulated.
Monte Carlo Simulations of Polymer Systems
1988
The impact of Monte Carlo “computer experiments” in polymer physics is described, emphasizing three examples taken from the author’s research group. The first example is a test of the classical Flory—Huggins theory for polymer mixtures, including a discussion of cricital phenomena. Also “technical aspects” of such simulations (“grand-canonical” ensemble, finite—size scaling, etc.) are explained briefly. The second example refers to configurational statistics and dynamics of chains confined to cylindrical tubes; the third example deals with the adsorption of polymers at walls. These simulations check scaling concepts developed along the lines of de Gennes.
A PARALLEL ALGORITHM FOR ANALYZING CONNECTED COMPONENTS IN BINARY IMAGES
1992
In this paper, a parallel algorithm for analyzing connected components in binary images is described. It is based on the extension of the Cylindrical Algebraic Decomposition (CAD) to a two-dimensional (2D) discrete space. This extension allows us to find the number of connected components, to determine their connectivity degree, and to solve the visibility problem. The parallel implementation of the algorithm is outlined and its time/space complexity is given.
Introduction: Situatedness and Place
2018
Over the last two or three decades, the spatio-temporal contingency of human life has become an important topic of research in a broad range of different disciplines including the social sciences, the cultural sciences, the cognitive sciences, and philosophy. Significantly, however, this research topic is referred to in quite different ways: While some researchers refer to it in terms of the “situatedness” of human experience and action, others refer to it in terms of “place”, emphasizing the “power of place” and advocating a “topological” or “topographical turn” in the context of a larger “spatial turn”. In this chapter, we will first give a short introduction to place and situatedness as …
Cell-List based Molecular Dynamics on Many-Core Processors: A Case Study on Sunway TaihuLight Supercomputer
2020
Molecular dynamics (MD) simulations are playing an increasingly important role in several research areas. The most frequently used potentials in MD simulations are pair-wise potentials. Due to the memory wall, computing pair-wise potentials on many-core processors are usually memory bounded. In this paper, we take the SW26010 processor as an exemplary platform to explore the possibility to break the memory bottleneck by improving data reusage via cell-list-based methods. We use cell-lists instead of neighbor-lists in the potential computation, and apply a number of novel optimization methods. Theses methods include: an adaptive replica arrangement strategy, a parameter profile data structur…
Pairwise DNA Sequence Alignment Optimization
2015
This chapter presents a parallel implementation of the Smith-Waterman algorithm to accelerate the pairwise alignment of DNA sequences. This algorithm is especially computationally demanding for long DNA sequences. Parallelization approaches are examined in order to deeply explore the inherent parallelism within Intel Xeon Phi coprocessors. This chapter looks at exploiting instruction-level parallelism within 512-bit single instruction multiple data instructions (vectorization) as well as thread-level parallelism over the many cores (multithreading using OpenMP). Between coprocessors, device-level parallelism through the compute power of clusters including Intel Xeon Phi coprocessors using M…
Fine tuning of the magnetic properties in Mn3-Co Ga Heusler films near the critical regime
2021
Abstract Tunability of structural and magnetic properties of Mn3-xCoxGa films is presented by Co substitution, where critical behavior emerges 0.37 ≤ x ≤ 0.56 exhibiting a transition from tetragonal hard ferrimagnetic with perpendicular magnetic anisotropy (PMA) to a cubic soft ferrimagnetic phase with in-plane magnetic anisotropy (IMA). In the critical regime, coexisting state of tetragonal and cubic phases possesses significantly low coercive field (HC = 1.9 kOe) with relatively low saturation magnetization (MS = 100~150 emu/cc) while maintaining the PMA. From first-principles calculations, moments of two Mn sites do not change upon Co substitution. However, moments of substituted Co almo…
Non-accumulation of critical points of the Poincaré time on hyperbolic polycycles
2007
We call Poincare time the time associated to the Poincar6 (or first return) map of a vector field. In this paper we prove the non-accumulation of isolated critical points of the Poincare time T on hyperbolic polycycles of polynomial vector fields. The result is obtained by proving that the Poincare time of a hyperbolic polycycle either has an unbounded principal part or is an almost regular function. The result relies heavily on the proof of Il'yashenko's theorem on non-accumulation of limit cycles on hyperbolic polycycles.