Demo Data from EDBT 2026 / reviewers in the wild / expert
Tianxiang Peng
dblp:181/7052
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
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 · 57% Memory systems · 43% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems › storage reliability
durability |
0.8 | 1 | 2024 | Hybrid-Memcached: A Novel Approach for Memcached Persistence Optimization With Hybrid Memory · IEEE Trans. Computers 2024 |
Storage systems › key-value storage
in-memory key-value store |
0.8 | 1 | 2024 | Hybrid-Memcached: A Novel Approach for Memcached Persistence Optimization With Hybrid Memory · IEEE Trans. Computers 2024 |
Storage systems
key-value storage |
0.8 | 1 | 2024 | Hybrid-Memcached: A Novel Approach for Memcached Persistence Optimization With Hybrid Memory · IEEE Trans. Computers 2024 |
Memory systems
non-volatile memory |
0.8 | 1 | 2024 | Hybrid-Memcached: A Novel Approach for Memcached Persistence Optimization With Hybrid Memory · IEEE Trans. Computers 2024 |
Memory systems › non-volatile memory
persistent memory |
0.8 | 1 | 2024 | Hybrid-Memcached: A Novel Approach for Memcached Persistence Optimization With Hybrid Memory · IEEE Trans. Computers 2024 |
Memory systems
cache |
0.2 | 1 | 2024 | Hybrid-Memcached: A Novel Approach for Memcached Persistence Optimization With Hybrid Memory · IEEE Trans. Computers 2024 |
Methods — techniques the papers use, named apart from their topics
non-temporal stores · 0.8data alignment · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Hybrid-Memcached: A Novel Approach for Memcached Persistence Optimization With Hybrid MemoryabstractMemcached is a widely adopted, high-performance, in-memory key-value object caching system utilized in data centers. Nonetheless, its data is stored in volatile DRAM, making the cached data susceptible to loss during system shutdowns. Consequently, cold restarts experience significant delays. Persistent memory is a byte-addressable, large-capacity, and non-volatility storage media, which can be employed to avoid the cold restart problem. However, deploying Memcached on persistent memory requires consideration of issues such as write endurance, asymmetric read/write latency and bandwidth, and write granularity of persistent memory. In this paper, we propose Hybrid-Memcached, an optimized Memcached framework based on a hybrid combination of DRAM and persistent memory. Hybrid-Memcached includes three key components: (1) a DRAM-based data aggregation buffer to avoid multiple fine-grained writes, which extends the write endurance of persistent memory, (2) a data-object alignment mechanism to avoid write amplification, and (3) a non-temporal store instruction-based writing strategy to improve the bandwidth utilization. We have implemented Hybrid-Memcached on the Intel Optane persistent memory. Several micros-benchmarks are designed to evaluate Hybrid-Memcached by varying read/write ratios, access distributions, and key-value item sizes. Additionally, we evaluated it with the YCSB benchmark, showing a 21.2% performance improvement for fully write-intensive workloads and 11.8% for read-write balanced workloads. Zhang Jiang, Xianduo Li, Tianxiang Peng, Haoran Li 0014, Jingxuan Hong, Jin Zhang 0003, Xiaoli Gong |
IEEE Trans. Computers | 3 |
| 2009 | Lossless Compression of Hyperspectral Images Based on Searching Optimal Multibands for PredictionabstractThis letter presents a lossless compression algorithm for hyperspectral images, which is based on the strength of correlations between bands. First, a searching model is constructed using the tree structure. Second, multibands which have strong correlations to each chosen band are found out and are then used to predict the chosen band in a couple-group manner. Lastly, residual images are encoded using entropy coders. Experimental results show that our compression algorithm provides a competitive compression performance compared with most existing compression algorithms. Chengfu Huo, Tianxiang Peng |
IEEE Geosci. Remote. Sens. Lett. | 3 |