VLDB 2026 Research / reviewers in the wild / expert
Peng Wang 0025
dblp:95/4442-25
· DBLP profile ↗
7ranked-venue papers
3as first author
0since 2021 · last 2019
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 7 · 3 first-authorSoftware engineering, systems software and programming languages · 1Applied, 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
3 papers |
Memory systems · 68% Storage systems · 26% Performance modeling and evaluation · 6% | |
| Databases, data mining, and information retrieval
1 paper |
Database system architecture and tuning · 100% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems
memory controller |
0.4 | 1 | 2019 | RC-NVM: Dual-Addressing Non-Volatile Memory Architecture Supporting Both Row and Column Memory Accesses · IEEE Trans. Computers 2019 |
Memory systems
non-volatile memory |
0.4 | 1 | 2019 | RC-NVM: Dual-Addressing Non-Volatile Memory Architecture Supporting Both Row and Column Memory Accesses · IEEE Trans. Computers 2019 |
Database system architecture and tuning
main-memory database |
0.3 | 1 | 2018 | RC-NVM: Enabling Symmetric Row and Column Memory Accesses for In-memory Databases · HPCA 2018 |
Storage systems
key-value storage |
0.2 | 1 | 2014 | An efficient design and implementation of LSM-tree based key-value store on open-channel SSD · EuroSys 2014 |
Storage systems › key-value storage
LSM-tree key-value store |
0.2 | 1 | 2014 | An efficient design and implementation of LSM-tree based key-value store on open-channel SSD · EuroSys 2014 |
Memory systems
main memory database |
0.1 | 1 | 2019 | RC-NVM: Dual-Addressing Non-Volatile Memory Architecture Supporting Both Row and Column Memory Accesses · IEEE Trans. Computers 2019 |
Performance modeling and evaluation
memory access performance |
0.1 | 1 | 2019 | RC-NVM: Dual-Addressing Non-Volatile Memory Architecture Supporting Both Row and Column Memory Accesses · IEEE Trans. Computers 2019 |
Memory systems
DRAM |
0.1 | 1 | 2018 | RC-NVM: Enabling Symmetric Row and Column Memory Accesses for In-memory Databases · HPCA 2018 |
Storage systems
flash and SSD |
0.1 | 1 | 2014 | An efficient design and implementation of LSM-tree based key-value store on open-channel SSD · EuroSys 2014 |
Storage systems › flash and SSD › SSD architecture
open-channel SSD |
0.1 | 1 | 2014 | An efficient design and implementation of LSM-tree based key-value store on open-channel SSD · EuroSys 2014 |
Methods — techniques the papers use, named apart from their topics
circuit-level analysis · 1.0group caching · 0.7SIMD operations · 0.4LSM-tree · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | RC-NVM: Dual-Addressing Non-Volatile Memory Architecture Supporting Both Row and Column Memory AccessesabstractAlthough emerging non-volatile memories (NVMs) have been comprehensively studied to design next-generation memory systems, the symmetry of the crossbar structure adopted by most NVMs has not been addressed. In this work, we argue that crossbar-based NVMs can enable dual-addressing memory architecture, i.e., RC-NVM, to support both row- and column-oriented memory accesses for workloads with different access patterns. Through circuit-level analysis, we first prove that such a dual-addressing architecture is only practical with crossbar-based NVMs rather than DRAM. Then, we introduce the RC-NVM architecture from bank, chip and module levels, and propose RC-NVM aware memory controller. We also address the challenges to implement the end-to-end RC-NVM system. Especially, we design a novel protocol to solve the cache synonym problem with very little overhead. Finally, we introduce the deployment of RC-NVM for in-memory databases (IMDBs) and evaluate its performance with IMDBs and well-optimized general matrix multiply (GEMM) workloads. Experimental results show that with only 10 percent area overhead 1) the memory access performance of IMDBs can be improved up to 14.5X, and 2) for GEMM, RC-NVM naturally supports SIMD operations and outperforms the best tiled layout by 19 percent. Shuo Li 0007, Nong Xiao 0001, Peng Wang 0025, Guangyu Sun 0003, Xiaoyang Wang 0006, Yiran Chen 0001, Hai Li 0001, Jason Cong, Tao Zhang 0032 |
IEEE Trans. Computers | 3 |
| 2018 | RC-NVM: Enabling Symmetric Row and Column Memory Accesses for In-memory DatabasesabstractEver increasing DRAM capacity has fostered the development of in-memory databases (IMDB). The massive performance improvements provided by IMDBs have enabled transactions and analytics on the same database. In other words, the integration of OLTP (on-line transactional processing) and OLAP (on-line analytical processing) systems is becoming a general trend. However, conventional DRAM-based main memory is optimized for row-oriented accesses generated by OLTP workloads in row-based databases. OLAP queries scanning on specified columns cause so-called strided accesses and result in poor memory performance. Since memory access latency dominates in IMDB processing time, it can degrade overall performance significantly. To overcome this problem, we propose a dual-addressable memory architecture based on non-volatile memory, called RC-NVM, to support both row-oriented and column-oriented accesses. We first present circuit-level analysis to prove that such a dual-addressable architecture is only practical with RC-NVM rather than DRAM technology. Then, we rethink the addressing schemes, data layouts, cache synonym, and coherence issues of RC-NVM in architectural level to make it applicable for IMDBs. Finally, we propose a group caching technique that combines the IMDB knowledge with the memory architecture to further optimize the system. Experimental results show that the memory access performance can be improved up to 14.5X with only 15% area overhead. Peng Wang 0025, Shuo Li 0007, Guangyu Sun 0003, Xiaoyang Wang 0006, Yiran Chen 0001, Hai Li 0001, Jason Cong, Nong Xiao 0001, Tao Zhang 0032 |
HPCA | 1 |
| 2017 | SPMS: Strand based persistent memory systemabstractEmerging non-volatile memories enable persistent memory, which offers the opportunity to directly access persistent data structures residing in main memory. In order to keep persistent data consistent in case of system failures, most prior work relies on persist ordering constraints which incurs significant overheads. Strand persistency minimizes persist ordering constraints. However, there is still no proposed persistent memory design based on strand persistency due to its implementation complexity. In this work, we propose a novel persistent memory system based on strand persistency, called SPMS. SPMS consists of cacheline-based strand group tracking components, a volatile strand buffer and ultra-capacitors incorporated in persistent memory modules. SPMS can track each strand and guarantee its atomicity. In case of system failures, committed strands buffered in the strand buffer can be flushed back to persistent memory within the residual energy window provided by the ultra-capacitors. Our evaluations show that SPMS outperforms the state-of-the-art persistent memory system by 6.6% and has slightly better performance than the baseline without any consistency guarantee. What's more, SPMS reduces the persistent memory write traffic by 30%, with the help of the strand buffer. Shuo Li 0007, Peng Wang 0025, Nong Xiao 0001, Guangyu Sun 0003, Fang Liu 0002 |
DATE | 2 |
| 2015 | Improving Memory Access Performance of In-Memory Key-Value Store Using Data Prefetching Techniques
Guangyu Sun 0003, Peng Wang 0025, Mingyu Chen 0001 |
APPT | 3 |
| 2014 | An efficient design and implementation of LSM-tree based key-value store on open-channel SSDabstractVarious key-value (KV) stores are widely employed for data management to support Internet services as they offer higher efficiency, scalability, and availability than relational database systems. The log-structured merge tree (LSM-tree) based KV stores have attracted growing attention because they can eliminate random writes and maintain acceptable read performance. Recently, as the price per unit capacity of NAND flash decreases, solid state disks (SSDs) have been extensively adopted in enterprise-scale data centers to provide high I/O bandwidth and low access latency. However, it is inefficient to naively combine LSM-tree-based KV stores with SSDs, as the high parallelism enabled within the SSD cannot be fully exploited. Current LSM-tree-based KV stores are designed without assuming SSD's multi-channel architecture. Peng Wang 0025, Guangyu Sun 0003, Song Jiang 0001, Jian Ouyang, Shiding Lin, Chen Zhang 0001, Jason Cong |
EuroSys | 1 |
| 2013 | Designing scratchpad memory architecture with emerging STT-RAM memory technologiesabstractScratchpad memories (SPMs) have been widely used in embedded systems to achieve comparable performance with better energy efficiency when compared to caches. Spin-transfer torque RAM (STT-RAM) is an emerging nonvolatile memory technology that has low-power and high-density advantages over SRAM. In this study we explore and evaluate a series of scratchpad memory architectures consisting of STT-RAM. The experimental results reveal that with optimized design, STT-RAM is an effective alternative to SRAM for scratchpad memory in low-power embedded systems. Peng Wang 0025, Guangyu Sun 0003, Tao Wang 0004, Yuan Xie 0001, Jason Cong |
ISCAS | 1 |
| 2013 | Active SSD design for energy-efficiency improvement of web-scale data analysisabstractNAND flash based solid state drives (SSDs) have been widely adopted as storage devices in modern data centers to provide high performance I/O services. Recently, researchers proposed several schemes to improve energy efficiency of the system by off-loading specific computation tasks from generic processors to local processing elements in SSD controllers. However, it is inefficient to directly apply these approaches to the web-scale data analysis system equipped with modern SSDs using FPGA based controllers. More important, the design schemess proposed in prior work cannot work with our target system. In order to overcome the limitation, we present our Active SSD design, considering unique features of computation tasks in web-scale data analysis. In addition, we address an important issue about interference between normal data processing and local computation in Active SSDs. The detailed architecture of our Active SSD is described, and a prototype is implemented. Moreover, the modification to the whole system is also introduced to enable the Active SSD. Experimental results based on real applications show that the energy efficiency can be significantly improved with our design. Jian Ouyang, Shiding Lin, Peng Wang 0025, Guangyu Sun 0003 |
ISLPED | 4 |