The parallel multiple front method is used in mechanical engineering to solve large sparse linear systems issued from finite element modeling. It is a parallel direct method based on a nonoverlapping domain decomposit...
详细信息
ISBN:
(纸本)0769523129
The parallel multiple front method is used in mechanical engineering to solve large sparse linear systems issued from finite element modeling. It is a parallel direct method based on a nonoverlapping domain decomposition method. The decomposition is usually built with a graph partitioning approach. However this approach is not well suited to all parallel applications. It provides computing times over the subdomains which can vary from simple to double for our parallel multiple method. We show that its computing time can be decreased by load balancing the computational volume over the subdomains. We present in this communication a sequential and a parallel version of our load balancing method which corrects in computational volume an initial decomposition issued from graph partitioning tools.
BitTorrent is a popular, open-source content distribution system that is conducive for distribution of large-volume files. In this paper, we first model the parallel downloading problem as directed graph and discuss p...
详细信息
The increasing availability of interaction graphs requires new resource-efficient tools capable of extracting valuable biological knowledge from these networks. In this paper we report on a novel parallel implementati...
详细信息
Applications of the cellular Potts model to investigate cellular structures are becoming widely spread in the scientific literature. Despite its realism and generality, the standard Monte Carlo algorithm used to evolv...
详细信息
Performance profiling generates measurement overhead during parallel program execution. Measurement overhead, in turn, introduces intrusion in a program's runtime performance behavior. Intrusion can be mitigated b...
详细信息
We propose a parallel algorithm for the constrained multiple sequence alignment (CMSA) problem that seeks an optimal multiple alignment constrained to include a given pattern. We consider the dynamic programming compu...
详细信息
A computational study is presented which investigates the predictive performance of a non-linear turbulence closure in simulating the flow physics pertinent to a high-pressure axial ventilation fan. The studied employ...
详细信息
A computational study is presented which investigates the predictive performance of a non-linear turbulence closure in simulating the flow physics pertinent to a high-pressure axial ventilation fan. The studied employed a cubic k-epsilon model which is considered as a promising closure for improving the state-of-the-art of industrial CFD by accounting for non-equilibrium effects. The axial fan studied represents a challenge for simulation because of the presence of large three-dimensional interblade flow structures and strong leakage effects. The potential improvement of non-isotropic closures has been assessed with respect to a classical linear k-epsilon model. The comparative analyses aimed at the prediction of flow structure within the blades and close to the rotor tip clearance. The rotor design point and near-pressure-peak operating conditions have been simulated. The non-linear model is shown to provide a better base-line for non-equilibrium effects simulation with respect to the standard one. The authors adopt a parallel multi-grid algorithm developed for a highly accurate Petrov-Galerkin finite element method, here applied on equal-order Q1-Q1 as well as mixed Q2-Q1 element pairs. The parallel solution algorithm for Reynolds Averaged Navier-Stokes modelling exploits an overlapping domain decomposition technique based on an "inexact explicit non-linear Schwarz method". (c) 2004 Elsevier Inc. All rights reserved.
This paper investigated an optimal method of optimal power flow in large interconnected power grids. A decomposition collaborative model based on partial duality is analyzed, and a parallel algorithm based on DC optim...
详细信息
ISBN:
(纸本)7506274078
This paper investigated an optimal method of optimal power flow in large interconnected power grids. A decomposition collaborative model based on partial duality is analyzed, and a parallel algorithm based on DC optimal power flow model is presented in multi-region decomposition of Interconnected power grids. The OPF computation of large power grid is decomposed into subproblems of multi regions, which is a quadratic programming problem used to solve a DC optimal power flow. The optimal convergence condition of multi-region is discussed. The interchange information among regions is export price and boundary nodal bus phase angle. The IEEE RTS-96 with two and three interconnected regions is studied to illustrate the effect of the proposed approach and to prove a great future in interconnected power system.
We develop a framework for parallel computation of the optimal rough set decision reducts from data. We adapt the island model for evolutionary computing. The idea is to optimize reducts within separate populations (i...
详细信息
algorithms, permitting us to find synchronization-free threads comprised of iterations of perfectly nested uniform and non-uniform loops, are presented. They require an exact representation of loop-carried dependences...
详细信息
algorithms, permitting us to find synchronization-free threads comprised of iterations of perfectly nested uniform and non-uniform loops, are presented. They require an exact representation of loop-carried dependences. To describe and implement the algorithms, the dependence analysis by Pugh and Wonnacott was chosen where dependences are represented in the form of tuple relations. The main advantage of the proposed approach is that it permits us to extract more synchronization-free parallelism than that yielded with well-known techniques including the affine partitioning framework. The algorithms proposed have been implemented and verified by means of the Omega project software. Experiments with the Livermore loops are presented.
暂无评论