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

Hiromu Nobayashi

dblp:125/2392 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1989
—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.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
vectorization		 0.011989
A comparison study of automatically vectorizing Fortran compilers · SC 1989
Processor architecture and microarchitecture
vector processing		 0.011989
A comparison study of automatically vectorizing Fortran compilers · SC 1989

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

loop analysis · 0.0compiler comparison · 0.0
YearPublicationVenuePosition
1989 A comparison study of automatically vectorizing Fortran compilers
abstract
The performance of current vector processing supercomputers is highly dependent on the capabilities of their automatically vectorizing Fortran compilers to generate efficient vector code. In this paper we shall focus on the performance of these compilers, and attempt to compare their efficiency on different types of Fortran loop constructs. Our analysis will involve a short analysis of previous compiler comparison studies and we will introduce a new technique for evaluating and comparing compiler performance.
Hiromu Nobayashi, Christopher Eoyang
 SC1