Show simple item record

dc.contributor.authorYuzhen, Geen_US
dc.contributor.authorWatson, Layne T.en_US
dc.contributor.authorCollins, Emmanuel G.en_US
dc.date.accessioned2013-06-19T14:35:46Z
dc.date.available2013-06-19T14:35:46Z
dc.date.issued1995-07-01
dc.identifierhttp://eprints.cs.vt.edu/archive/00000425/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19921
dc.description.abstractA distributed version of a homotopy algorithm for solving the H-squared/H-to infinity mixed-norm controller synthesis problem is presented. The main purpose of the study is to explore the possibility of achieving high performance with low cost. Existing UNIX workstations running PVM (Parallel Virtual Machine) are utilized. Only the Jacobian matrix computation is distributed and therefore the modification to the original sequential code is minimal. The same algorithm has also been implemented on an Intel Paragon parallel machine. Our implementation shows that acceptable speedup is achieved and the larger the problem sizes, the higher the speedup. Comparing with the results from the Intel Paragon, the study concludes that utilizing the existing UNIX workstations can be a very cost-effective approach to shorten computation time. Furthermore, this economical way to achieve high performance computation can easily be realized and incorporated in a practical industrial design environment.en_US
dc.format.mimetypeapplication/postscripten_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleCost-Effective Parallel Processing for H-squared/H-to infinity Controller Synthesisen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-95-10en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000425/01/TR-95-10.ps


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record