✦ LIBER ✦

Timing-driven routing for FPGAs based on Lagrangian relaxation

✍ Scribed by Seokjin Lee; Wong, M.D.F.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Timing-driven partitioning-based placeme

✍ Maidee, P.; Ababei, C.; Bazargan, K. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 671 KB

A Lagrangian relaxation-based heuristic

✍ Akio Imai; Etsuko Nishimura; John Current 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Switch bound allocation for maximizing r

✍ Kai Zhu; Wong, D.F. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 308 KB

On optimal board-level routing for FPGA-

✍ Wai-Kei Mak; Wong, D.F. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 260 KB

Performance-driven event-based synchroni

✍ Young-Su Kwon; Chong-Min Kyung 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 856 KB

Decomposition algorithms for data placem

✍ Drwal, Maciej; Jozefczyk, Jerzy 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 629 KB