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

Hiromitsu Imori

dblp:86/442 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

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

Systems, architecture and hardware · 2

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
Processor architecture and microarchitecture · 75% Memory systems · 25%

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

TopicWeightPapersLastEvidence papers
Memory systems
memory access latency
0.011992
Pseudo Vector Processor Based on Register-Windowed Superscalar Pipeline · SC 1992
Processor architecture and microarchitecture › register file
register window
0.011992
Pseudo Vector Processor Based on Register-Windowed Superscalar Pipeline · SC 1992
Processor architecture and microarchitecture › superscalar processor
superscalar pipeline
0.011992
Pseudo Vector Processor Based on Register-Windowed Superscalar Pipeline · SC 1992
Processor architecture and microarchitecture
vector processing
0.011992
Pseudo Vector Processor Based on Register-Windowed Superscalar Pipeline · SC 1992

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

performance evaluation · 0.0
YearPublicationVenuePosition
1993 A Scalar Architecture for Pseudo Vector Processing Based on Slide-Windowed Registers
abstract
In this paper, we present a new scalar architecture for high-speed vector processing. Without using cache memory, the proposed architecture tolerates main memory access latency by introducing slide-windowed floating-point registers with data preloading feature and pipelined memory. The architecture can hold upward compatibility with existing scalar architectures. In the new architecture, software can control the window structure. This is the advantage compared with our previous work of register-windows. Because of this advantage, registers are utilized more flexibly and computational efficiency is largely enhanced. Furthermore, this flexibility helps the compiler to generate efficient object codes easily.
Hiroshi Nakamura, Taisuke Boku, Hideo Wada, Hiromitsu Imori, Ikuo Nakata, Yasuhiro Inagami, Kisaburo Nakazawa, Yoshiyuki Yamashita
International Conference on Supercomputing4
1992 Pseudo Vector Processor Based on Register-Windowed Superscalar Pipeline
abstract
The authors present a novel architecture for a high-speed pseudo vector processor based on a superscalar pipeline. Without using cache memory, the proposed architecture is able to overcome the penalty of memory access latency by introducing register windows with register preloading and pipelined memory. One outstanding feature of the proposed architecture is that it is upwardly compatible with existing scalar architectures. Performance evaluation of the proposed architecture using the Livermore Loop Kernels shows over 6 times higher performance than a usual superscalar processor and 1.2 times higher performance than a hypothetical extended model with a cache prefetching technique with a memory access latency of 20 CPU clock cycles. List vectors are also effectively handled in a similar architecture.>
Kisaburo Nakazawa, Hiroshi Nakamura, Hiromitsu Imori, Shun Kawabe
SC3