Demo Data from EDBT 2026 / reviewers in the wild / expert
Hyoung Uk Sul
dblp:290/3991
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
0009-0006-8493-9833ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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.
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems
memory bandwidth |
0.5 | 1 | 2021 | MERCI: efficient embedding reduction on commodity hardware via sub-query memoization · ASPLOS 2021 |
Methods — techniques the papers use, named apart from their topics
sub-query memoization · 1.0memoization · 1.0clustering · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | MERCI: efficient embedding reduction on commodity hardware via sub-query memoizationabstractDeep neural networks (DNNs) with embedding layers are widely adopted to capture complex relationships among entities within a dataset. Embedding layers aggregate multiple embeddings — a dense vector used to represent the complicated nature of a data feature— into a single embedding; such operation is called embedding reduction. Embedding reduction spends a significant portion of its runtime on reading embeddings from memory and thus is known to be heavily memory-bandwidth-bound. Recent works attempt to accelerate this critical operation, but they often require either hardware modifications or emerging memory technologies, which makes it hardly deployable on commodity hardware. Thus, we propose MERCI, Memoization for Embedding Reduction with ClusterIng, a novel memoization framework for efficient embedding reduction. MERCI provides a mechanism for memoizing partial aggregation of correlated embeddings and retrieving the memoized partial result at a low cost. MERCI substantially reduces the number of memory accesses by 44% (29%), leading to 102% (74%) throughput improvement on real machines and 40.2% (28.6%) energy savings at the expense of 8×(1×) additional memory usage. Yejin Lee 0001, Seong Hoon Seo, Hyunji Choi, Hyoung Uk Sul, Soosung Kim 0001, Jae W. Lee, Tae Jun Ham |
ASPLOS | 4 |