Show simple item record

dc.contributor.authorWatson, Layne T.en_US
dc.contributor.authorBaker, Chuck A.en_US
dc.date.accessioned2013-06-19T14:35:44Z
dc.date.available2013-06-19T14:35:44Z
dc.date.issued2000
dc.identifierhttp://eprints.cs.vt.edu/archive/00000562/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19997
dc.description.abstractThe n-dimensional direct search algorithm DIRECT of Jones,Perttunen, and Stuckman has attracted recent attention from the multidisciplinary design optimization community. Since DIRECT only requires function values (or ranking)and balances global exploration with local refinement better than n-dimensional bisection, it is well suited to the noisy function values typical of realistic simulations. While not efficient for high accuracy optimization, DIRECT is appropriate for the sort of global design space exploration done in large scale engineering design. Direct and pattern search schemes have the potential to exploit massive parallelism, but efficient use of massively parallel machines is nontrivial to achieve. This paper presents a fully distribute control version of DIRECT that is designed for massively parallel (distribute memory architectures. Parallel results are presented for a multidisciplinary design optimization problem — configuration design of a high speed civil transport.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.subjectParallel computationen_US
dc.titleA fully Distributed Parallel Global Search Algorithmen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-00-06en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000562/01/TR-00-06.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record