In this paper, a new block interface domain decomposition method (BI-DDM) with non-overlapping subdomains for the numerical solution of a two-dimensional convection-diffusion equation is presented. The block interface...
详细信息
In this paper, a new block interface domain decomposition method (BI-DDM) with non-overlapping subdomains for the numerical solution of a two-dimensional convection-diffusion equation is presented. The block interface formulation is derived from the idea of using small groups of a certain number of mesh points where this group is treated explicitly similar to the way a single point is treated in the point method. The BI-DDM is incorporated with a correction phase which is able to economize further on the computing cost. The performance analysis of this method on several recently developed group iterative schemes implemented on a message-passing architecture are presented and discussed.
A parallel dual reciprocity boundary element method solution to thermoelasticity and thermoviscoelasticity problems is proposed. The DR-BEM formulation is given in Fourier Transform Space where the Time Space solution...
详细信息
A parallel dual reciprocity boundary element method solution to thermoelasticity and thermoviscoelasticity problems is proposed. The DR-BEM formulation is given in Fourier Transform Space where the Time Space solutions are obtained through inverse Fourier Transform. The parallellization of the code is achieved through solving each frequency at a distinct computational node. The implemented parallel code is tested on 64-core IBM blade servers and it is seen that a linear speed-up is achieved.
This paper proposes parallel dual tabu search (PDTS) for capacitor placement in smart grids. The proposed method makes use of the dual code of the initial vale to make solution candidates diverse. The capacitor placem...
详细信息
This paper proposes parallel dual tabu search (PDTS) for capacitor placement in smart grids. The proposed method makes use of the dual code of the initial vale to make solution candidates diverse. The capacitor placement is one of important problems to maintain the nodal voltage profile in the distribution network level of smart grids. The problem formulation of capacitor placement may be expressed as a combinatorial optimization problem of capacitor banks. In this paper, a new method is proposed to improve the performance of tabu search (TS) of meta-heuristics. Although meta-heuristics are not affected by the initial value in smaller systems, they are inclined to give different solutions with different initial values in large-scale problems. In practice, it is very important to set up a good initial value for tabu search although a priori knowledge is not available in general. This paper focuses on the dual code of the initial value to create another initial value systematically. Mathematically, the dual code is orthogonal to the original one so that the solution search is carried out to keep the diversity of solution candidates from two most different directions. The effectiveness of the proposed method is demonstrated in a sample system.
It is proposed a parallel Monte Carlo algorithm to simulate templated grain growth in sintering ceramics materials. The algorithm applies the general Potts model to treat the matrix as the discrete lattices for simula...
详细信息
ISBN:
(纸本)9783037852415
It is proposed a parallel Monte Carlo algorithm to simulate templated grain growth in sintering ceramics materials. The algorithm applies the general Potts model to treat the matrix as the discrete lattices for simulating the grain growth and there will be a number of lattices to be computed synchronously. The scheme is performed by CUDA GPU parallelization programming framework which is of much more feasibility and low cost comparing with the former conventional program. The most key point is that the parallel algorithm is of great temporal performance which means it takes less time to complete a simulation. The results of comparative experiments show that the algorithm is unquestionable effective while the other statistic numerical features of simulations are almost the same.
Image thinning is one of important steps of fingerprint preprocessing. Most of fingerprint recognition algorithms checked the characteristic points on thinning image. In this paper, we discover some shortages in OPTA ...
详细信息
ISBN:
(纸本)9783037851579
Image thinning is one of important steps of fingerprint preprocessing. Most of fingerprint recognition algorithms checked the characteristic points on thinning image. In this paper, we discover some shortages in OPTA and mathematical morphology thinning algorithm and find out the reasons for some shortages such as many glitches and snags, defective thinning, and so on. A new improved algorithm is proposed in the paper, which is an ideal algorithm because it is faster, produces less glitch, and thins completely.
Network-on-chip multicore architectures with a large number of processing elements are becoming a reality with the recent developments in technology. In these modern systems the processing elements are interconnected ...
详细信息
Network-on-chip multicore architectures with a large number of processing elements are becoming a reality with the recent developments in technology. In these modern systems the processing elements are interconnected with regular network-on-chip (NoC) topologies such as meshes and trees. In this paper we propose a parallel Gauss-Seidel (GS) iterative algorithm for solving large systems of linear equations on a torus NoC architecture. The proposed parallel algorithm is O(Nn(2)/k(2)) time complexity for solving a system with matrix of order n on a k x k torus NoC architecture with N iterations assuming n and N are large compared to k (i.e. for large linear systems that require a large number of iterations). We show that under these conditions the proposed parallel GS algorithm has near optimal speedup.
Network is divided into different management domains in large-scale communication system,each management domain has its own Local Management *** distributed characteristics of network determine the Global Management S...
详细信息
ISBN:
(纸本)9781467321006
Network is divided into different management domains in large-scale communication system,each management domain has its own Local Management *** distributed characteristics of network determine the Global Management Site with several Local Management Sites to meet a distributed *** paper proposes a new algorithm called PFAARM (parallel fuzzy alarm association rules mining algorithm),which can be used for alarm fuzzy association rules parallel mining in multi-domain distributed communication *** correlation analysis ban be executed in parallel both in Global Management Site and Local Management *** association rules can be achieved within inner-and inter-domain *** the basis of alarm correlation analysis in single management domain,the introduction of inter-domain alarm fuzzy association rules,which are based on inter-domain communication relationship,gives another essential clue for fault ***,it’s of great significance for quick and efficient fault *** simulation results illustrated its feasibility and efficiency.
Applied problems of oil and gas recovery are studied numerically using the mathematical models of multiphase fluid flows in porous media. The basic model includes the continuity equations and the Darcy laws for each p...
详细信息
Applied problems of oil and gas recovery are studied numerically using the mathematical models of multiphase fluid flows in porous media. The basic model includes the continuity equations and the Darcy laws for each phase, as well as the algebraic expression for the sum of saturations. Primary computational algorithms are implemented for such problems using the pressure equation. In this paper, we highlight the basic properties of the pressure problem and discuss the necessity of their fulfillment at the discrete level. The resulting elliptic problem for the pressure equation is characterized by a non-selfadjoint operator. Possibilities of approximate solving the elliptic problem are considered using the iterative methods. Special attention is given to the numerical algorithms for calculating the pressure on parallel computers.
The rise of the Web 2.0 caused a real democratization in the context of data generation. These data are mostly provided in the form of texts, ranging from the reports provided by news portals, using a formal language,...
详细信息
The rise of the Web 2.0 caused a real democratization in the context of data generation. These data are mostly provided in the form of texts, ranging from the reports provided by news portals, using a formal language, to comments in blog and micro-blogging applications that abuse the use of an informal language. Address this heterogeneity is an essential preprocessing so that these data can be used by tools that aim to infer accurate information based on such data. Thus, this work presents the HASCH (High Performance Automatic Spell CHEcker), whose objective is to correct spelling in Portuguese texts collected from the Web. Being a tool that aims to handle a large volume of data, HASCH is completely parallelized in shared memory. In our evaluation, we found that the HASCH was extremely effective in the correction of very large texts from different Web sources, with a almost superlinear speedup.
On the basis of Floyd algorithm with theextended path matrix, a parallel algorithm whichresolves all-pair shortest path (APSP) problem oncluster environment is analyzed and ***, the parallel APSP pipelining algorithmm...
详细信息
On the basis of Floyd algorithm with theextended path matrix, a parallel algorithm whichresolves all-pair shortest path (APSP) problem oncluster environment is analyzed and ***, the parallel APSP pipelining algorithmmakes full use of overlapping technique betweencomputation and communication. Compared withbroadcast operation, the parallel algorithm reducescommunication cost. This algorithm has beenimplemented on MPI on PC-cluster. The theoreticalanalysis and experimental results show that the parallelalgorithm is an efficient and scalable algorithm.
暂无评论