检索结果-内蒙古大学图书馆

An Explicit-Implicit Predictor-Corrector Domain Decomposition Method for Time Dependent Multi-Dimensional Convection Diffusion Equations

引用

Numerical Mathematics(Theory,Methods and Applications) 2009年第3期2卷 301-325页

作者： Liyong Zhu Guangwei Yuan Qiang Du Laboratory of Computational Physics Institute of Applied Physics andComputational Mathematics Beijing China. Division of Mathematical Sciences School of Physical and MathematicalSciences Nanyang Technological University Singapore 637371. Department of Mathematics Pennsylvania State University University ParkPA 16802 USA.

The numerical solution of large scale multi-dimensional convection diffusion equations often requires efficient parallel *** this work,we consider the extension of a recently proposed non-overlapping domain decomposition method for two dimensional time dependent convection diffusion equations with variable coefficients. By combining predictor-corrector technique,modified upwind differences with explicitimplicit coupling,the method under consideration provides intrinsic parallelism while maintaining good stability and ***,for multi-dimensional problems, the method can be readily implemented on a multi-processor system and does not have the limitation on the choice of subdomains required by some other similar predictor-corrector or stabilized *** properties of the method are demonstrated in this work through both rigorous mathematical analysis and numerical experiments.

关键词： Convection diffusion equation parallel algorithm domain decomposition modifiedupwind differences predictor-corrector explicit-implicit scheme convergence analysis.

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED parallel PREFIX algorithm ON OTIS-MESH

引用

parallel PROCESSING LETTERS 2006年第4期16卷 429-440页

作者： Jana, Prasanta K. Sinha, Bhabani P. Indian Sch Mines Dept Comp Sci & Engn Dhanbad 826004 Bihar India Indian Stat Inst Adv Comp & Microelectron Unit Kolkata 700035 W Bengal India

Wang and Sahni [4] reported two parallel algorithms for Appoint prefix computation on an N-processor OTIS-Mesh optoelectronic computer. The overall time complexity for both SIMD and MIMD models of their first algorithm was shown to be (8 N-1/4 -1) electronic moves and 2 OTIS moves. This was further reduced to (7 N-1/4 -1) electronic moves and 2 OTIS moves in their second algorithm. We present here an improved parallel algorithm for Appoint prefix computation on an N-processor OTIS-Mesh, which needs (5.5 N-1/4 + 3) electronic moves and 2 OTIS moves. Our algorithm is based on the general theme of parallel prefix algorithm proposed in [4] but following the data distribution and local prefix computation similar to that of [1].

关键词： Prefix computation optoelectronic computers OTIS-Mesh parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for continuous competitive location problems

Parallel algorithms for continuous competitive location prob...

引用

2nd International Conference on Optimization Methods and Software/6th EUROPT Workshop on Advances in Continuous Optimization

作者： Redondo, Juana L. Fernandez, Jose Garcia, Inmaculada Ortigosa, Pilar M. Univ Almeria Dept Comp Architecture & Elect Almeria Spain Univ Murcia Dept Stat & Operat Res Murcia Spain

A continuous location problem in which a firm wants to set up a single new facility in a competitive environment is considered. Other facilities offering the same product or service already exist in the area. Both the location and the quality of the new facility are to be found so as to maximize the profit obtained by the firm. This is a hard-to-solve global optimization problem. An evolutionary algorithm called Universal Evolutionary Global Optimizer (UEGO) seems to be the best procedure to cope with it, but the algorithm needs several hours of CPU time for solving large instances. In this paper, four parallelizations of UEGO are presented. They all are coarse-grain methods which differ in their migratory policies. A computational study is carried out to compare the performance of the parallel algorithms. The results show that one of the parallelizations always gives the best objective function value and has an almost linear speed-up for up to 16 processing elements for large instances.

关键词： parallel algorithm coarse-grain method migratory policy evolutionary algorithm continuous location computational study

来源：评论

学校读者我要写书评

暂无评论

Multi-Colony Ant algorithm using both Repulsive Operator and Pheromone Crossover based on Multi-Optimum for TSP

Multi-Colony Ant Algorithm using both Repulsive Operator and...

引用

2nd International Conference on Business Intelligence and Financial Engineering

作者： Chen, Enxiu Liu, Xiyu Shandong Inst Commerce & Technol Informat Technol Sch Jinan Shandong Peoples R China Shandong Normal Univ Sch Management & Econ Jinan Shandong Peoples R China

