PARALLEL MULTISPLITTINGS FOR OPTIMIZATION*
作者:
R. A. RENAUT,
H. D. MITTELMANN,
期刊:
Parallel Algorithms and Applications
(Taylor Available online 1995)
卷期:
Volume 7,
issue 1-2
页码: 17-27
ISSN:1063-7192
年代: 1995
DOI:10.1080/10637199508915519
出版商: Taylor & Francis Group
关键词: Parallel algorithms;multisplitting;optimization;least squares;Householder QR decomposition;hypercube computer;PVM
数据来源: Taylor
摘要:
The philosophy of multisplitting methods is the replacement of a large-scale linear or nonlinear problem by a set of subproblems, each of which can be solved locally and independently in parallel by taking advantage of well-tested sequential algorithms. Because of this formulation most compute-intensive operations can be calculated independently and the algorithms are highly parallel. Recent developments for optimization, constrained and unconstrained, are described. These new algorithms are, in some cases, faster in sequential mode than conventional algorithms. Results of implementations on the Intel Paragon and on a cluster of workstations using PVM3 demonstrate superlinear speedup when compared with a standard test algorithm programmed in sequential mode. Further, the same algorithm when programmed in sequential mode also exhibits speedup when compared to the non-split algorithm.
点击下载:
PDF (222KB)
返 回