New Kids on the Unblocking: Strategies to Overcome Blocking Networks-Reference-Cited by-同舟云学术

New Kids on the Unblocking: Strategies to Overcome Blocking Networks

Published:2023-10-17 Issue: Volume: Page:1-12
ISSN:
Container-title:Anais do XXIV Simpósio em Sistemas Computacionais de Alto Desempenho (SSCAD 2023)
language:
Short-container-title:

Author:

Morais Caio Von Rondow,Penha Jeronimo,Nacif José A.,Ferreira Ricardo

Abstract

Full-crossbar interconnections offer high parallel bandwidth, simple routing, and performance. However, their cost is prohibitive. Multistage networks have emerged as a cost-effective alternative, reducing the cost to O(n log(n)). This study addresses the challenges posed by large networks with 256 connections, where the configuration space expands exponentially. We present an approach that efficiently handles routing by reducing the extra stages. We reduce network cost by a factor of 2×. Our approach enables graph routing with up to 214 operators within the 256-connection multistage network, doubling performance compared to previous multistage CGRA frameworks.

Publisher

Sociedade Brasileira de Computação

Reference16 articles.

1. Carvalho, W., Canesche, M., , Silva, L., Nacif, J., and Ferreira, R. (2020). A design exploration of scalable mesh-based fully pipelined accelerators. In IEEE ICFPT.

2. Choi, Y.-k., Chi, Y., Qiao, W., Samardzic, N., and Cong, J. (2021). Hbm connect: High-performance hls interconnect for fpga hbm. In ACM FPGA.

3. Ferreira, R., Vendramini, J., Pereira, M. M., and Carro, L. (2011). An fpga-based heterogeneous coarse-grained dynamically reconfigurable architecture. In Int conference on Compilers, architectures and synthesis for embedded systems CASES.

4. Gazit, I. and Malek, M. (1989). On the number of permutations performable by extra-stage multistage interconnection networks. IEEE trans on computers, 38(2).

5. Hu, Q., Shen, X., and Liang, W. (1996). Optimally routing lc permutations on k-extra-stage cube-type networks. IEEE transactions on computers, 45(1):97–103.