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

asynchronous parallel algorithms BASED ON DDM ON CM-5 (I) FOR SOLVING LINEAR ELLIPTIC PDE'S∗

parallel algorithms and Applications 1996年第3-4期9卷 161-172页

作者： Lishan Kang[a] Yuping Chen[a] Iain MacLeod[b] Lujuan Chen[b] [a] Software Engineering State Key Laboratory Wuhan University PR. of China [b] Computer Sciences Laboratory The Australian National University Canberra 0200|Australia

This is the first in a series of papers about asynchronous parallel algorithms based on domain decomposition method (DDM) for solving partial differential equations on MIMD machines, especially on CM-5. These algorithms are all called Schwarz-Chaotic Over Relaxation (S-COR), the generalization of the Schwarz Alternating Method. In this paper, the linear elliptic partial differential equations is discussed. Numerical results are presented to demonstrate the effectiveness of these decomposition algorithms on the Thinking Machines CM-5 parallel supercomputer.

关键词： asynchronous parallel algorithms Schwarz-chaotic overrelaxation Schwarz alternating method CM-5 parallel supercomputer G. 1.3 G. 1.7 G. 1.8

来源：评论

学校读者我要写书评

暂无评论

asynchronous parallel algorithms for test set partitioned fault simulation 97

Asynchronous parallel algorithms for test set partitioned fa...

引用

Proceedings of the eleventh workshop on parallel and distributed simulation

作者： Dilip Krishnaswamy Prithviraj Banerjee Elizabeth M. Rudnick Janak H. Patel Center for Reliable and High-Performance Computing University of IIlinois UrbanaIL Center for Parallel and Distributed Computing Northwestern University Evanston IL

ISBN: (纸本)9780818679650

We propose two new asynchronous parallel algorithms for test set partitioned fault simulation. The algorithms are based on a new two-stage approach to parallelizing fault simulation for sequential VLSI circuits in which the test set is partitioned among the available processors. These algorithms provide the same result as the previous synchronous two stage approach. However, due to the dynamic characteristics of these algorithms and due to the fact that there is very minimal redundant work, they run faster than the previous synchronous approach. A theoretical analysis comparing the various algorithms is also given to provide an insight into these algorithms. The implementations were done in MPI and are therefore portable to many parallel platforms. Results are shown for a shared memory multiprocessor.

关键词： asynchronous parallel algorithms test set partitioned fault simulation circuit analysis computing software portability dynamic characteristics redundant work MPI sequential VLSI circuits Message Passing Interface synchronous two stage approach shared memory multiprocessor circuit CAD

来源：评论

学校读者我要写书评

暂无评论

Automatic data mining by asynchronous parallel evolutionary algorithms

引用

2nd International Symposium on Intelligence Computation and Application (ISICA 2007)

作者： Li, Yan Kang, Zhuo Gao, Hanping Wuhan Univ State Key Lab Software Engn Wuhan 430074 Peoples R China

ISBN: (纸本)9783540745808

In this paper An asynchronous parallel Evolutionary Modeling Algorithm (APEMA) for automatically modeling of dynamic systems is proposed. The algorithm is based on a two -level hybrid evolutionary modeling algorithm HEMA]. The APEMA is used to automatically discover knowledge modeled by higher order of ordinary differential equations from dynamic data by using different computing systems, especially, the MIMD computers. Two cases of modeling examples are used to demonstrate the potential of APEMA One is for modeling the limit of the solutions of BUMP problem as its dimension n tending to infinity, another is for modeling the super-spreading events of severe acute respiratory syndrome (SORS) in Beijing, 2003. The results show that the dynamic models automatically discovered in data by computer sometimes can compare with the models discovered by human beings.

关键词： evolutionary modeling asynchronous parallel algorithms higher order of ordinary differential equations dynamic data

来源：评论

学校读者我要写书评

暂无评论

A parallel asynchronous implementation of the epsilon-relaxation method for the linear minimum cost flow problem

引用