ISBN: (纸本)9780769537054

This paper presents a modified multi-colony ant algorithm, based upon a pheromone arithmetic crossover and a repulsive operator. Iteration of this algorithm can avoid some stagnating states of basic ant colony optimization. An important mechanism of this algorithm is the reinitialization of such stagnating states (worst performing ant colonies), which is accomplished through application of the pheromone arithmetic crossover and the repulsive operator. At the same time, the main algorithm parameters alpha, beta and rho are self-adaptive. The ratio of communication time between processors to the computation time of the processors of this system (master and slaves) is relatively small. Comparing against a parallel asynchronous algorithm, we show the effectiveness of the modified multi-colony ant algorithm.

关键词： Max-Min Ant System Multi-colony ant algorithm parallel algorithm Pheromone Crossover Repulsive operator

来源：评论

学校读者我要写书评

暂无评论

Optimized Stencil Computation Using In-Place Calculation on Modern Multicore Systems

引用

15th International Euro-Par Conference on parallel Computing

作者： Augustin, Werner Heuveline, Vincent Weiss, Jan-Philipp Univ Karlsruhe TH Karlsruhe Inst Technol SRG New Frontiers High Performance Comp Karlsruhe Germany Univ Karlsruhe TH Karlsruhe Inst Technol RG Numer Simulat Optimizat & High Performance Com Karlsruhe Germany

ISBN: (纸本)9783642038686

Numerical algorithms on parallel systems built upon modern multicore processors are facing two challenging obstacles that keep realistic applications from reaching the theoretically available compute performance. First;the parallelization on several system levels has to be exploited to the full extent. Second, provision of data to the compute cores needs to be adapted to the constraints of a hardware-controlled nested cache hierarchy with shared resources. In this paper we analyze dedicated optimization techniques on modern multicore systems for stencil kernels on regular three-dimensional grids. We combine various methods like a compressed grid algorithm with finite shifts in each time step and loop skewing into an optimized parallel in-place stencil implementation of the three-dimensional Laplacian operator. In that context, memory requirements are reduced by a factor of approximately two while considerable performance gains are observed on modern Intel and AMD based multicore systems.

关键词： parallel algorithm multicore processors bandwidth-bound in-place stencil cache optimization compressed grid time blocking

来源：评论

学校读者我要写书评

暂无评论

EpiFast: A Fast algorithm for Large Scale Realistic Epidemic Simulations on Distributed Memory Systems 09

EpiFast: A Fast Algorithm for Large Scale Realistic Epidemic...

引用

ACM SIGARCH International Conference on Supercomputing

作者： Bisset, Keith R. Chen, Jiangzhuo Feng, Xizhou Kumar, V. S. Anil Marathe, Madhav V. Virginia Tech Virginia Bioinformat Inst Blacksburg VA 24061 USA

ISBN: (纸本)9781605584980

Large scale realistic epidemic simulations have recently become an increasingly important application of high-performance computing. We propose a parallel algorithm, EpiFast, based on a novel interpretation of the stochastic disease propagation in a contact network. We implement it using a master-slave computation model which allows scalability on distributed memory systems. EpiFast runs extremely fast for realistic simulations that involve: (i) large populations consisting of millions of individuals and their heterogeneous details, (ii) dynamic interactions between the disease propagation, the individual behaviors, and the exogenous interventions, as well as (iii) large number of replicated runs necessary for statistically sound estimates about the stochastic epidemic evolution. We find that EpiFast runs several magnitude faster than another comparable simulation tool while delivering similar results. EpiFast has been tested on commodity clusters as well as SGI shared memory machines. For a fixed experiment, if given more computing resources, it scales automatically and runs faster. Finally, EpiFast has been used as the major simulation engine in real studies with rather sophisticated settings to evaluate various dynamic interventions and to provide decision support for public health policy makers.

关键词： simulation parallel algorithm distributed memory social contact network seir epidemics

来源：评论

学校读者我要写书评

暂无评论

Clustering Billions of Data Points Using GPUs

Clustering Billions of Data Points Using GPUs

引用

6th ACM International Conference on Computing Frontiers and Workshops

作者： Wu, Ren Zhang, Bin Hsu, Meichun HP Labs Palo Alto CA 94304 USA

ISBN: (纸本)9781605585574

