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

Jing Yang 0018

dblp:62/5839-18 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-0566-3383ORCID · conflict

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

Systems, architecture and hardware · 6 · 1 since 2021Software engineering, systems software and programming languages · 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
5 papers
Storage systems · 67% Memory systems · 24% Hardware accelerators and domain-specific architectures · 8%
Network and information security
1 paper
Blockchain and cryptocurrency security · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems
flash and SSD
1.022023
Meta-Block: Exploiting Cross-Layer and Direct Storage Access for Decentralized Blockchain Storage Systems · IEEE Trans. Computers 2023
A Temperature-Aware Reliability Enhancement Strategy for 3-D Charge-Trap Flash Memory · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2019
Memory systems
processing-in-memory
1.032019
Exploiting Parallelism for CNN Applications on 3D Stacked Processing-In-Memory Architecture · IEEE Trans. Parallel Distributed Syst. 2019
Towards Memory-Efficient Allocation of CNNs on Processing-in-Memory Architecture · IEEE Trans. Parallel Distributed Syst. 2018
Exploiting Parallelism for Convolutional Connections in Processing-In-Memory Architecture · DAC 2017
Memory systems › processing-in-memory
3D-stacked PIM
0.722019
Exploiting Parallelism for CNN Applications on 3D Stacked Processing-In-Memory Architecture · IEEE Trans. Parallel Distributed Syst. 2019
Towards Memory-Efficient Allocation of CNNs on Processing-in-Memory Architecture · IEEE Trans. Parallel Distributed Syst. 2018
Storage systems › i/o architecture
direct storage access
0.712023
Meta-Block: Exploiting Cross-Layer and Direct Storage Access for Decentralized Blockchain Storage Systems · IEEE Trans. Computers 2023
Storage systems
key-value storage
0.712023
Meta-Block: Exploiting Cross-Layer and Direct Storage Access for Decentralized Blockchain Storage Systems · IEEE Trans. Computers 2023
Storage systems › key-value storage
LSM-tree
0.712023
Meta-Block: Exploiting Cross-Layer and Direct Storage Access for Decentralized Blockchain Storage Systems · IEEE Trans. Computers 2023
Storage systems › flash and SSD › SSD architecture
open-channel SSD
0.712023
Meta-Block: Exploiting Cross-Layer and Direct Storage Access for Decentralized Blockchain Storage Systems · IEEE Trans. Computers 2023
Storage systems › flash and SSD
write amplification reduction
0.712023
Meta-Block: Exploiting Cross-Layer and Direct Storage Access for Decentralized Blockchain Storage Systems · IEEE Trans. Computers 2023
Storage systems
storage reliability
0.412019
A Temperature-Aware Reliability Enhancement Strategy for 3-D Charge-Trap Flash Memory · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2019
Hardware accelerators and domain-specific architectures › machine learning accelerator
CNN accelerator
0.332019
Exploiting Parallelism for CNN Applications on 3D Stacked Processing-In-Memory Architecture · IEEE Trans. Parallel Distributed Syst. 2019
Towards Memory-Efficient Allocation of CNNs on Processing-in-Memory Architecture · IEEE Trans. Parallel Distributed Syst. 2018
Exploiting Parallelism for Convolutional Connections in Processing-In-Memory Architecture · DAC 2017
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.332019
Exploiting Parallelism for CNN Applications on 3D Stacked Processing-In-Memory Architecture · IEEE Trans. Parallel Distributed Syst. 2019
Towards Memory-Efficient Allocation of CNNs on Processing-in-Memory Architecture · IEEE Trans. Parallel Distributed Syst. 2018
Exploiting Parallelism for Convolutional Connections in Processing-In-Memory Architecture · DAC 2017
Blockchain and cryptocurrency security
decentralized storage
0.212023
Meta-Block: Exploiting Cross-Layer and Direct Storage Access for Decentralized Blockchain Storage Systems · IEEE Trans. Computers 2023

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

