Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
Graphs are pervasive data structures in computer science, and algorithms working with them are fundamental to the field. Many challenging problems in Very Large-Scale Integration (VLSI) physical design automation are modeled using graphs. The routing problems in VLSI physical design are, in essence,...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/6381/1/ChNgHengSunMFKE2007.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!