In this paper, we report our research on using GPUs to accelerate Clustering of very large data sets, which are common in today's real world applications. While many published works have shown that GPUs can be used to accelerate various general purpose applications with respectable performance gains, Few attempts have been made to tackle very large problems. Our goal here is to investigate if GPUs can be useful accelerators even with very large data sets that cannot fit into GPU's onboard memory. Using a popular clustering algorithm, K-Means, as all example. our results have been very positive. On a data set with a billion data points. Our GPU-accelerated implementation achieved an order of magnitude performance gain over a highly optimized CPU-only version running on 8 cores, and more than two orders of magnitude gain over a popular benchmark, MineBench, running on a single core.

关键词： parallel algorithm Data-mining Clustering Graphics Processor GPGPU Accelerator Multi-core Many-core Data parallelism

来源：评论

学校读者我要写书评

暂无评论

SPLIT CONVEX MINIMIZATION algorithm FOR SIGNAL RECOVERY

SPLIT CONVEX MINIMIZATION ALGORITHM FOR SIGNAL RECOVERY

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Combettes, Patrick L. Pesquet, Jean-Christophe Univ Paris 06 UPMC Lab Jacques Louis Lions UMR 7598 F-75005 Paris France Univ Paris Inst Gaspard Mongo UMR 8049 F-77454 Paris France

ISBN: (纸本)9781424423538

A broad range of signal recovery problems can be abstracted into the problem of minimizing the sum of several convex functions in a Hilbert space. We propose a proximal decomposition algorithm which, under mild conditions, provides a solution to such a problem. A significant improvement over the methods currently in use in the area of signal recovery is that it is not limited to two nondifferentiable functions. An application to image restoration is demonstrated.

关键词： convex optimization methods inverse problems parallel algorithm signal restoration variational methods wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

DIAMOND ARCHITECTURE WITH NOD SORTING

DIAMOND ARCHITECTURE WITH NOD SORTING

引用

IEEE Youth Conference on Information, Computing and Telecommunication

作者： Damrudi, Masumeh Aval, Kamal Jadidy Islamic Azad Univ Firuzkuh Branch Dept Comp Sci Tehran Iran

ISBN: (纸本)9781424450756

In this paper we introduce a new architecture which is called Diamond. This architecture has new techniques for interconnection among processors. We also present a new sorting algorithm on it. This algorithm which we name it NOD (Neighborhood sort On Diamond), sorts n data with 7/4n processors. The aim of issued architecture and algorithm is to reduce the cost of sorting by using a simple archiecture and a simple way of sorting. There are architectures and sorting algorithms that are used but we always endeavor to find new and optimal ones. The algorithm on the issued architecture sorts data elements using 7/4n processors with a running time of O(n). Our architecture is heterogeneous and uses cheaper processors more than expensive ones. Though, this architecture makes a tradeoff between number of processors and their cost.

关键词： parallel algorithm Sorting parallel architecture Diamond NOD

来源：评论

学校读者我要写书评

暂无评论

Fast and Scalable List Ranking on the GPU 09

Fast and Scalable List Ranking on the GPU

引用

ACM SIGARCH International Conference on Supercomputing

作者： Rehman, M. Suhail Kothapalli, Kishore Narayanan, P. J. Int Inst Informat Technol Hyderabad Andhra Pradesh India

ISBN: (纸本)9781605584980

General purpose programming on the graphics processing units (GPGPU) has received a lot of attention in the parallel computing community as it promises to offer the highest performance per dollar. The GPUs have been used extensively on regular problems that can be easily parallelized. In this paper, we describe two implementations of List Ranking, a traditional irregular algorithm that is difficult to parallelize on such massively multi-threaded hardware. We first present an implementation of Wyllie's algorithm based on pointer jumping. This technique does not scale well to large lists due to the suboptimal work done. We then present a GPU-optimized, Recursive Helman-JaJa (RHJ) algorithm. Our RHJ implementation can rank a random list of 32 million elements in about a second and achieves a speedup of about 8-9 over a GPU implementation as well as a speedup of 3-4 over the best reported implementation on the Cell Broadband engine. We also discuss the practical issues relating to the implementation of irregular algorithms on massively multi-threaded architectures like that of the GPU. Regular or coalesced memory accesses pattern and balanced load are critical to achieve good performance on the GPU.

关键词： GPGPU list ranking many-core parallel algorithm irregular algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：