oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Emc Analysis of Antenna System on the Electrically Large Platform Using Parallel MoM with Higher-Order Basis Functions
Ying Yan;Yu Zhang;Chang-Hong Liang;Daniel Garcia-Donoro;Hui Zhao
PIER M , 2012, DOI: 10.2528/PIERM11102401
Abstract: Currently, more and more practical engineering applications place antenna system on the electrically large platform. This paper deals with the problem of antennas mounted on large platform from two aspects - radiation pattern and system electromagnetic compatibility (EMC). To achieve an accurate and effective computation, this paper applies Method of Moment (MoM) with Higher-order basis functions solver with large-scale parallel computation technique. And finally some real-life examples are presented to describe how to install antennas on the platform reasonably.
Scalable Parallel Numerical CSP Solver  [PDF]
Daisuke Ishii,Kazuki Yoshizoe,Toyotaro Suzumura
Computer Science , 2014, DOI: 10.1007/978-3-319-10428-7_30
Abstract: We present a parallel solver for numerical constraint satisfaction problems (NCSPs) that can scale on a number of cores. Our proposed method runs worker solvers on the available cores and simultaneously the workers cooperate for the search space distribution and balancing. In the experiments, we attained up to 119-fold speedup using 256 cores of a parallel computer.
PoisFFT - A Free Parallel Fast Poisson Solver  [PDF]
Vladimír Fuka
Mathematics , 2014,
Abstract: A fast Poisson solver software package PoisFFT is presented. It is available as a free software licensed under the GNU GPL license version 3. The package uses the fast Fourier transform to directly solve the Poisson equation on a uniform orthogonal grid. It can solve the pseudo-spectral approximation and the second order finite difference approximation of the continuous solution. The paper reviews the mathematical methods for the fast Poisson solver and discusses the software implementation and parallelization. The use of PoisFFT in an incompressible flow solver is also demonstrated.
An Energy Conserving Parallel Hybrid Plasma Solver  [PDF]
M. Holmstrom
Physics , 2010,
Abstract: We investigate the performance of a hybrid plasma solver on the test problem of an ion beam. The parallel solver is based on cell centered finite differences in space, and a predictor-corrector leapfrog scheme in time. The implementation is done in the FLASH software framework. It is shown that the solver conserves energy well over time, and that the parallelization is efficient (it exhibits weak scaling).
Emc Analysis of Antennas Mounted on Electrically Large Platforms with Parallel FDTD Method
Ji-Zhao Lei;Chang-Hong Liang;Wei Ding;Yu Zhang
PIER , 2008, DOI: 10.2528/PIER08071303
Abstract: In this paper, the Parallel Finite-Difference Time-Domain (FDTD) method based on MPI (Message Passing Interface) is applied to analyze the EMC problems of the electrically large platforms accurately and quickly, which is a full-wave numerical method. The MPI library and domain decomposition method are applied to implement the Parallel FDTD method, so that the computation resource is expanded. The method can analyze the EMC problems by modeling the electrically large platforms accurately. Then the network theory is introduced to compute the isolation between antennas combined with the Parallel FDTD method firstly, which avoids the complexity of sweeping frequency and reduce the computing time greatly. Numerical results show that the method is correct and efficient. Finally, the EMC problems of antennas mounted on electrically large platforms are analyzed and some useful conclusions are obtained.
Implementing parallel elliptic solver on a Beowulf cluster  [cached]
Marcin Paprzycki,Svetozara Petrova,Julian Sanchez
Electronic Journal of Differential Equations , 1999,
Abstract: In a recent paper cite{zara} a parallel direct solver for the linear systems arising from elliptic partial differential equations has been proposed. The aim of this note is to present the initial evaluation of the performance characteristics of this algorithm on Beowulf-type cluster. In this context the performance of PVM and MPI based implementations is compared.
HordeSat: A Massively Parallel Portfolio SAT Solver  [PDF]
Tomas Balyo,Peter Sanders,Carsten Sinz
Computer Science , 2015,
Abstract: A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one solver finds a solution. The SAT solvers in the portfolio can be instances of a single solver with different configuration settings. Additionally the solvers can exchange information usually in the form of clauses. In this paper we investigate whether this approach is applicable in the case of massively parallel SAT solving. Our solver is intended to run on clusters with thousands of processors, hence the name HordeSat. HordeSat is a fully distributed portfolio-based SAT solver with a modular design that allows it to use any SAT solver that implements a given interface. HordeSat has a decentralized design and features hierarchical parallelism with interleaved communication and search. We experimentally evaluated it using all the benchmark problems from the application tracks of the 2011 and 2014 International SAT Competitions. The experiments demonstrate that HordeSat is scalable up to hundreds or even thousands of processors achieving significant speedups especially for hard instances.
Large Eddy Simulations of Turbulent Flow Across Tube Bundle Using Parallel Coupled Multiblock Navier-Stokes Solver  [PDF]
M. Talebi,E. Shirani,M. Ashrafizaadeh
Journal of Applied Sciences , 2005,
Abstract: Turbulent flow around a tube bundle is simulated. Fully coupled Navier-Stokes equations in non-orthogonal coordinate system are solved employing a new multiblock parallel solver. For turbulent modeling, the Large-Eddy Simulation (LES) technique with the Smagorinsky subgrid eddy viscosity model is used. The discretized governing equations are second order in time and space and to prevent the pressure checkerboard problem, a Momentum Interpolation Method (MIM) is used. Parallelization of the computer code was done by a load balanced domain decomposition technique which results in a high computational efficiency and speed up. Flow pattern and characteristics are obtained for turbulent flow over five parallel tubes rows. Numerical results show a very good agreement with experimental results and reveal interesting flow behavior for such complicated industrial applications.
Scalable Parallel Numerical Constraint Solver Using Global Load Balancing  [PDF]
Daisuke Ishii,Kazuki Yoshizoe,Toyotaro Suzumura
Computer Science , 2015, DOI: 10.1145/2771774.2771776
Abstract: We present a scalable parallel solver for numerical constraint satisfaction problems (NCSPs). Our parallelization scheme consists of homogeneous worker solvers, each of which runs on an available core and communicates with others via the global load balancing (GLB) method. The parallel solver is implemented with X10 that provides an implementation of GLB as a library. In experiments, several NCSPs from the literature were solved and attained up to 516-fold speedup using 600 cores of the TSUBAME2.5 supercomputer.
A domain decomposing parallel sparse linear system solver  [PDF]
Murat Manguoglu
Computer Science , 2010, DOI: 10.1016/j.cam.2011.07.017
Abstract: The solution of large sparse linear systems is often the most time-consuming part of many science and engineering applications. Computational fluid dynamics, circuit simulation, power network analysis, and material science are just a few examples of the application areas in which large sparse linear systems need to be solved effectively. In this paper we introduce a new parallel hybrid sparse linear system solver for distributed memory architectures that contains both direct and iterative components. We show that by using our solver one can alleviate the drawbacks of direct and iterative solvers, achieving better scalability than with direct solvers and more robustness than with classical preconditioned iterative solvers. Comparisons to well-known direct and iterative solvers on a parallel architecture are provided.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.