Efficient Tree Topology for FPGA Interconnect Network - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Efficient Tree Topology for FPGA Interconnect Network

Résumé

This paper presents an improved Tree-based architecture that unifies two unidirectional programmable networks: A predictible downward network based on the Butter y-Fat-Tree topology, and an upward network using hierarchy. Studies based on Rent's Rule show that switch requirements in this architecture grow slower than in traditional Mesh topologies. New tools are developed to place and route several benchmark circuits on this architecture. Experimental results show that the Tree-based architecture can implement MCNC benchmark circuits with an average gain of 54% in total area compared with Mesh architecture.
Fichier non déposé

Dates et versions

hal-01301523 , version 1 (12-04-2016)

Identifiants

Citer

Zied Marrakchi, Hayder Mrabet, Emna Amouri, Habib Mehrez. Efficient Tree Topology for FPGA Interconnect Network. GLSVLSI ACM Great Lakes Symposium on VLSI, May 2008, Orlando, Florida, United States. pp.321-326, ⟨10.1145/1366110.1366186⟩. ⟨hal-01301523⟩
31 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More