Da Won Kim

dblp:340/1383 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0002-9262-0674ORCID · reported

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

Systems, architecture and hardware · 1 · 1 since 2021

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 · 50% Hardware accelerators and domain-specific architectures · 38% Memory systems · 12%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
edge accelerator
0.812024
VVIP: Versatile Vertical Indexing Processor for Edge Computing · DAC 2024
Processor architecture and microarchitecture
SIMD
0.812024
VVIP: Versatile Vertical Indexing Processor for Edge Computing · DAC 2024
Memory systems
lookup table
0.212024
VVIP: Versatile Vertical Indexing Processor for Edge Computing · DAC 2024
Processor architecture and microarchitecture
register file
0.212024
VVIP: Versatile Vertical Indexing Processor for Edge Computing · DAC 2024

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

multibit-serial multiplication · 0.8
YearPublicationVenuePosition
2024 VVIP: Versatile Vertical Indexing Processor for Edge Computing
abstract
This paper presents a versatile vertical indexing processor (VVIP) based on a single-instruction multiple-data architecture for edge computing. In VVIP, the vertical source and destination indexing instructions are customized for area-efficient computations. The proposed indexing method reorders data within a processing module by using more registers and data-steering logic in the calculations. In particular, VVIP supports multibit-serial multiplication and sparse data operations by leveraging register files as lookup tables or accumulators. The VVIP, verified on a vector processor, has an area overhead of less than 2.8%. It exhibits an average computation rate that is 10.1 times faster than the 1-bit-serial multiplication in linear algebra benchmarks, and 1.2 times average performance improvement in unstructured sparse point-wise convolution tasks when compared to conventional control sequences.
Hyungjoon Bae 0001, Da Won Kim, Wanyeong Jung
DAC2