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

Seokmin Lee

dblp:298/8857 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0001-6642-2677ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Software engineering, systems software and programming languages · 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
2 papers
Memory systems · 69% Hardware accelerators and domain-specific architectures · 31%
Network and information security
1 paper
Hardware security and side channels · 100%

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

TopicWeightPapersLastEvidence papers
Hardware security and side channels
side-channel attack
0.712023
DevIOus: Device-Driven Side-Channel Attacks on the IOMMU · SP 2023
Hardware security and side channels › side-channel attack
timing side channel
0.712023
DevIOus: Device-Driven Side-Channel Attacks on the IOMMU · SP 2023
Memory systems
hybrid memory
0.512021
SPACE: Locality-Aware Processing in Heterogeneous Memory for Personalized Recommendations · ISCA 2021
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.512021
SPACE: Locality-Aware Processing in Heterogeneous Memory for Personalized Recommendations · ISCA 2021
Memory systems
memory architecture
0.512021
SPACE: Locality-Aware Processing in Heterogeneous Memory for Personalized Recommendations · ISCA 2021
Memory systems › processing-in-memory
near-memory processing
0.512021
SPACE: Locality-Aware Processing in Heterogeneous Memory for Personalized Recommendations · ISCA 2021
Memory systems
processing-in-memory
0.512021
SPACE: Locality-Aware Processing in Heterogeneous Memory for Personalized Recommendations · ISCA 2021
Hardware accelerators and domain-specific architectures › machine learning accelerator
recommendation model accelerator
0.512021
SPACE: Locality-Aware Processing in Heterogeneous Memory for Personalized Recommendations · ISCA 2021
Hardware security and side channels › trusted execution environments
hardware isolation
0.212023
DevIOus: Device-Driven Side-Channel Attacks on the IOMMU · SP 2023
Hardware security and side channels
trusted execution environments
0.212023
DevIOus: Device-Driven Side-Channel Attacks on the IOMMU · SP 2023
Memory systems › memory management › virtual memory
address translation
0.212023
DevIOus: Device-Driven Side-Channel Attacks on the IOMMU · SP 2023

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

timing analysis · 1.3reverse engineering · 1.3DMA · 1.3
YearPublicationVenuePosition
2023 DevIOus: Device-Driven Side-Channel Attacks on the IOMMU
abstract
Modern computer systems take advantage of Input/Output Memory Management Unit (IOMMU) to protect memory from DMA attacks, or to achieve strong isolation in virtualization. Despite its promising benefits, the IOMMU could be a new source of security threats. Like the MMU, the IOMMU also has Translation Lookaside Buffer (TLB) named IOTLB, an address translation cache that keeps the recent translations. Accordingly, the IOTLB can be a target of a timing side-channel attack, revealing victim’s secret. In this paper, we present DevIOus, a novel device-driven side-channel attack exploiting the IOTLB. DevIOus employs DMA-capable PCIe devices, such as GPU and RDMA-enabled NIC (RNIC), to deliver the attack. Thus, our attack has no influence on CPU caches or TLB in a victim’s machine. Implementing DevIOus is not trivial as microarchitectural internals of the IOTLB of Intel processors are hidden. We overcome this by reverse-engineering the IOTLB and disclose its hidden architectural properties. Based on this, we construct two IOTLB-based timing attack primitives using a GPU and an RNIC. Then, we demonstrate practical attacks that target co-located VMs under hardware-assisted isolation, and remote machines connected over the RDMA network. We also discuss possible mitigations against the proposed side-channel attack.
Hyeongjin Park, Seokmin Lee, Seunghee Shin, Junbeom Hur, Young-joo Shin
SP3
2021 SPACE: Locality-Aware Processing in Heterogeneous Memory for Personalized Recommendations
abstract
Personalized recommendation systems have become a major AI application in modern data centers. The main challenges in processing personalized recommendation inferences are the large memory footprint and high bandwidth requirement of embedding layers. To overcome the capacity limit and bandwidth congestion of on-chip memory, near memory processing (NMP) can be a promising solution. Recent work on accelerating personalized recommendations proposes a DIMMbased NMP design to solve the bandwidth problem and increases memory capacity. The performance of NMP is determined by the internal bandwidth and the prior DIMM-based approach utilizes more DIMMs to achieve higher operation throughput. However, extending the number of DIMMs could eventually lead to significant power consumption due to inefficient scaling. We propose SPACE, a novel heterogeneous memory architecture, which is efficient in terms of performance and energy. SPACE exploits a compute-capable 3D-stacked DRAM with DIMMs for personalized recommendations. Prior to designing the proposed system, we give a quantitative analysis of the user/item interactions and define the two localities: gather locality and reduction locality. In gather operations, we find only a small proportion of items are highly-accessed by users, and we call this gather locality. Also, we define reduction locality as the reusability of the gathered items in reduction operations. Based on the gather locality, SPACE allocates highly-accessed embedding items to the 3D-stacked DRAM to achieve the maximum bandwidth. Subsequently, by exploiting reduction locality, we utilize the remaining space of the 3D-stacked DRAM to store and reuse repeated partial sums, thereby minimizing the required number of element-wise reduction operations. As a result, the evaluation shows that SPACE achieves 3.2× performance improvement and 56% energy saving over the previous DIMM-based NMPs leveraging 3D-stacked DRAM with a 1/8 size of DIMMs. Also, compared to the state-of-the-art DRAM cache designs with the same NMP configuration, SPACE achieves an average 32.7% of performance improvement.
Hongju Kal, Seokmin Lee, Gun Ko, Won Woo Ro
ISCA2