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,...
| 第一著者: | |
|---|---|
| フォーマット: | 学位論文 |
| 言語: | 英語 |
| 出版事項: |
2007
|
| 主題: | |
| オンライン・アクセス: | http://eprints.utm.my/6381/1/ChNgHengSunMFKE2007.pdf |