Design and Implementation of a Massively Parallel Version of DIRECT

Simple item page
dc.contributor.authorHe, Jianen
dc.contributor.authorVerstak, Alexen
dc.contributor.authorWatson, Layne T.en
dc.contributor.authorSosonkina, Mashaen
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:58Zen
dc.date.available2013-06-19T14:36:58Zen
dc.date.issued2006en
dc.description.abstractThis paper describes several massively parallel implementations for a global search algorithm DIRECT. Two parallel schemes take different approaches to address DIRECT's design challenges imposed by memory requirements and data dependency. Three design aspects in topology, data structures, and task allocation are compared in detail. The goal is to analytically investigate the strengths and weaknesses of these parallel schemes, identify several key sources of inefficiency, and experimentally evaluate a number of improvements in the latest parallel DIRECT implementation. The performance studies demonstrate improved data structure efficiency and load balancing on a 2200 processor cluster.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000736/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000736/01/pdirCOAP05.pdfen
dc.identifier.trnumberTR-06-02en
dc.identifier.urihttp://hdl.handle.net/10919/20214en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectParallel computationen
dc.titleDesign and Implementation of a Massively Parallel Version of DIRECTen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
pdirCOAP05.pdf
Size:
262.87 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports