EDBT 2026 Demo / reviewers in the wild / expert
Dennis Hahn
dblp:229/7813
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 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 |
Storage systems · 70% Memory systems · 30% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › cache coherence
data classification |
0.6 | 1 | 2022 | HintStor: A Framework to Study I/O Hints in Heterogeneous Storage · ACM Trans. Storage 2022 |
Storage systems
file systems |
0.6 | 1 | 2022 | HintStor: A Framework to Study I/O Hints in Heterogeneous Storage · ACM Trans. Storage 2022 |
Storage systems › storage hierarchy
heterogeneous storage |
0.6 | 1 | 2022 | HintStor: A Framework to Study I/O Hints in Heterogeneous Storage · ACM Trans. Storage 2022 |
Storage systems
i/o scheduling |
0.2 | 1 | 2022 | HintStor: A Framework to Study I/O Hints in Heterogeneous Storage · ACM Trans. Storage 2022 |
Methods — techniques the papers use, named apart from their topics
kernel modification · 0.6file system plugin · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | HintStor: A Framework to Study I/O Hints in Heterogeneous StorageabstractTo bridge the giant semantic gap between applications and modern storage systems, passing a piece of tiny and useful information, called I/O access hints, from upper layers to the storage layer may greatly improve application performance and ease data management in storage systems. This is especially true for heterogeneous storage systems that consist of multiple types of storage devices. Since ingesting external access hints will likely involve laborious modifications of legacy I/O stacks, it is very hard to evaluate the effect and take advantages of access hints. In this article, we design a generic and flexible framework, called HintStor, to quickly play with a set of I/O access hints and evaluate their impacts on heterogeneous storage systems. HintStor provides a new application/user-level interface, a file system plugin, and performs data management with a generic block storage data manager. We demonstrate the flexibility of HintStor by evaluating four types of access hints: file system data classification, stream ID, cloud prefetch, and I/O task scheduling on a Linux platform. The results show that HintStor can execute and evaluate various I/O access hints under different scenarios with minor modifications to the kernel and applications. Xiongzi Ge, Zhichao Cao 0002, David Hung-Chang Du, Pradeep Ganesan, Dennis Hahn |
ACM Trans. Storage | 5 |
| 2018 | ChewAnalyzer: Workload-Aware Data Management Across Differentiated Storage PoolsabstractIn multi-tier storage systems, moving data from one tier to the next can be inefficient. And because each type of storage device has its own idiosyncrasies with respect to the workloads that it can best support, unnecessary data movement might result. In this paper, we explore a fully connected storage architecture in which data can move from any storage pool to another. We propose a Chunk-level storage-aware workload Analyzer framework, abbreviated as ChewAnalyzer, to facilitate efficient data placement. Access patterns are characterized in a flexible way by a collection of I/O accesses to a data chunk. ChewAnalyzer employs a Hierarchical Classifier [1] to analyze the chunk patterns step by step. In each classification step, the Chunk Placement Recommender suggests new data placement policies according to the device properties. Based on the analysis of access pattern changes, the Storage Manager can adequately distribute or migrate the data chunks across different storage pools. Our experimental results show that ChewAnalyzer improves the initial data placement and that it migrates data into the proper pools directly and efficiently. Xiongzi Ge, Xuchao Xie, David Hung-Chang Du, Pradeep Ganesan, Dennis Hahn |
MASCOTS | 5 |