Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zheng Zhang 0013

dblp:181/2621-13 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2018
0009-0005-9139-4176ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 1 first-author

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 · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems
flash and SSD
0.212014
Improving Hybrid FTL by Fully Exploiting Internal SSD Parallelism with Virtual Blocks · ACM Trans. Archit. Code Optim. 2014
Storage systems › flash and SSD › flash memory management
flash translation layer
0.212014
Improving Hybrid FTL by Fully Exploiting Internal SSD Parallelism with Virtual Blocks · ACM Trans. Archit. Code Optim. 2014
Storage systems › flash and SSD
solid-state drive
0.212014
Improving Hybrid FTL by Fully Exploiting Internal SSD Parallelism with Virtual Blocks · ACM Trans. Archit. Code Optim. 2014
Storage systems › flash and SSD › SSD architecture
SSD parallelism
0.212014
Improving Hybrid FTL by Fully Exploiting Internal SSD Parallelism with Virtual Blocks · ACM Trans. Archit. Code Optim. 2014
Storage systems › flash and SSD
flash memory
0.112014
Improving Hybrid FTL by Fully Exploiting Internal SSD Parallelism with Virtual Blocks · ACM Trans. Archit. Code Optim. 2014

Methods — techniques the papers use, named apart from their topics

trace-driven simulation · 0.2
YearPublicationVenuePosition
2018 A light-weight log-based hybrid storage system
Zheng Zhang 0013, Dan Feng 0001, Laurence T. Yang, Jiayang Zheng
J. Parallel Distributed Comput.1
2014 Improving Hybrid FTL by Fully Exploiting Internal SSD Parallelism with Virtual Blocks
abstract
Compared with either block or page-mapping Flash Translation Layer (FTL), hybrid-mapping FTL for flash Solid State Disks (SSDs), such as Fully Associative Section Translation (FAST), has relatively high space efficiency because of its smaller mapping table than the latter and higher flexibility than the former. As a result, hybrid-mapping FTL has become the most commonly used scheme in SSDs. But the hybrid-mapping FTL incurs a large number of costly full-merge operations. Thus, a critical challenge to hybrid-mapping FTL is how to reduce the cost of full-merge operations and improve partial merge operations and switch operations. In this article, we propose a novel FTL scheme, called Virtual Block-based Parallel FAST (VBP-FAST), that divides flash area into Virtual Blocks (VBlocks) and Physical Blocks (PBlocks) where VBlocks are used to fully exploit channel-level, die-level, and plane-level parallelism of flash. Leveraging these three levels of parallelism, the cost of full merge in VBP-FAST is significantly reduced from that of FAST. In the meantime, VBP-FAST uses PBlocks to retain the advantages of partial merge and switch operations. Our extensive trace-driven simulation results show that VBP-FAST speeds up FAST by a factor of 5.3--8.4 for random workloads and of 1.7 for sequential workloads with channel-level, die-level, and plane-level parallelism of 8, 2, and 2 (i.e., eight channels, two dies, and two planes).
Fang Wang 0001, Hong Jiang 0001, Dan Feng 0001, Jingning Liu, Wei Tong 0001, Zheng Zhang 0013
ACM Trans. Archit. Code Optim.7