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

Byung-Kwon Chung

dblp:03/6489 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2001
—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
Memory systems · 65% Processor architecture and microarchitecture · 35%

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

TopicWeightPapersLastEvidence papers
Memory systems
cache
0.012001
Direct load: dependence-linked dataflow resolution of load address and cache coordinate · MICRO 2001
Memory systems › memory access latency
cache access latency
0.012001
Direct load: dependence-linked dataflow resolution of load address and cache coordinate · MICRO 2001
Memory systems › memory access latency
load latency
0.012001
Direct load: dependence-linked dataflow resolution of load address and cache coordinate · MICRO 2001
Processor architecture and microarchitecture
out-of-order execution
0.012001
Direct load: dependence-linked dataflow resolution of load address and cache coordinate · MICRO 2001
Processor architecture and microarchitecture
instruction-level parallelism
0.012001
Direct load: dependence-linked dataflow resolution of load address and cache coordinate · MICRO 2001
Processor architecture and microarchitecture › special-purpose processor › application-specific processor design
instruction path coprocessor
0.012001
Direct load: dependence-linked dataflow resolution of load address and cache coordinate · MICRO 2001

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

stride-based prediction · 0.0simplescalar · 0.0dependence-linked dataflow · 0.0
YearPublicationVenuePosition
2001 Direct load: dependence-linked dataflow resolution of load address and cache coordinate
abstract
An increasing cache latency in future processors incurs profound performance impacts in spite of advanced out-of-order execution techniques. In this paper, we describe an early address resolution mechanism that accurately resolves both regular and irregular load addresses. The basic idea is to build dynamic dependence links from the instruction that updates the base register to the consumer load instructions. Once a new base address is available, it triggers calculations of the new load addresses for dependent loads. Furthermore, the exact cache location of the requested data is predicted based on the newly resolved load address. As a result, this direct load can access the data cache directly to achieve a zero-cycle load latency. Performance evaluation using SPEC integer programs shows that the dynamic dependence links can be established accurately. Combined with a stride-based predictor, the proposed early address resolution achieves about 97% average accuracy with less than 1% misprediction. Based on a modified SimpleScalar model, the proposed method can potentially improve the IPC by about 18%.
Byung-Kwon Chung, Jinsuo Zhang, Jih-Kwon Peir, Shih-Chang Lai, Konrad Lai
MICRO1