In this paper, parallelisable Simulated Annealing with Genetic Enhancement (SAwGE) algorithm is presented and applied to Permutation Flowshop Scheduling Problem with total flowtime criterion. This problem is proved to...
详细信息
In this paper, parallelisable Simulated Annealing with Genetic Enhancement (SAwGE) algorithm is presented and applied to Permutation Flowshop Scheduling Problem with total flowtime criterion. This problem is proved to be NP-complete in a strong sense for more than one machine. SAwGE is based on a Clustering algorithm for Simulated Annealing (SA), but introduces a new mechanism for dynamic SA parameters adjustment, based on genetic algorithms. Computational experiments, based on 120 benchmark datasets by Taillard, show that SAwGE outperforms other heuristics and metaheuristics presented recently in literature. Moreover SAwGE obtains 118 best solutions, including 81 newly discovered ones. (C) 2010 Elsevier Ltd. All rights reserved.
Based on full domain partition, three parallel iterative finite element algorithms for the stationary Navier-Stokes equations are proposed and analyzed. In these algorithms, each subproblem is defined in the entire do...
详细信息
Based on full domain partition, three parallel iterative finite element algorithms for the stationary Navier-Stokes equations are proposed and analyzed. In these algorithms, each subproblem is defined in the entire domain with the vast majority of the degrees of freedom associated with the particular subdomain that it is responsible for and hence can be solved in parallel with other subproblems using an existing sequential solver without extensive recoding. All of the subproblems are nonlinear and are independently solved by three kinds of iterative methods. Under some (strong) uniqueness conditions, errors of the parallel iterative finite element solutions are estimated. Some numerical results are also given which demonstrate the efficiency of the parallel iterative algorithms. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces, and its convergence is established under the assumption that solutions exist. Unlike existing alternating a...
详细信息
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces, and its convergence is established under the assumption that solutions exist. Unlike existing alternating algorithms, which are limited to two variables and linear coupling, our parallel method can handle an arbitrary number of variables as well as nonlinear coupling schemes. The breadth and flexibility of the proposed framework is illustrated through applications in the areas of evolution inclusions, variational problems, best approximation, and network flows.
Two parallel domain decomposition procedures for solving initial-boundary value problems of parabolic partial differential equations are proposed. One is the extended D-D type algorithm, which extends the explicit/imp...
详细信息
Two parallel domain decomposition procedures for solving initial-boundary value problems of parabolic partial differential equations are proposed. One is the extended D-D type algorithm, which extends the explicit/implicit conservative Galerkin domain decomposition procedures, given in [5], from a rectangle domain and its decomposition that consisted of a stripe of sub-rectangles into a general domain and its general decomposition with a net-like structure. An almost optimal error estimate, without the factor H(-1/2) given in Dawson-Dupont's error estimate, is proved. Another is the parallel domain decomposition algorithm of improved D-D type, in which an additional term is introduced to produce an approximation of an optimal error accuracy in L(2)-norm. (C) 2009 Elsevier B.V. All rights reserved.
Based on domain decomposition, a parallel two-level finite element method for the stationary Navier-Stokes equations is proposed and analyzed. The basic idea of the method is first to solve the Navier-Stokes equations...
详细信息
Based on domain decomposition, a parallel two-level finite element method for the stationary Navier-Stokes equations is proposed and analyzed. The basic idea of the method is first to solve the Navier-Stokes equations on a coarse grid, then to solve the resulted residual equations in parallel on a fine grid. This method has low communication complexity. It can be implemented easily. By local a priori error estimate for finite element discretizations, error bounds of the approximate solution are derived. Numerical results are also given to illustrate the high efficiency of the method.
We present simple and fast parallel proximity algorithms for rigid polygonal models. Given two polygon-soup models in space, if they overlap, our algorithm can find all the intersected primitives between them;otherwis...
详细信息
We present simple and fast parallel proximity algorithms for rigid polygonal models. Given two polygon-soup models in space, if they overlap, our algorithm can find all the intersected primitives between them;otherwise, it reports their Euclidean minimum distance. Our algorithm is performed in a parallel fashion and shows scalable performance in terms of the number of available computing cores. The key ingredient of our algorithm is a simple load-balancing metric based on the penetration depth (PD) (for collision detection) and approximate Euclidean distance (for Euclidean distance computation) between bounding volumes. To compute the PD between oriented bounding boxes (OBBs), we present a novel algorithm based on the well-known separating axis theorem (SAT) and also shows that the PD can be trivially obtained as a byproduct of SAT. We have implemented these algorithms on a commodity PC with eight cores and benchmarked their performance on complicated geometric models. In practice, the performance of our algorithm shows up to 5 and 9.7 times improvement for collision and distance queries, respectively, compared to single core computation. Copyright (C) 2010 John Wiley & Sons, Ltd.
We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in parallel. Towards this we introduce a latency tolera...
详细信息
We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in parallel. Towards this we introduce a latency tolerant parallel algorithm for performing such computations efficiently that achieves optimal theoretical speedup p, where p is the number of processor of the parallel system. An implementation of the parallel algorithm has been undertaken, and an evaluation of its performance is carried out by performing an experimental study on a high-latency PC cluster, and at a smaller scale, on a multi-core processor using in addition the SWARM parallel computing framework for multi-core processors. Our implementation of the parallel algorithm is not only architecture but also communication library independent: the same code works under LAM-MPI and Open MPI and also BSPlib, two sets of library frameworks that facilitate parallel programming. The suitability of our approach to multi-core processors is also established.
This paper presents the parallel particle swarm optimization color quantization algorithm, the parallel particle swarm optimization combines the nature parallel characters of standard particle swarm optimization with ...
详细信息
This paper presents the parallel particle swarm optimization color quantization algorithm, the parallel particle swarm optimization combines the nature parallel characters of standard particle swarm optimization with parallel computation models, and the parallel particle swarm optimization is applied color quantization of color image;According to the evolution theory of particle swarm, Through iterative optimization, the most superior palette is determined, and quantization of color mapping of every pixel is completed. Experiment results show that parallel Particle Swarm Optimization Color Quantization algorithm is obviously superior to standard particle swarm optimization since it has higher Performance.
GIS software requires the ability to simplify polyline features in real-time when displaying linear vector data with plenty of vertices. The Douglas-Peucker polyline simplification algorithm has been widely adopted in...
详细信息
GIS software requires the ability to simplify polyline features in real-time when displaying linear vector data with plenty of vertices. The Douglas-Peucker polyline simplification algorithm has been widely adopted in this area for decades, though it is often criticized for its low performance when exist a large number of vertices on a polyline which should be subdivided into many separate segments and calculated perpendicular offsets repeatedly in the algorithm. That was the main obstacle to accomplish real-time simplification and displaying. As shared memory multi-core processor computers become more widely available, it might be a good opportunity to improve the performance of the Douglas-Peucker method by converting its sequential implementation to parallel form. This paper presents two different parallel implementations. The first is done by separating a polyline feature into irrelevant segments and distributing segments to parallel threads. The second dispatches each polyline feature to an idle parallel thread in which the conventional sequential method is applied. By utilizing the official China's provincial boundary geospatial data set, and C++ language for programming, performances on various shared memory multi-core processor computers (including dual-core, triple-core, and quad-core processors from AMD and Intel respectively) are compared among the four implementations together with the original sequential forms. It is proved that with the increment of processor's cores and the number of threads accordingly, the parallel algorithms will efficiently reduce the number of vertices of a polyline and generate multi-resolution polyline data, which will dramatically speed up the process of simplifications and thus real-time display effects are achieved.
Utilizing the method of the sub-structure through the parallel processing to spline finite element analysis for plate bending problems,we give a parallel algorithm
Utilizing the method of the sub-structure through the parallel processing to spline finite element analysis for plate bending problems,we give a parallel algorithm
暂无评论