✦ LIBER ✦

Three-dimensional place and route for FPGAs

✍ Scribed by Ababei, C.; Mogal, H.; Bazargan, K.

Book ID: 117907510
Publisher: IEEE
Year: 2006
Tongue: English
Weight: 387 KB
Volume: 25
Category: Article
ISSN: 0278-0070
DOI: 10.1109/tcad.2005.855945

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Universal switch blocks for three-dimens

Universal switch blocks for three-dimensional FPGA design

✍ Wu, G.-M.; Shyu, M.; Chang, Y.-W. 📂 Article 📅 2004 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 334 KB

Metaheuristics for vehicle routing probl

Metaheuristics for vehicle routing problems with three-dimensional loading constraints

✍ Guenther Fuellerer; Karl F. Doerner; Richard F. Hartl; Manuel Iori 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 392 KB

Performance-driven simultaneous placemen

Performance-driven simultaneous placement and routing for FPGA's

✍ Nag, S.K.; Rutenbar, R.A. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 617 KB

Highly adaptive and deadlock-free routin

Highly adaptive and deadlock-free routing for three-dimensional networks-on-chip

✍ Dahir, Nizar; Yakovlev, Alex; Al-Dujaily, Ra'ed; Mak, Terrence 📂 Article 📅 2013 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 675 KB

Fully adaptive routing algorithms and re

Fully adaptive routing algorithms and region-based approaches for two-dimensional and three-dimensional networks-on-chip

✍ Ebrahimi, Masoumeh 📂 Article 📅 2013 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 823 KB

A Lower Bound for Elementary Oblivious R

A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes

✍ Kazuo Iwama; Eiji Miyano 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 434 KB

This paper shows an important exception to the common perception that three-dimensional meshes are more powerful than two-dimensional ones. Let N be the total number of processors. Then permutation routing over three-dimensional mesh computers needs N 2/3 steps while it takes N 1/2 steps over twodim