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

Nathan T. Slingerland

dblp:22/4350 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2002
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-authorGraphics, 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 · 83% Performance modeling and evaluation · 17%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › instruction set architecture
instruction set extension
0.012002
Measuring the Performance of Multimedia Instruction Sets · IEEE Trans. Computers 2002
Processor architecture and microarchitecture › instruction set architecture › instruction set extension
multimedia instruction set
0.012002
Measuring the Performance of Multimedia Instruction Sets · IEEE Trans. Computers 2002
Processor architecture and microarchitecture › SIMD
SIMD instructions
0.012002
Measuring the Performance of Multimedia Instruction Sets · IEEE Trans. Computers 2002
Performance modeling and evaluation
benchmarking
0.012002
Measuring the Performance of Multimedia Instruction Sets · IEEE Trans. Computers 2002
Performance modeling and evaluation
workload characterization
0.012002
Measuring the Performance of Multimedia Instruction Sets · IEEE Trans. Computers 2002

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

performance comparison · 0.0kernel extraction · 0.0
YearPublicationVenuePosition
2002 Design and characterization of the Berkeley multimedia workload
Nathan T. Slingerland, Alan Jay Smith
Multim. Syst.1
2002 Measuring the Performance of Multimedia Instruction Sets
abstract
Many microprocessor instruction sets include instructions for accelerating multimedia applications such as DVD playback, speech recognition, and 3D graphics. Despite general agreement on the need to support this emerging workload, there are considerable differences between the instruction sets that have been designed to do so. In this paper, we study the performance of five instruction sets on kernels extracted from a broad multimedia workload. We compare the performance of contemporary implementations of each extension against each other as well as to the original compiled C performance. From our analysis, we determine how well multimedia workloads map to current instruction sets, noting what was useful and what was not. We also propose two enhancements: fat subwords and strided memory operations.
Nathan T. Slingerland, Alan Jay Smith
IEEE Trans. Computers1
2001 Cache performance for multimedia applications
abstract
The caching behavior of multimedia applications has been described as having high instruction reference locality within small loops, very large working sets, and poor data cache performance due to non-locality of data references. Despite this, there is no published research deriving or measuring these qualities. Utilizing the previously developed Berkeley Multimedia Workload, we present the results of execution driven cache simulations with the goal of aiding future media processing architecture design. Our analysis examines the differences between multimedia and traditional applications in cache behavior. We find that multimedia applications actually exhibit lower instruction miss ratios and comparable data miss ratios when contrasted with other widely studied workloads. In addition, we find that longer data cache line sizes than are currently used would benefit multimedia processing.
Nathan T. Slingerland, Alan Jay Smith
ICS1