Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tianchu Ji

dblp:223/4152 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0002-1976-7469ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 44% Hardware accelerators and domain-specific architectures · 44% Reconfigurable computing and FPGAs · 13%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
attention mechanism
1.012026
Enabling Efficient SpMM for Sparse Attention on GEMM-Optimized Hardware with Block Aggregation · FPGA 2026
Machine learning › Deep learning architectures and training › attention mechanism
sparse attention
1.012026
Enabling Efficient SpMM for Sparse Attention on GEMM-Optimized Hardware with Block Aggregation · FPGA 2026
High-performance computing › sparse linear algebra
sparse matrix multiplication
1.012026
Enabling Efficient SpMM for Sparse Attention on GEMM-Optimized Hardware with Block Aggregation · FPGA 2026
Hardware accelerators and domain-specific architectures
sparse matrix multiplication accelerator
1.012026
Enabling Efficient SpMM for Sparse Attention on GEMM-Optimized Hardware with Block Aggregation · FPGA 2026

Methods — techniques the papers use, named apart from their topics

dynamic data path configuration · 2.0block aggregation · 2.0
YearPublicationVenuePosition
2026 Enabling Efficient SpMM for Sparse Attention on GEMM-Optimized Hardware with Block Aggregation
abstract
Rapidly growing context lengths have amplified the inherent sparsity in the attention mechanism of popular Large Language Models. However, the dynamic data access patterns required by sparse attention are challenging to realize using static data paths, leading to execution inefficiency. Existing SpMM hardware acceleration techniques address these inefficiencies by dynamically configuring data paths to align with the unstructured data access patterns of sparse attention. However, these approaches are not applicable to GEMM-optimized hardware, where dynamic data paths would introduce unacceptable hardware complexity and frequency degradation.
Tianchu Ji, Niranjan Balasubramanian, Michael Ferdman, Peter A. Milder
FPGA1
2023 Efficient Methods for Natural Language Processing: A Survey
abstract
Abstract Recent work in natural language processing (NLP) has yielded appealing results from scaling model parameters and training data; however, using only scale to improve performance means that resource consumption also grows. Such resources include data, time, storage, or energy, all of which are naturally limited and unevenly distributed. This motivates research into efficient methods that require fewer resources to achieve similar results. This survey synthesizes and relates current methods and findings in efficient NLP. We aim to provide both guidance for conducting NLP under limited resources, and point towards promising research directions for developing more efficient methods.
Marcos V. Treviso, Ji-Ung Lee, Tianchu Ji, Betty van Aken, Manuel R. Ciosici, Michael Hassid, Kenneth Heafield, Sara Hooker, Colin Raffel, Pedro Henrique Martins, André F. T. Martins, Jessica Zosa Forde, Peter A. Milder, Edwin Simpson, Noam Slonim, Jesse Dodge, Emma Strubell, Niranjan Balasubramanian, Leon Derczynski, Iryna Gurevych, Roy Schwartz 0001
Trans. Assoc. Comput. Linguistics3
2018 Medusa: A Scalable Interconnect for Many-Port DNN Accelerators and Wide DRAM Controller Interfaces
abstract
To cope with the increasing demand and computational intensity of deep neural networks (DNNs), industry and academia have turned to accelerator technologies. In particular, FPGAs have been shown to provide a good balance between performance and energy efficiency for accelerating DNNs. While significant research has focused on how to build efficient layer processors, the computational building blocks of DNN accelerators, relatively little attention has been paid to the on-chip interconnects that sit between the layer processors and the FPGA's DRAM controller. We observe a disparity between DNN accelerator interfaces, which tend to comprise many narrow ports, and FPGA DRAM controller interfaces, which tend to be wide buses. This mismatch causes traditional interconnects to consume significant FPGA resources. To address this problem, we designed Medusa: an optimized FPGA memory interconnect which transposes data in the interconnect fabric, tailoring the interconnect to the needs of DNN layer processors. Compared to a traditional FPGA interconnect, our design can reduce LUT and FF use by 4.7x and 6.0x, and improves frequency by 1.8x.
Yongming Shen 0001, Tianchu Ji, Michael Ferdman, Peter A. Milder
FPL2