Yinjin Fu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yinjin Fu has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
Nong Xiao
School of computer science and engineering, Sun Yat-Sen University, Guangzhou, Guangdong, China
3 shared publications- Nong Xiao
Sun Yat-Sen University, Guangzhou, China
3 shared publications - Jian Wu
Sun Yat-Sen University, Shenzhen, CHINA
2 shared publications - Chen Wang
CSIRO The University of New South Wales Australia
1 shared publication - Fang Liu
National University of Defense Technology
1 shared publication Guyu Hu
PLA University of Science and Technology, Nanjing, China
1 shared publication
Latest Publications
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 220-232
RABBIT: Managing Hierarchical Memory with Intelligent Tiering Aware Deduplication
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 220-232
Open AccessRABBIT: Managing Hierarchical Memory with Intelligent Tiering Aware Deduplication
- Open Access
- 10 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
Distributed Data Deduplication for Big Data: A Survey
To address the throughput and capacity limitations of single-node centralized deduplication, distributed data deduplication has become a popular technology in big data management to save more storage space, enhance I/O performance, and improve system scalability. It includes inter-node data assignment from clients to multiple deduplication nodes by a data routing scheme, and independent intra-node redundancy suppression in individual nodes. In this paper, we first describe the background of big data deduplication. Then we summarize and classify the state-of-the-art in the key techniques of distributed data deduplication, including data partitioning, chunk fingerprinting, data routing, index lookup, data restoring, garbage collection, the security and reliability of deduplicated data. These help identify and understand the system implementation of the existing distributed data deduplication methods. Moreover, we present some representative industrial products that have successfully applied distributed data deduplication technologies. Finally, we discuss the main challenges and industry trend of distributed data deduplication, and outline the open problems and its future research directions.
- 10 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
Open AccessDistributed Data Deduplication for Big Data: A Survey
To address the throughput and capacity limitations of single-node centralized deduplication, distributed data deduplication has become a popular technology in big data management to save more storage space, enhance I/O performance, and improve system scalability. It includes inter-node data assignment from clients to multiple deduplication nodes by a data routing scheme, and independent intra-node redundancy suppression in individual nodes. In this paper, we first describe the background of big data deduplication. Then we summarize and classify the state-of-the-art in the key techniques of distributed data deduplication, including data partitioning, chunk fingerprinting, data routing, index lookup, data restoring, garbage collection, the security and reliability of deduplicated data. These help identify and understand the system implementation of the existing distributed data deduplication methods. Moreover, we present some representative industrial products that have successfully applied distributed data deduplication technologies. Finally, we discuss the main challenges and industry trend of distributed data deduplication, and outline the open problems and its future research directions.
- Open Access
- 12 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 112-113
SGX Based Cloud-Edge Collaborative Secure Deduplication
Secure deduplication based on edge computing was emerged to improve the cost-efficiency, response time and data security of cloud storage. However, the existing solutions have high communication and key management overheads, and lack of security as well. In this paper, we propose SGE: an SGX-based secure deduplication framework with cloud-edge collaborative computing. It can strike a balance between system performance and security by utilizing SGX rather than traditional encryption algorithms to safeguard sensitive operations. Additionally, we design a popularity-based data caching strategy in edge node, which can further improve the efficiency of data recovery. The preliminary experimental results show that our approach can achieve a higher data communication efficiency than the conven-tional methods.
- 12 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 112-113
Open AccessSGX Based Cloud-Edge Collaborative Secure Deduplication
Secure deduplication based on edge computing was emerged to improve the cost-efficiency, response time and data security of cloud storage. However, the existing solutions have high communication and key management overheads, and lack of security as well. In this paper, we propose SGE: an SGX-based secure deduplication framework with cloud-edge collaborative computing. It can strike a balance between system performance and security by utilizing SGX rather than traditional encryption algorithms to safeguard sensitive operations. Additionally, we design a popularity-based data caching strategy in edge node, which can further improve the efficiency of data recovery. The preliminary experimental results show that our approach can achieve a higher data communication efficiency than the conven-tional methods.
- 27 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (7) , 1666-1677
Design and Simulation of Content-Aware Hybrid DRAM-PCM Memory System
Phase Change Memory (PCM) can directly connect persistent memory to main memory bus, while it achieves high read throughput and low standby power, the critical concerns are its poor write performance and limited durability. A naturally in-spired design is the hybrid memory architecture that fuses DRAM and PCM, so as to exploit the positive aspects of both types of memory. Unfortunately, existing solutions are seriously challenged by the limited main memory size, which is the primary bottleneck of in-memory computing. In this paper, we introduce a novel Content Aware Hybrid DRAM-PCM memory system framework—CAHRAM, which exploits deduplication to improve line sharing with high memory efficiency. It reduces write traffic to hybrid memory by removing unnecessary duplicate line writes, thereby further enhancing the write endurance of PCM. And it also substantially extends available free memory space by coalescing redundant lines in hybrid memory. We also design a reference-based page migration technique to minimize the access overheads caused by the performance gap between DRAM and PCM. Compared with the state-of-the-art in a hybrid memory simulator, our experiment results show that CAHRAM can achieve the highest I/O performance and the longest PCM lifetime with the competitive efficiencies in space and energy.
- 27 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (7) , 1666-1677
Design and Simulation of Content-Aware Hybrid DRAM-PCM Memory System
Phase Change Memory (PCM) can directly connect persistent memory to main memory bus, while it achieves high read throughput and low standby power, the critical concerns are its poor write performance and limited durability. A naturally in-spired design is the hybrid memory architecture that fuses DRAM and PCM, so as to exploit the positive aspects of both types of memory. Unfortunately, existing solutions are seriously challenged by the limited main memory size, which is the primary bottleneck of in-memory computing. In this paper, we introduce a novel Content Aware Hybrid DRAM-PCM memory system framework—CAHRAM, which exploits deduplication to improve line sharing with high memory efficiency. It reduces write traffic to hybrid memory by removing unnecessary duplicate line writes, thereby further enhancing the write endurance of PCM. And it also substantially extends available free memory space by coalescing redundant lines in hybrid memory. We also design a reference-based page migration technique to minimize the access overheads caused by the performance gap between DRAM and PCM. Compared with the state-of-the-art in a hybrid memory simulator, our experiment results show that CAHRAM can achieve the highest I/O performance and the longest PCM lifetime with the competitive efficiencies in space and energy.
- Open Access
- 23 June 2021
- Published by Springer Nature
- p. 243-248
CARAM: A Content-Aware Hybrid PCM/DRAM Main Memory System Framework
- 23 June 2021
- Published by Springer Nature
- p. 243-248
Open AccessCARAM: A Content-Aware Hybrid PCM/DRAM Main Memory System Framework
- 2 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 19 (5) , 3136-3148
Fog-to-MultiCloud Cooperative Ehealth Data Management With Application-Aware Secure Deduplication
The healthcare industry faces challenges regarding the security and efficiency of data management for patient health records (PHRs). We propose SafePHR: a secure and efficient medical data service with application aware deduplication in fog-to-multicloud encrypted storage. It introduces a fog-to-multicloud cooperative storage model, which combines low-latency and high-safety local fog with unlimited capacity and built-in disaster recovery in remote multi-cloud to enhance eHealth data management. It also provides an application aware secure deduplication scheme to improve the data traffic and space efficiency of cloud storage for encrypted PHRs using variants of convergent encryption. Then, it further enhances the resiliency and security of cloud storage by striping encrypted data across multiple cloud vendors with a fault-tolerant coding scheme. Compared with the state-of-the-art of cloud-assisted eHealth systems, our experiments demonstrate that SafePHR can ensure data confidentiality of deduplication, achieve a competitive low cloud storage space overhead, and improve system performance with high fault-tolerance capability.
- 2 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 19 (5) , 3136-3148
Fog-to-MultiCloud Cooperative Ehealth Data Management With Application-Aware Secure Deduplication
The healthcare industry faces challenges regarding the security and efficiency of data management for patient health records (PHRs). We propose SafePHR: a secure and efficient medical data service with application aware deduplication in fog-to-multicloud encrypted storage. It introduces a fog-to-multicloud cooperative storage model, which combines low-latency and high-safety local fog with unlimited capacity and built-in disaster recovery in remote multi-cloud to enhance eHealth data management. It also provides an application aware secure deduplication scheme to improve the data traffic and space efficiency of cloud storage for encrypted PHRs using variants of convergent encryption. Then, it further enhances the resiliency and security of cloud storage by striping encrypted data across multiple cloud vendors with a fault-tolerant coding scheme. Compared with the state-of-the-art of cloud-assisted eHealth systems, our experiments demonstrate that SafePHR can ensure data confidentiality of deduplication, achieve a competitive low cloud storage space overhead, and improve system performance with high fault-tolerance capability.
- 8 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (6) , 1202-1216
A Differentiated Caching Mechanism to Enable Primary Storage Deduplication in Clouds
Existing primary deduplication techniques either use inline caching to exploit locality in primary workloads or use post-processing deduplication to avoid the negative impact on I/O performance. However, neither of them works well in the cloud servers running multiple services for the following two reasons: First, the temporal locality of duplicate data writes varies among primary storage workloads, which makes it challenging to efficiently allocate the inline cache space and achieve a good deduplication ratio. Second, the post-processing deduplication does not eliminate duplicate I/O operations that write to the same logical block address as it is performed after duplicate blocks have been written. A hybrid deduplication mechanism is promising to deal with these problems. Inline fingerprint caching is essential to achieving efficient hybrid deduplication. In this paper, we present a detailed analysis of the limitations of using existing caching algorithms in primary deduplication in the cloud. We reveal that existing caching algorithms either perform poorly or incur significant memory overhead in fingerprint cache management. To address this, we propose a novel fingerprint caching mechanism that estimates the temporal locality of duplicates in different data streams and prioritizes the cache allocation based on the estimation. We integrate the caching mechanism and build a hybrid deduplication system. Our experimental results show that the proposed mechanism provides significant improvement for both deduplication ratio and overhead reduction.
- 8 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (6) , 1202-1216
A Differentiated Caching Mechanism to Enable Primary Storage Deduplication in Clouds
Existing primary deduplication techniques either use inline caching to exploit locality in primary workloads or use post-processing deduplication to avoid the negative impact on I/O performance. However, neither of them works well in the cloud servers running multiple services for the following two reasons: First, the temporal locality of duplicate data writes varies among primary storage workloads, which makes it challenging to efficiently allocate the inline cache space and achieve a good deduplication ratio. Second, the post-processing deduplication does not eliminate duplicate I/O operations that write to the same logical block address as it is performed after duplicate blocks have been written. A hybrid deduplication mechanism is promising to deal with these problems. Inline fingerprint caching is essential to achieving efficient hybrid deduplication. In this paper, we present a detailed analysis of the limitations of using existing caching algorithms in primary deduplication in the cloud. We reveal that existing caching algorithms either perform poorly or incur significant memory overhead in fingerprint cache management. To address this, we propose a novel fingerprint caching mechanism that estimates the temporal locality of duplicates in different data streams and prioritizes the cache allocation based on the estimation. We integrate the caching mechanism and build a hybrid deduplication system. Our experimental results show that the proposed mechanism provides significant improvement for both deduplication ratio and overhead reduction.
- Open Access
- 1 October 2017
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 910 (1) , 012008
A 4-packets Train Measurement Method
In order measurement more network performance parameters, a 4-packets trains measurement method was put forward, which could measure the network performance of delay variation and network loss, the method did not need time synchronization. Use the parameters of delay variation and loss, the correlation between destination nodes could be calculated, and the correlation could be used to inference network topology.
- 1 October 2017
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 910 (1) , 012008
Open AccessA 4-packets Train Measurement Method
In order measurement more network performance parameters, a 4-packets trains measurement method was put forward, which could measure the network performance of delay variation and network loss, the method did not need time synchronization. Use the parameters of delay variation and loss, the correlation between destination nodes could be calculated, and the correlation could be used to inference network topology.
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
DualStack: A High Efficient Dynamic Page Scheduling Scheme in Hybrid Main Memory
With the development of big data and multi-core processors technology, DRAM-only based main memory cannot satisfy the requirements of in-memory computing in high memory capacity and low energy consumption. The emerging memory technology-phase change memory (PCM) is proposed to break the bottleneck of the current memory system. However, its weaknesses in write endurance and long access latency make it cannot fully replace DRAM. Consequently, researchers presented the architectural design aimed at DRAM/ PCM hybrids and the corresponding page migration scheme to give full play to their merits. The urgent challenges facing by existed page migration schemes are poor performed under weak locality in data streams and further improvement need in prediction of future access tendency. In this paper, we propose an efficient page migration policy called DualStack which features dynamic page management according to global read and write information and temporal locality. It is designed to keep write-intensive pages to DRAM and read-intensive pages to PCM, and specially avoid frequent and unnecessary migration between hybrid memory media. Compared to the state-of-the-art of hybrid main memory, our experimental results indicate that DualStack can effectively improve the system I/O latency by 38%~58% on the premise of reducing the system power consumption by 20%~30%.
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
DualStack: A High Efficient Dynamic Page Scheduling Scheme in Hybrid Main Memory
With the development of big data and multi-core processors technology, DRAM-only based main memory cannot satisfy the requirements of in-memory computing in high memory capacity and low energy consumption. The emerging memory technology-phase change memory (PCM) is proposed to break the bottleneck of the current memory system. However, its weaknesses in write endurance and long access latency make it cannot fully replace DRAM. Consequently, researchers presented the architectural design aimed at DRAM/ PCM hybrids and the corresponding page migration scheme to give full play to their merits. The urgent challenges facing by existed page migration schemes are poor performed under weak locality in data streams and further improvement need in prediction of future access tendency. In this paper, we propose an efficient page migration policy called DualStack which features dynamic page management according to global read and write information and temporal locality. It is designed to keep write-intensive pages to DRAM and read-intensive pages to PCM, and specially avoid frequent and unnecessary migration between hybrid memory media. Compared to the state-of-the-art of hybrid main memory, our experimental results indicate that DualStack can effectively improve the system I/O latency by 38%~58% on the premise of reducing the system power consumption by 20%~30%.
- 31 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 7 (4) , 921-934
Application-Aware Big Data Deduplication in Cloud Environment
Deduplication has become a widely deployed technology in cloud data centers to improve IT resources efficiency. However, traditional techniques face a great challenge in big data deduplication to strike a sensible tradeoff between the conflicting goals of scalable deduplication throughput and high duplicate elimination ratio. We propose AppDedupe, an application-aware scalable inline distributed deduplication framework in cloud environment, to meet this challenge by exploiting application awareness, data similarity and locality to optimize distributed deduplication with inter-node two-tiered data routing and intra-node application-aware deduplication. It first dispenses application data at file level with an application-aware routing to keep application locality, then assigns similar application data to the same storage node at the super-chunk granularity using a handprinting-based stateful data routing scheme to maintain high global deduplication efficiency, meanwhile balances the workload across nodes. AppDedupe builds application-aware similarity indices with super-chunk handprints to speedup the intra-node deduplication process with high efficiency. Our experimental evaluation of AppDedupe against state-of-the-art, driven by real-world datasets, demonstrates that AppDedupe achieves the highest global deduplication efficiency with a higher global deduplication effectiveness than the high-overhead and poorly scalable traditional scheme, but at an overhead only slightly higher than that of the scalable but low duplicate-elimination-ratio approaches.
- 31 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 7 (4) , 921-934
Application-Aware Big Data Deduplication in Cloud Environment
Deduplication has become a widely deployed technology in cloud data centers to improve IT resources efficiency. However, traditional techniques face a great challenge in big data deduplication to strike a sensible tradeoff between the conflicting goals of scalable deduplication throughput and high duplicate elimination ratio. We propose AppDedupe, an application-aware scalable inline distributed deduplication framework in cloud environment, to meet this challenge by exploiting application awareness, data similarity and locality to optimize distributed deduplication with inter-node two-tiered data routing and intra-node application-aware deduplication. It first dispenses application data at file level with an application-aware routing to keep application locality, then assigns similar application data to the same storage node at the super-chunk granularity using a handprinting-based stateful data routing scheme to maintain high global deduplication efficiency, meanwhile balances the workload across nodes. AppDedupe builds application-aware similarity indices with super-chunk handprints to speedup the intra-node deduplication process with high efficiency. Our experimental evaluation of AppDedupe against state-of-the-art, driven by real-world datasets, demonstrates that AppDedupe achieves the highest global deduplication efficiency with a higher global deduplication effectiveness than the high-overhead and poorly scalable traditional scheme, but at an overhead only slightly higher than that of the scalable but low duplicate-elimination-ratio approaches.