parallel COMPUTING 1997年第8期23卷 1021-1044页

作者： Beraldi, P Guerriero, F Dipartimento di Elettronica Informatica e Sistemistica Universita' della Calabria 87036 Rende (CS Italy

In this paper we present a parallel asynchronous implementation of the epsilon-relaxation method for solving the linear minimum cost flow problem on distributed memory message-passing multiprocessor systems. The general structure of the method is well suited to efficient parallelization, since a single iteration can be performed on several nodes simultaneously. We describe the implementation details of the parallel version on both a Fujitsu AP1000 and a cluster of Digital Alpha workstations connected via FDDI links. The results obtained demonstrate that our implementation is capable of substantial speedups.

关键词： network optimization linear minimum cost flow problem epsilon-relaxation method distributed memory systems asynchronous parallel algorithms speedup

来源：评论

学校读者我要写书评

暂无评论

A parallel asynchronous NEWTON ALGORITHM FOR UNCONSTRAINED OPTIMIZATION

引用

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 1993年第2期77卷 305-322页

作者： CONFORTI, D MUSMANNO, R 1. Dipartimento di Elettronica Informatica e Sistemistica Università della Calabria Rende Cosenza Italy

A new approach to the solution of unconstrained optimization problems is introduced. It is based on the exploitation of parallel computation techniques and in particular on an asynchronous communication model for the data exchange among concurrent processes. The proposed approach arises by interpreting the Newton method as being composed of a set of iterative and independent tasks that can be mapped onto a parallel computing system for the execution. Numerical experiments on the resulting algorithm have been carried out to compare parallel versions using synchronous and asynchronous communication mechanisms in order to assess the benefits of the proposed approach on a variety of parallel computing architectures. It is pointed out that the proposed asynchronous Newton algorithm is preferable for medium and large-scale problems, in the context of both distributed and shared memory architectures.

关键词： NEWTON METHOD UNCONSTRAINED OPTIMIZATION asynchronous parallel algorithms parallel COMPUTATION

来源：评论

学校读者我要写书评

暂无评论

CONVERGENCE AND NUMERICAL RESULTS FOR A parallel asynchronous QUASI-NEWTON METHOD

引用

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 1995年第2期84卷 293-310页

作者： CONFORTI, D MUSMANNO, R Assistant Professor Research Assistant Dipartimento di Elettronica Informatica e Sistemistica Università della Calabria Rende Cosenza Italy

During the execution of a parallel asynchronous iterative algorithm, each task does not wait for predetermined data to become available. On the contrary, they can be viewed as local and independent iterative algorithms, which perform their own iterative scheme on the data currently available. On the basis of this computational model, a parallel asynchronous version of the quasi-Newton method for solving unconstrained optimization problems is proposed. The algorithm is based on four tasks concurrently executing and interacting in an asynchronous way. Convergence conditions are established and numerical results are presented which prove the effectiveness of the proposed parallel asynchronous approach.

关键词： UNCONSTRAINED OPTIMIZATION QUASI-NEWTON METHODS asynchronous parallel algorithms HIERARCHICAL parallelISM

来源：评论

学校读者我要写书评

暂无评论

Coupling parallel asynchronous multisplitting methods with Krylov methods to solve pseudo-linear evolution 3D problems

引用

JOURNAL OF COMPUTATIONAL SCIENCE 2021年 51卷 101303-101303页

作者： Garcia, T. Spiteri, P. Ziane-Khodja, L. Couturier, R. Univ Toulouse IRIT INPT 2 Rue Charles CamichelBP 122 F-31071 Toulouse 7 France Univ Toulouse IRIT INPT ENSEEIHT 2 Rue Charles CamichelBP 7122 F-31071 Toulouse 7 France ANEO 122 Ave Gen Leclerc F-92100 Boulogne France Univ Bourgogne Franche Comte CNRS FEMTO ST Inst 19 Av Marechal JuinBP 527 F-90016 Belfort France