data prefetching · 1.3cross-layer design · 1.3dynamic programming · 0.7temperature mining · 0.4data-level parallelism · 0.4block allotment · 0.4data allocation strategy · 0.3nonvolatile memory computing · 0.3
YearPublicationVenuePosition
2023 Meta-Block: Exploiting Cross-Layer and Direct Storage Access for Decentralized Blockchain Storage Systems
abstract
Decentralized storage systems such as blockchain storage applications adopt the distributed storage technology and use distributed storage nodes to store the persistent data. For each off-chain storage node, key-value (KV) stores are normally used to manage data. As the most common data structure for KV store, Log Structured Merge Tree (LSM-Tree) eliminates random write operations and keeps acceptable read performance. Although LSM-Tree-based decentralized storage system can provide a secure and reliable storage platform, the unique feature of blockchain applications is not fully exploited. In blockchain storage applications, the generation of keys for KV stores is based on the encrypted data, and the key determines the allocation of data. Since the granularity for a read/write request at the level of blockchain storage platform is much smaller than that at the level of LSM-Tree or flash memory, a physical block in a solid-state drive (SSD) could be filled with data from different system users. This mixture of workloads will lead to the inefficient usage of physical spaces in the SSD and cause extra compaction operations for LSM-Tree. This paper presentsMeta-Block, a cross-layer and efficient storage management strategy for decentralized blockchain storage applications. Meta-Block utilizes rich functionalities provided by the system infrastructure of open-channel SSD to provide direct storage accesses for the off-chain storage node. The objective is to capture the features of blockchain storage applications and reduce unnecessary read and write operations across different storage layers. As a cross-layer design, Meta-Block redesigns the organization of LSM-Tree, which can effectively reduce the write amplification. We also design a data prefetching strategy to speed up the indexing and enable direct storage access. We demonstrate the viability of the proposed technique using a set of extensive experiments. Experimental results show that Meta-Block can effectively reduce the write amplification and extend the lifetime of SSDs in comparison with representative schemes.
Yi Wang 0003, Jing Liao 0008, Jing Yang 0018, Zhengda Li, Chenlin Ma, Rui Mao 0001
IEEE Trans. Computers3
2019 A Temperature-Aware Reliability Enhancement Strategy for 3-D Charge-Trap Flash Memory
abstract
Compared to the conventional planar flash memory, advanced 3-D flash memory adopts charge-trap technology that can significantly enhance cell density and storage capacity. Despite these advantages, 3-D charge-trap flash memory brings several new challenges. First, charge-trap flash is sensitive to temperature. Recent studies demonstrate that, the high temperature will incur both charge loss and retention degradation. This issue does not happen in 2-D flash memory which adopts floating gate technology. Second, current 3-D charge-trap flash integrates the extra large capacity physical block, and each block contains over 1024 physical pages. The large-capacity block infrastructure will cause extra garbage collection overhead, which makes the thermal issue more complicated. This paper presents TempCure, a temperature-aware reliability enhancement strategy for 3-D charge-trap flash memory. TempCure is a novel hardware and file system interface that can transparently allocate physical space based on the temperature status. TempCure adopts two reliability enhancement strategies, temperature mining and block allotment, to prevent the generation of hotspots and enhance the data integrity of 3-D flash memory. We conduct a set of experiments using standard benchmarks. Experimental results show that TempCure can effectively reduce the peak temperature and block erase counts with negligible timing overhead in comparison with representative schemes.
Yi Wang 0003, Jiangfan Huang, Jing Yang 0018, Tao Li 0006
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
2019 Exploiting Parallelism for CNN Applications on 3D Stacked Processing-In-Memory Architecture
abstract
Deep convolutional neural networks (CNNs) are widely adopted in intelligent systems with unprecedented accuracy but at the cost of a substantial amount of data movement. Although the emerging processing-in-memory (PIM) architecture seeks to minimize data movement by placing memory near processing elements, memory is still the major bottleneck in the entire system. The selection of hyper-parameters in the training of CNN applications requires over hundreds of kilobytes cache capacity for concurrent processing of convolutions. How to jointly explore the computation capability of the PIM architecture and the highly parallel property of neural networks remains a critical issue. This paper presents Para-Net, that exploits Parallelism for deterministic convolutional neural Networks on the PIM architecture. Para- Net achieves data-level parallelism for convolutions by fully utilizing the on-chip processing engine (PE) in PIM. The objective is to capture the characteristics of neural networks and present a hardware-independent design to jointly optimize the scheduling of both intermediate results and computation tasks. We formulate this data allocation problem as a dynamic programming model and obtain an optimal solution. To demonstrate the viability of the proposed Para-Net, we conduct a set of experiments using a variety of realistic CNN applications. The graph abstractions are obtained from deep learning framework Caffe. Experimental results show that Para-Net can significantly reduce processing time and improve cache efficiency compared to representative schemes.
Yi Wang 0003, Weixuan 'Vincent' Chen, Jing Yang 0018, Tao Li 0006
IEEE Trans. Parallel Distributed Syst.3
2018 Towards Memory-Efficient Allocation of CNNs on Processing-in-Memory Architecture
abstract
Convolutional neural networks (CNNs) have been successfully applied in artificial intelligent systems to perform sensory processing, sequence learning, and image processing. In contrast to conventional computing-centric applications, CNNs are known to be both computationally and memory intensive. The computational and memory resources of CNN applications are mixed together in the network weights. This incurs a significant amount of data movement, especially for high-dimensional convolutions. The emerging Processing-in-Memory (PIM) alleviates this memory bottleneck by integrating both processing elements and memory into a 3D-stacked architecture. Although this architecture can offer fast near-data processing to reduce data movement, memory is still a limiting factor of the entire system. We observe that an unsolved key challenge is how to efficiently allocate convolutions to 3D-stacked PIM to combine the advantages of both neural and computational processing. This paper presents MemoNet, a memory-efficient data allocation strategy for convolutional neural networks on 3D PIM architecture. MemoNet offers fine-grained parallelism that can fully exploit the computational power of PIM architecture. The objective is to capture the characteristics of neural network applications and perfectly match the underlining hardware resources provided by PIM, resulting in a hardware-independent design to transparently allocate data. We formulate the target problem as a dynamic programming model and present an optimal solution. To demonstrate the viability of the proposed MemoNet, we conduct a set of experiments using a variety of realistic convolutional neural network applications. The extensive evaluations show that, MemoNet can significantly improve the performance and the cache utilization compared to representative schemes.
Yi Wang 0003, Weixuan 'Vincent' Chen, Jing Yang 0018, Tao Li 0006
IEEE Trans. Parallel Distributed Syst.3
2017 Temperature-aware data allocation strategy for 3D charge-trap flash memory
abstract
Three-dimensional (3D) flash memory is emerging as an attractive solution to overcome the scaling bottleneck in sub-20 nanometer design. Compared to the conventional planar flash memory, current 3D flash memory adopts charge-trap technology that can significantly enhance cell density and storage capacity. Despite these advantages, novel material and fabricate process in charge-trap flash memory bring new challenges. Recent studies demonstrate that charge-trap flash is sensitive to thermal yield. This issue does not happen in two-dimensional flash memory which adopts floating gate technology. For 3D flash memory with charge-trap technology, the high temperature will incur both charge loss and retention degradation. The large capacity data block in 3D flash memory also causes extra garbage collection overhead, which makes the temperature issue even worse. This paper presents TempLoad, a temperature-aware data allocation strategy for 3D charge-trap flash memory. TempLoad is a novel hardware and file system interface that can transparently allocate physical space based on the temperature status. TempLoad adopts several address mapping strategies to fully utilize the storage capacity and reduce the garbage collection overhead. The objective is to prevent the generation of hotspots and enhance the data integrity of 3D flash memory. Experimental results show that the proposed technique can reduce the peak temperature by 28.49% and reduce uncorrectable page errors by 83.71% with negligible timing overhead in comparison with previous work.
Yi Wang 0003, Mingxu Zhang, Jing Yang 0018
ASP-DAC3
2017 Exploiting Parallelism for Convolutional Connections in Processing-In-Memory Architecture
abstract
Deep convolutional neural networks (CNNs) are widely adopted in intelligent systems with unprecedented accuracy but at the cost of a substantial amount of data movement. Although recent development in processing-in-memory (PIM) architecture seeks to minimize data movement by computing the data at the dedicated nonvolatile device, how to jointly explore the computation capability of PIM and utilize the highly parallel property of neural network remains a critical issue.
Yi Wang 0003, Mingxu Zhang, Jing Yang 0018
DAC3
2017 Towards memory-efficient processing-in-memory architecture for convolutional neural networks
abstract
Convolutional neural networks (CNNs) are widely adopted in artificial intelligent systems. In contrast to conventional computing centric applications, the computational and memory resources of CNN applications are mixed together in the network weights. This incurs a significant amount of data movement, especially for highdimensional convolutions. Although recent embedded 3D-stacked Processing-in-Memory (PIM) architecture alleviates this memory bottleneck to provide fast near-data processing, memory is still a limiting factor of the entire system. An unsolved key challenge is how to efficiently allocate convolutions to 3D-stacked PIM to combine the advantages of both neural and computational processing.
Yi Wang 0003, Mingxu Zhang, Jing Yang 0018
LCTES3