In-Memory Computing with TCAM for Packet Identification in the Buffer of Routing Switches

Author(s):  
Xiao Zhang ◽  
Zenan Huang ◽  
Honyin Luo ◽  
Zhixin Zhou ◽  
Zhong Ma ◽  
...  
Keyword(s):  
2018 ◽  
Vol 6 (5) ◽  
pp. 380 ◽  
Author(s):  
Zepeng Pan ◽  
Songnian Fu ◽  
Luluzi Lu ◽  
Dongyu Li ◽  
Weijie Chang ◽  
...  

2014 ◽  
Vol 556-562 ◽  
pp. 5609-5613
Author(s):  
Hsin Chou Chi ◽  
Hsi Che Tseng ◽  
Han Shien Weng

The mesh network is an important topology for on-chip networks since it provides great flexibility for the on-chip interconnection with diverse application requirements. We have proposed the tree-based routing architecture for on-chip networks called TRAIN, which achieves deadlock freedom and high-performance communication for on-chip networks. With TRAIN, a packet arriving in a switch can be adaptively routed to utilize a shortcut to reduce the distance to the destination switch efficiently. In this paper, we propose two arbitration schemes in a TRAIN switch and their arbiter designs: the sequential arbiter and the shortcut-first arbiter. The experimental results show that the shortcut-first arbiter achieves better performance than the sequential arbiter, while the former costs larger chip area. With the network size grows, the performance advantage is more pronounced for the shortcut-first arbiter.


Author(s):  
M. Rodelgo-Lacruz ◽  
C. Lopez-Bravo ◽  
F. J. Gonzalez-Castano ◽  
H. J. Chao

2021 ◽  
Author(s):  
Nafiul Hyder

This work investigates the minimum layout area of multiplexers, a fundamental building block of Field-Programmable Gate Arrays (FPGAs). In particular, we investigate the minimum layout area of 4:1 multiplexers, which are the building blocks of 2-input Look-Up Tables (LUTs) and can be recursively used to build higher order LUTs and multiplexer-based routing switches. We observe that previous work routes all four data inputs of 4:1 multiplexers on a single metal layer resulting in a wiring-area-dominated layout. In this work, we explore the various transistor-level placement options for implementing the 4:1 multiplexers while routing multiplexer data inputs through multiple metal layers in order to reduce wiring area. Feasible placement options with their corresponding data input distributions are then routed using an automated maze router and the routing results are then further manually refined. Through this systematic approach, we identified three 4:1 multiplexer layouts that are smaller than the previously proposed layouts by 30% to 35%. In particular, two larger layouts of the three are only 33% to 45% larger than layout area predicted by the two widely used active area models from previous FPGA architectural studies, and the smallest of the three layouts is 1% to 11% larger than the layout area predicted by these models.


Sign in / Sign up

Export Citation Format

Share Document