General implementation of multilevel parallelization in a gradient-based design optimization algorithm

Subramaniam Rajan, A. D. Belegundu, A. S. Damle, D. Lau, J. St.Ville

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

As product designs have become more sophisticated, both the simulation models (e.g., finite element models) and the design optimization models have grown bigger. To keep pace with this increase in problem size, we present and implement an optimization strategy that can run on a computing cluster with demonstrable efficiency. First, parallelism is implemented in the context of gradient calculations using divided differences. Then, parallelism is achieved in the context of both direction-finding and line-search steps. Parallel direction finding improves the convergence rate as opposed to just cutting down the amount of arithmetic. A new algorithm based on method of feasible directions is discussed that obtains better optima and is also computationally faster. Implementation details regarding distribution of computing tasks to improve scalability and load balancing are presented. Numerical examples show the efficiency of the developed methodology on a relatively small computing cluster. Gains of about 7:1 have been obtainable using 16 processors on some test problems. Importantly, the framework presented can be developed by researchers using other gradient-based optimization codes on different computing platforms.

Original languageEnglish (US)
Pages (from-to)1993-2001
Number of pages9
JournalAIAA Journal
Volume44
Issue number9
DOIs
StatePublished - Sep 2006

Fingerprint

Cluster computing
Product design
Resource allocation
Scalability
Design optimization

ASJC Scopus subject areas

  • Aerospace Engineering

Cite this

General implementation of multilevel parallelization in a gradient-based design optimization algorithm. / Rajan, Subramaniam; Belegundu, A. D.; Damle, A. S.; Lau, D.; St.Ville, J.

In: AIAA Journal, Vol. 44, No. 9, 09.2006, p. 1993-2001.

Research output: Contribution to journalArticle

Rajan, Subramaniam ; Belegundu, A. D. ; Damle, A. S. ; Lau, D. ; St.Ville, J. / General implementation of multilevel parallelization in a gradient-based design optimization algorithm. In: AIAA Journal. 2006 ; Vol. 44, No. 9. pp. 1993-2001.
@article{8b8f2eff7094495fabc76f88c9aee105,
title = "General implementation of multilevel parallelization in a gradient-based design optimization algorithm",
abstract = "As product designs have become more sophisticated, both the simulation models (e.g., finite element models) and the design optimization models have grown bigger. To keep pace with this increase in problem size, we present and implement an optimization strategy that can run on a computing cluster with demonstrable efficiency. First, parallelism is implemented in the context of gradient calculations using divided differences. Then, parallelism is achieved in the context of both direction-finding and line-search steps. Parallel direction finding improves the convergence rate as opposed to just cutting down the amount of arithmetic. A new algorithm based on method of feasible directions is discussed that obtains better optima and is also computationally faster. Implementation details regarding distribution of computing tasks to improve scalability and load balancing are presented. Numerical examples show the efficiency of the developed methodology on a relatively small computing cluster. Gains of about 7:1 have been obtainable using 16 processors on some test problems. Importantly, the framework presented can be developed by researchers using other gradient-based optimization codes on different computing platforms.",
author = "Subramaniam Rajan and Belegundu, {A. D.} and Damle, {A. S.} and D. Lau and J. St.Ville",
year = "2006",
month = "9",
doi = "10.2514/1.17470",
language = "English (US)",
volume = "44",
pages = "1993--2001",
journal = "AIAA Journal",
issn = "0001-1452",
publisher = "American Institute of Aeronautics and Astronautics Inc. (AIAA)",
number = "9",

}

TY - JOUR

T1 - General implementation of multilevel parallelization in a gradient-based design optimization algorithm

AU - Rajan, Subramaniam

AU - Belegundu, A. D.

AU - Damle, A. S.

AU - Lau, D.

AU - St.Ville, J.

PY - 2006/9

Y1 - 2006/9

N2 - As product designs have become more sophisticated, both the simulation models (e.g., finite element models) and the design optimization models have grown bigger. To keep pace with this increase in problem size, we present and implement an optimization strategy that can run on a computing cluster with demonstrable efficiency. First, parallelism is implemented in the context of gradient calculations using divided differences. Then, parallelism is achieved in the context of both direction-finding and line-search steps. Parallel direction finding improves the convergence rate as opposed to just cutting down the amount of arithmetic. A new algorithm based on method of feasible directions is discussed that obtains better optima and is also computationally faster. Implementation details regarding distribution of computing tasks to improve scalability and load balancing are presented. Numerical examples show the efficiency of the developed methodology on a relatively small computing cluster. Gains of about 7:1 have been obtainable using 16 processors on some test problems. Importantly, the framework presented can be developed by researchers using other gradient-based optimization codes on different computing platforms.

AB - As product designs have become more sophisticated, both the simulation models (e.g., finite element models) and the design optimization models have grown bigger. To keep pace with this increase in problem size, we present and implement an optimization strategy that can run on a computing cluster with demonstrable efficiency. First, parallelism is implemented in the context of gradient calculations using divided differences. Then, parallelism is achieved in the context of both direction-finding and line-search steps. Parallel direction finding improves the convergence rate as opposed to just cutting down the amount of arithmetic. A new algorithm based on method of feasible directions is discussed that obtains better optima and is also computationally faster. Implementation details regarding distribution of computing tasks to improve scalability and load balancing are presented. Numerical examples show the efficiency of the developed methodology on a relatively small computing cluster. Gains of about 7:1 have been obtainable using 16 processors on some test problems. Importantly, the framework presented can be developed by researchers using other gradient-based optimization codes on different computing platforms.

UR - http://www.scopus.com/inward/record.url?scp=33749250234&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749250234&partnerID=8YFLogxK

U2 - 10.2514/1.17470

DO - 10.2514/1.17470

M3 - Article

VL - 44

SP - 1993

EP - 2001

JO - AIAA Journal

JF - AIAA Journal

SN - 0001-1452

IS - 9

ER -