Boma Anantasatya Adhi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Boma Anantasatya Adhi has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Kentaro Sano
RIKEN Center for Computational Science, Kobe, Hyogo, Japan
4 shared publications - Jason H. Anderson
University of Toronto, Toronto, Canada
3 shared publications - Chenlin Shi
RIKEN Center for Computational Science, Kobe, Hyogo, Japan and The University of Electro-Communications, Chofu, Tokyo, Japan
2 shared publications - Carlos Cortes
RIKEN, Japan
1 shared publication - Emanuele Del Sozzo
Massachusetts Institute of Technology, Cambridge, USA
1 shared publication - Jiaheng Liu
RIKEN Center for Computational Science, Kobe, Hyogo, Japan
1 shared publication
Latest Publications
- Open Access
- 17 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 77-85
Hardware Sharing for Area Optimization of Floating-Point ALUs
- 17 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 77-85
Open AccessHardware Sharing for Area Optimization of Floating-Point ALUs
- Open Access
- 25 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 102-111
Towards Unified Acceleration: Weight-Stationary GEMM on HPC-oriented Elastic CGRAs
- 25 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 102-111
Open AccessTowards Unified Acceleration: Weight-Stationary GEMM on HPC-oriented Elastic CGRAs
- Open Access
- 25 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 76-79
Impact of Reconvergent DFG Paths and Buffer Depth on Elastic CGRA Throughput
- 25 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 76-79
Open AccessImpact of Reconvergent DFG Paths and Buffer Depth on Elastic CGRA Throughput
- Open Access
- 14 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 59-68
Exploration of Compute vs. Interconnect Tradeoffs in CGRAs for HPC
We consider the balance between compute density and interconnect in Coarse-Grained Reconfigurable Architectures (CGRAs) intended for acceleration of HPC applications. We model a baseline CGRA architecture [2] in the open-source CGRA-ME framework [11] and describe the modelling as a case study. Then, holding the interconnect fabric constant, we create several variants of the baseline CGRA: 1) one having reduced (sparser) compute capability where not all ALUs are fully capable, 2) one having increased (denser) compute capability, where the amount of compute is roughly doubled relative to the baseline, and 3) one with increased I/O bandwidth. In an experimental study, we evaluate all architectures to assess application mappability and resource usage for a set of benchmark applications. We also evaluate silicon area consumption using a standard-cell ASIC flow. Results show the baseline CGRA to be overprovisioned in both compute and interconnect, with the proposed variants offering superior area efficiency.
- 14 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 59-68
Open AccessExploration of Compute vs. Interconnect Tradeoffs in CGRAs for HPC
We consider the balance between compute density and interconnect in Coarse-Grained Reconfigurable Architectures (CGRAs) intended for acceleration of HPC applications. We model a baseline CGRA architecture [2] in the open-source CGRA-ME framework [11] and describe the modelling as a case study. Then, holding the interconnect fabric constant, we create several variants of the baseline CGRA: 1) one having reduced (sparser) compute capability where not all ALUs are fully capable, 2) one having increased (denser) compute capability, where the amount of compute is roughly doubled relative to the baseline, and 3) one with increased I/O bandwidth. In an experimental study, we evaluate all architectures to assess application mappability and resource usage for a set of benchmark applications. We also evaluate silicon area consumption using a standard-cell ASIC flow. Results show the baseline CGRA to be overprovisioned in both compute and interconnect, with the proposed variants offering superior area efficiency.
- 13 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 34 (5) , 1621-1634
Experimental Survey of FPGA-Based Monolithic Switches and a Novel Queue Balancer
This article studies small to medium-sized monolithic switches for FPGA implementation and presents a novel switch design that achieves high algorithmic performance and FPGA implementation efficiency. Crossbar switches based on virtual output queues (VOQs) and variations have been rather popular for implementing switches on FPGAs, with applications in network switches, memory interconnects, network-on-chip (NoC) routers etc. The implementation efficiency of crossbar-based switches is well-documented on ASICs, though we show that their disadvantages can outweigh their advantages on FPGAs. One of the most important challenges in such input-queued switches is the requirement for iterative scheduling algorithms. In contrast to ASICs, this is more harmful on FPGAs, as the reduced operating frequency and narrower packets cannot “hide” multiple iterations of scheduling that are required to achieve a modest scheduling performance. Our proposed design uses an output-queued switch internally for simplifying scheduling, and a queue balancing technique to avoid queue fragmentation and reduce the need for memory-sharing VOQs. Its implementation approaches the scheduling performance of a state-of-the-art FPGA-based switch, while requiring considerably fewer resources.
- 13 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 34 (5) , 1621-1634
Experimental Survey of FPGA-Based Monolithic Switches and a Novel Queue Balancer
This article studies small to medium-sized monolithic switches for FPGA implementation and presents a novel switch design that achieves high algorithmic performance and FPGA implementation efficiency. Crossbar switches based on virtual output queues (VOQs) and variations have been rather popular for implementing switches on FPGAs, with applications in network switches, memory interconnects, network-on-chip (NoC) routers etc. The implementation efficiency of crossbar-based switches is well-documented on ASICs, though we show that their disadvantages can outweigh their advantages on FPGAs. One of the most important challenges in such input-queued switches is the requirement for iterative scheduling algorithms. In contrast to ASICs, this is more harmful on FPGAs, as the reduced operating frequency and narrower packets cannot “hide” multiple iterations of scheduling that are required to achieve a modest scheduling performance. Our proposed design uses an output-queued switch internally for simplifying scheduling, and a queue balancing technique to avoid queue fragmentation and reduce the need for memory-sharing VOQs. Its implementation approaches the scheduling performance of a state-of-the-art FPGA-based switch, while requiring considerably fewer resources.