Efficient Mesh of Tree Interconnect for FPGA Architecture

Abstract : In this paper we present a new mesh of tree FPGA architecture, where clusters are surrounded by a mesh style interconnect and each cluster local interconnect is equivalent to a depopulated tree-based topology. The particularity of the architecture allows to retain the distinction between mesh and tree levels in the mapping phase. This has an important impact on run time saving and tool simplification. Nevertheless an efficient interconnect distribution must be found between both levels, to reach a tradeoff between interconnect reduction and routability. With the proposed Mesh of Tree architecture, we divided the required run time by 3 and reduced the routing interconnect by 24%, compared to the clustered VPR-style mesh architecture.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01305972
Contributor : Lip6 Publications <>
Submitted on : Friday, April 22, 2016 - 10:10:48 AM
Last modification on : Thursday, March 21, 2019 - 1:19:20 PM

Identifiers

Citation

Zied Marrakchi, Hayder Mrabet, Christian Masson, Habib Mehrez. Efficient Mesh of Tree Interconnect for FPGA Architecture. ICFPT International Conference on Field-Programmable Technology, Dec 2007, Kitakyushu, Japan. pp.269-272, ⟨10.1109/FPT.2007.4439263⟩. ⟨hal-01305972⟩

Share

Metrics

Record views

212