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

Joonmoo Huh

dblp:165/2312 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2017
—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.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › vectorization
superword level parallelism
0.312017
Improving the effectiveness of searching for isomorphic chains in superword level parallelism · MICRO 2017
Compilers and program optimization
vectorization
0.312017
Improving the effectiveness of searching for isomorphic chains in superword level parallelism · MICRO 2017
Processor architecture and microarchitecture
SIMD
0.112017
Improving the effectiveness of searching for isomorphic chains in superword level parallelism · MICRO 2017

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

isomorphic instruction grouping · 0.6SLP algorithm · 0.6
YearPublicationVenuePosition
2017 Improving the effectiveness of searching for isomorphic chains in superword level parallelism
abstract
Most high-performance microprocessors come equipped with general-purpose Single Instruction Multiple Data (SIMD) execution engines to enhance performance. Compilers use auto-vectorization techniques to identify vector parallelism and generate SIMD code so that applications can enjoy the performance benefits provided by SIMD units. Superword Level Parallelism (SLP), one such vectorization technique, forms vector operations by merging isomorphic instructions into a vector operation and linking many such operations into long isomorphic chains. However, effective grouping of isomorphic instructions remains a key challenge for SLP algorithms.
Joonmoo Huh, James Tuck 0001
MICRO1