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:
主要作者: | Ch'ng, Heng Sun |
---|---|
格式: | Thesis |
語言: | English |
出版: |
2007
|
主題: | |
在線閱讀: | http://eprints.utm.my/id/eprint/6381/1/ChNgHengSunMFKE2007.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Interconnect tree optimization algorithm in nanometer very large scale integration designs
由: Eh Kan, Chessda Uttraphan
出版: (2016) -
Interconnect delay and routing in nanometer VLSI
由: Kuay, Chong Lee
出版: (2008) -
VHDL modelling and asic design of a shortest-path processor core for network routing
由: Teoh, Giap Seng
出版: (2003) -
Traffic Balancing Method in Shortest Path Routing
由: Mohamed Abdulqader, Makarem
出版: (2007) -
Shortest Path Routing Using Heuristic Search
由: Alaiwan, Ahmed Omran A.
出版: (2006)