.png){kind=icon}
.png){kind=icon}
Return
Supporting adaptive and irregular parallelism for non-linear numerical optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.12.092.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an infrastructure for high performance numerical optimization on clusters of multicore systems. Building on a runtime system which implements a programming and execution environment for irregular and adaptive task-based parallelism, we extract and exploit the parallelism of a Multistart optimization strategy at multiple levels, which include second order derivative calculations for Newton-based local optimization. The runtime system can support a dynamically changing hierarchical execution graph, without any assumptions on the levels of parallelization. This enables the optimization practitioners to implement, transparently, even more complicated schemes. We discuss parallelization details and task distribution schemes for managing nested and dynamic parallelism. In addition, we apply our framework to a real-world application case that concerns the protein conformation problem. Finally, we report performance results for all the components of our system on a multicore cluster. (C) 2014 Elsevier Inc. All rights reserved.
Keywords:
Irregular and multilevel parallelism
Adaptive task parallelism
Multicore clusters
Message passing
Numerical differentiation
Numerical optimization
Protein conformation
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
View more organizations