The present study deals with pseudo-linear problems solving using parallel asynchronous multisplitting methods combined with Krylov methods. With appropriate and realistic assumptions, the behavior of such parallel iterative algorithms will be analyzed by partial ordering techniques in relation with the discrete maximum principle. Applications to discretized boundary value problems are presented, the implementation of the algorithms is described and parallel experiments are analyzed.

关键词： Multisplitting methods Synchronous parallel algorithms asynchronous parallel algorithms Sparse non-linear systems Krylov methods Pseudo-linear problem Principle of discrete maximum Boundary value problem

来源：评论

学校读者我要写书评

暂无评论

Solution of univalued and multivalued pseudo-linear problems using parallel asynchronous multisplitting methods combined with Krylov methods

引用

ADVANCES IN ENGINEERING SOFTWARE 2021年 153卷 102929-102929页

作者： Garcia, T. Spiteri, P. Ziane-Khodja, L. Couturier, R. Univ Toulouse IRIT INPT 2 Rue Charles CamichelBP 7122 F-31071 Toulouse 7 France Univ Toulouse IRIT INPT ENSEEIHT 2 Rue Charles CamichelBP 7122 F-31071 Toulouse 7 France ANEO 122 Ave Gen Leclerc F-92100 Boulogne France Univ Bourgogne Franche Comte CNRS FEMTO ST Inst 19 Ave Marchal JuinBP 527 F-90016 Belfort France

The paper improves a preliminary experimental study on a cluster by adding both theoretical results and experimental tests on a grid platform. These algorithms solve univalued and multivalued pseudo-linear problems using parallel asynchronous multisplitting methods combined with Krylov's methods. This paper also analyses these algorithms using contraction techniques. Two distinct applications, with discretized boundary value problems, are analyzed and simulated. First, a univalued convection-diffusion problem perturbed by an increasing diagonal operator is presented. Then, follows the description of a diffusion problem whose solution is constrained. This situation classically leads to the solution of a multivalued pseudo-linear problem in which the linear part is perturbed by an increasing diagonal multivalued operator. parallel asynchronous and synchronous algorithms were implemented and tested on a grid platform composed of physically adjacent or geographically distant machines. In addition, the simulation results are detailed and show that the elapsed times obtained for the asynchronous algorithms are significantly less than those obtained for the synchronous algorithms.

关键词： multisplitting methods synchronous parallel algorithms asynchronous parallel algorithms sparse non-linear systems Krylov methods pseudo - liner problem boundary value problem

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for solving the convex minimum cost flow problem

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2001年第2期18卷 175-190页

作者： Beraldi, P Guerriero, F Musmanno, R Univ Calabria Dipartimento Elettr Informat & Sistemist I-87036 Rende CS Italy Univ Lecce Fac Ingn I-73100 Lecce Italy

In this paper we deal with the solution of the separable convex cost network flow problem. In particular, we propose a parallel asynchronous version of the epsilon -relaxation method and we prove theoretically its correctness. We present two implementations of the parallel method for a shared memory multiprocessor system, and we empirically analyze their numerical performance on different test problems. The preliminary numerical results show a good reduction of the execution time of the parallel algorithm with the respect to the sequential counterpart.

关键词： convex minimum cost flow problem epsilon-relaxation method shared memory multiprocessor asynchronous parallel algorithms speedup

来源：评论

学校读者我要写书评

暂无评论

asynchronous POLYNOMIAL ZERO-FINDING algorithms

引用

parallel COMPUTING 1991年第6-7期17卷 673-681页

作者： FREEMAN, TL BANE, MK Department of Mathematics University of Manchester Manchester M13 9PL UK

Frequent synchronisations have a significant effect on the efficiency of parallel numerical algorithms. In this paper we consider simultaneous polynomial zero-finding algorithms and analyse, both theoretically and num... 详细信息

关键词： POLYNOMIAL ROOT-FINDERS asynchronous parallel algorithms LOCAL MEMORY parallel COMPUTERS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：