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:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English |
| 出版: |
2007
|
| 主题: | |
| 在线阅读: | http://eprints.utm.my/id/eprint/6381/1/ChNgHengSunMFKE2007.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|