Thesis Topic Details
Topic ID: |
2967 | |
Title: |
Acceleration of Negotiation-Based Circuit Routing | |
Supervisor: |
Aleksandar Ignjatovic | |
Research Area: |
Algorithms | |
| Associated Staff | ||
|---|---|---|
Assessor: |
Sri Parameswaran | |
| Topic Details | ||
Status: |
Active | |
Type: |
R & D | |
Programs: |
CS CE SE | |
Group Suitable: |
Yes | |
Industrial: |
No | |
Pre-requisites: |
Good C Programming Skills | |
Description: |
Negotiation-based circuit routing is prevalent in industrial and academic circuit routers both in standard cell ASIC and field-programmable gate array (FPGA) routing problems. The long runtimes of these routers are often pain points for circuit designers. In our previous work, we have shown that the congestion can be costed independent of other design constraints and it is sufficient that the cost is defined over the simpler monoid algebra rather than the more rigorous field algebra. This project consists of the design and implementation alternative monoid definitions (other than regular addition) and related resource costing schemes to accelerate convergence of the negotiation heuristic improving runtimes and quality-of-results. The implementation platform is VPR 5 from the University of Toronto, so C programming skills are a prerequisite. You will be involved in implementing the new routers to the newly released platform, experimentation on the state AC3 computing clusters as well as the standard thesis requirements, while ideally acquiring some software engineering and research skills along the way. The scope of the project can be varied based on the number of group members. |
|
Comments: |
Good communication skills over email are essential, as some of the expertise is offsite. See also: http://www.cse.unsw.edu.au/~keiths/papers/p24-so.pdf http://www.cse.unsw.edu.au/~keiths/papers/p151-so.pdf http://www.eecg.utoronto.ca/vpr/ - downloadable software suite |
|
| Past Student Reports | ||
| No Reports Available. Contact the supervisor for more information.
Check out all available reports in the CSE Thesis Report Library. NOTE: only current CSE students can login to view and select reports to download. |
||