✦ LIBER ✦

Tree-turn routing: an efficient deadlock-free routing algorithm for irregular networks

✍ Scribed by Jiazheng Zhou; Yeh-Ching Chung

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 862 KB
Volume: 59
Category: Article
ISSN: 0920-8542
DOI: 10.1007/s11227-010-0477-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient hierarchical timing-driven

An efficient hierarchical timing-driven Steiner tree algorithm for global routing

✍ Jingyu Xu; Xianlong Hong; Tong Jing; Yici Cai; Jun Gu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 425 KB

In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as the goal. The algorithm uses heuristic approach to decompose the problem of minimum delay Steiner tree into hierarchy and

An efficient QoS routing algorithm for s

An efficient QoS routing algorithm for solving MCP in ad hoc networks

✍ Noureddine Kettaf; Hafid Abouaissa; Thang Vu duong; Pascal Lorenz 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 397 KB