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

William L. Lynch

dblp:82/5454 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · unresolved

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

Systems, architecture and hardware · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 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
2 papers
Memory systems · 65% Processor architecture and microarchitecture · 35%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems › memory access latency
cache access latency
0.011998
Low Load Latency Through Sum-Addressed Memory (SAM) · ISCA 1998
Memory systems
cache
0.011992
The effect of page allocation on caches · MICRO 1992
Memory systems › memory management › memory allocation
page allocation
0.011992
The effect of page allocation on caches · MICRO 1992
Operating systems › resource management
memory management
0.011992
The effect of page allocation on caches · MICRO 1992
Operating systems › resource management › memory management
page allocation
0.011992
The effect of page allocation on caches · MICRO 1992

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

sum-prediction · 0.0bitwise indexing · 0.0
YearPublicationVenuePosition
1998 Low Load Latency Through Sum-Addressed Memory (SAM)
abstract
Load latency contributes significantly to execution time. Because most cache accesses hit, cache-hit latency becomes an important component of expected load latency. Most modern microprocessors have base+offset addressing loads; thus effective cache-hit latency includes an addition as well as the RAM access. This paper introduces a new technique used in the UltraSPARC III microprocessor Sum-Addressed Memory (SAM), which performs true addition using the decoder of the RAM array, with very low latency. We compare SAM with other methods for reducing the add part of load latency. These methods include sum-prediction with recovery, and bitwise indexing with duplicate-tolerance. The results demonstrate the superior performance of SAM.
William L. Lynch, Gary Lauterbach, Joseph I. Chamdani
ISCA1
1992 The effect of page allocation on caches
William L. Lynch, Brian K. Bray, Michael J. Flynn
MICRO1