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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Dingju Chen

dblp:13/5791 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1990
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-author

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 · 50% Memory systems · 50%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems
memory hierarchy		 0.011990
Hierarchical blocking and data flow analysis for numerical linear algebra · SC 1990
Program analysis
data flow analysis		 0.011990
Hierarchical blocking and data flow analysis for numerical linear algebra · SC 1990

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

hierarchical blocking · 0.0dataflow analysis · 0.0data flow analysis · 0.0
YearPublicationVenuePosition
1990 Hierarchical blocking and data flow analysis for numerical linear algebra
abstract
The optimization of BLAS2 and BLAS3 for linear algebra on computers with hierarchical memory systems is discussed. A novel blocking strategy called hierarchical blocking and data-flow analysis is proposed, and its applications are given. Numerical results on IBM RISC System/6000 Model 530 are given. It is shown that data flow direction and leading dimensions are crucial factors in optimizing linear algebra programs. Since the proposed method follows the data flow of a program, it can reveal the effect of pipelining between data loading units and computational units.>
Dingju Chen
 SC1