Hephaestus: Solving the Heterogeneous, Highly Constrained Analog Placement Problem

ResearchWorks/Manakin Repository

Search ResearchWorks


Advanced Search

Browse

My Account

Statistics

Related Information

Hephaestus: Solving the Heterogeneous, Highly Constrained Analog Placement Problem

Show simple item record

dc.contributor.advisor Hauck, Scott en_US
dc.contributor.author Price, Andrew Daniel en_US
dc.date.accessioned 2012-09-13T17:27:50Z
dc.date.available 2012-09-13T17:27:50Z
dc.date.issued 2012-09-13
dc.date.submitted 2012 en_US
dc.identifier.other Price_washington_0250O_10227.pdf en_US
dc.identifier.uri http://hdl.handle.net/1773/20656
dc.description Thesis (Master's)--University of Washington, 2012 en_US
dc.description.abstract The purpose of this research was to investigate alternative methods for placement of highly constrained, heterogeneous architectures. Because of certain constraints on these architectures, traditional methods for placement cannot be applied directly. This thesis discusses those traditional methods that were considered but ruled out for various reasons. A unique simulated annealing solution was developed which simultaneously places and routes designs. The research then examined different move sets and cost metrics used with the annealer which directly affected the ability to successfully place and route. By treating signal to wire assignment as a placement operation, the annealer was able to perform routing integrated during placement. In this formulation the grade of a placement was the weight of the minimum spanning trees (or alternatively steiner tree approximations) constructed over the current signal to wire assignment graph. A working implementation of this tool, Hephaestus, was finally tested against several designs with the goal of finding the best move set and cost metric combination while gauging the viability of such a tool. The author finds that the tool is capable of successful architecture adaptive placement. After placement, verification showed that designs placed by Hephaestus could be successfully routed. en_US
dc.format.mimetype application/pdf en_US
dc.language.iso en_US en_US
dc.subject Algorithms; Place and Route; Simulated Annealing; Software en_US
dc.subject.other Electrical engineering en_US
dc.subject.other Computer science en_US
dc.subject.other Engineering en_US
dc.title Hephaestus: Solving the Heterogeneous, Highly Constrained Analog Placement Problem en_US
dc.type Thesis en_US
dc.embargo.terms No embargo en_US


Files in this item

Files Size Format View
Price_washington_0250O_10227.pdf 2.172Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record