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.

Mark J. Charney

dblp:07/5522 · DBLP profile ↗
← Back
2ranked-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 · 1Graphics, computer vision, multimedia, augmented reality and games · 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
Processor architecture and microarchitecture · 54% Memory systems · 46%

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

TopicWeightPapersLastEvidence papers
Memory systems
cache management
0.012001
Branch History Guided Instruction Prefetching · HPCA 2001
Memory systems › cache management › instruction cache management
instruction cache miss reduction
0.012001
Branch History Guided Instruction Prefetching · HPCA 2001
Processor architecture and microarchitecture › instruction fetch
instruction prefetching
0.012001
Branch History Guided Instruction Prefetching · HPCA 2001
Processor architecture and microarchitecture › front-end
instruction supply
0.012001
Branch History Guided Instruction Prefetching · HPCA 2001
Processor architecture and microarchitecture
pipelining
0.012001
Branch History Guided Instruction Prefetching · HPCA 2001

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

branch history correlation · 0.0
YearPublicationVenuePosition
2001 Branch History Guided Instruction Prefetching
abstract
Instruction cache misses stall the fetch stage of the processor pipeline and hence affect instruction supply to the processor. Instruction prefetching has been proposed as a mechanism to reduce instruction cache (I-cache) misses. However, a prefetch is effective only if accurate and initiated sufficiently early to cover the miss penalty. This paper presents a new hardware-based instruction prefetching mechanism, Branch History Guided Prefetching (BHGP), to improve the timeliness of instruction prefetches. BHGP correlates the execution of a branch instruction with I-cache misses and uses branch instructions to trigger prefetches of instructions that occur (N-1) branches later in the program execution, for a given N>1. Evaluations on commercial applications, windows-NT applications, and some CPU2000 applications show an average reduction of 66% in miss rate over all applications. BHGP improved the IPC bp 12 to 14% for the CPU2000 applications studied; on average 80% of the BHGP prefetches arrived in cache before their next use, even on a 4-wide issue machine with a 15 cycle L2 access penalty.
Vijayalakshmi Srinivasan, Edward S. Davidson, Gary S. Tyson, Mark J. Charney, Thomas R. Puzak
HPCA4
1990 Efficient traversal of well-behaved hierarchical trees of extents for ray-tracing complex scenes
Mark J. Charney, Isaac D. Scherson
Vis. Comput.1