Wenjie Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wenjie Liu has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Ke Zhou
Huazhong University of Science and Technology, Wuhan, China
2 shared publications - Ping Huang
Computer and Information Sciences, Temple University, 6558 Philadelphia, Pennsylvania United States
2 shared publications - Xubin He
Department of Computer and Information Sciences, Temple University, Philadelphia, PA, USA
2 shared publications Hua Wang
1 shared publication- Kun Tang
Computer and Information Sciences, Temple University, 6558 Philadelphia, Pennsylvania United States
1 shared publication Rui Lan
1 shared publication
Latest Publications
- 4 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 30 (9) , 2033-2045
Improving Cache Performance for Large-Scale Photo Stores via Heuristic Prefetching Scheme
- 4 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 30 (9) , 2033-2045
Improving Cache Performance for Large-Scale Photo Stores via Heuristic Prefetching Scheme
- 16 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (7) , 1469-1483
Alleviating Memory Refresh Overhead via Data Compression for High Performance and Energy Efficiency
DRAM memory suffers from increasingly aggravating refresh penalty, which causes significant performance degradation and power consumption. As memory capacity increases, refresh penalty has become increasingly worse as more rows have to be refreshed. In this work, we propose an effective refresh approach called CAR (Compression-Aware Refresh) to efficiently mitigate refresh overheads. We apply a data compression technique to store data in a compressed format so that the resultant sparse banks need only be partially refreshed. Because of compression, data blocks which are originally distributed across all the constituent chips of a rank only need to be stored in a subset of those chips, leaving banks in the remaining chips not fully occupied. As a result, the memory controller can safely skip refreshing memory rows which contain no useful data without compromising data integrity. Such a compression-aware refresh scheme significantly reduces the refresh and thus improves overall memory performance and energy efficiency. To further take advantage of data compression, we adopt a rank subsetting technique to enable accesses to only those occupied chips for memory requests accessing compressed data blocks. Evaluations using benchmarks from SPEC CPU 2006 and the PARSEC 3.0 on recent DDR4 memory systems have shown that CAR achieves up to 1.66x performance improvement (11.7% on average) and up to 45.9% energy reduction (27.3% on average), and reduce memory traffic by up to 99.9% for zero cache lines intensive workloads with an average of 66.3% across all benchmarks.
- 16 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (7) , 1469-1483
Alleviating Memory Refresh Overhead via Data Compression for High Performance and Energy Efficiency
DRAM memory suffers from increasingly aggravating refresh penalty, which causes significant performance degradation and power consumption. As memory capacity increases, refresh penalty has become increasingly worse as more rows have to be refreshed. In this work, we propose an effective refresh approach called CAR (Compression-Aware Refresh) to efficiently mitigate refresh overheads. We apply a data compression technique to store data in a compressed format so that the resultant sparse banks need only be partially refreshed. Because of compression, data blocks which are originally distributed across all the constituent chips of a rank only need to be stored in a subset of those chips, leaving banks in the remaining chips not fully occupied. As a result, the memory controller can safely skip refreshing memory rows which contain no useful data without compromising data integrity. Such a compression-aware refresh scheme significantly reduces the refresh and thus improves overall memory performance and energy efficiency. To further take advantage of data compression, we adopt a rank subsetting technique to enable accesses to only those occupied chips for memory requests accessing compressed data blocks. Evaluations using benchmarks from SPEC CPU 2006 and the PARSEC 3.0 on recent DDR4 memory systems have shown that CAR achieves up to 1.66x performance improvement (11.7% on average) and up to 45.9% energy reduction (27.3% on average), and reduce memory traffic by up to 99.9% for zero cache lines intensive workloads with an average of 66.3% across all benchmarks.