Yu Zhang

Yu Zhang

Auto-generated profile, based on publicly available information

Yu Zhang

Huazhong University of Science and Technology

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2019 in Future Generation Computer Systems
Verified
Journal Article
Closed access
LGLin Gu
Lin Gu
JCJingjing Cai
Jingjing Cai
DZDeze Zeng
Deze Zeng
YZYu Zhang
Yu Zhang
HJHai Jin
Hai Jin
WDWeiqi Dai
Weiqi Dai

30 January 2021 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
Haikun LiuHaikun Liu
Haikun Liu
DCDi Chen
Di Chen
HJHai Jin
Hai Jin
XLXiaoFei Liao
XiaoFei Liao
BHBinsheng He
Binsheng He
YZYu Zhang
Yu Zhang

12 February 2020 in IEEE Transactions on Computers
Verified
Journal Article
Open access
Haikun LiuHaikun Liu
Haikun Liu
RLRenshan Liu
Renshan Liu
XLXiaoFei Liao
XiaoFei Liao
HJHai Jin
Hai Jin
BHBingsheng He
Bingsheng He
YZYu Zhang
Yu Zhang
Hybrid memory systems composed of emerging non-volatile memory (NVM) and DRAM have drawn increasing attention in recent years. To fully exploit the advantages of both NVM and DRAM, a primary goal is to properly place application data on the hybrid memories. Previous studies have focused on page migration schemes to achieve higher performance and energy efficiency. However, those schemes all rely on online page access monitoring (costly), and data migration at the page granularity may cause additional overhead due to DRAM bandwidth contention and maintenance of cache/TLB consistency. In this paper, we present Object-level memory Allocation and Migration (OAM) mechanisms for hybrid memory systems. OAM exploits a profiling tool to characterize objects' memory access patterns at different execution phases of applications, and applies a performance/energy model to direct the initial static memory allocation and runtime dynamic object migration between NVM and DRAM. Based on our newly-developed programming interfaces for hybrid memory systems, application source codes can be automatically transformed via static code instrumentation. We evaluate OAM on an emulated hybrid memory system, and experimental results show that OAM can significantly reduce system energy-delay-product by 61% on average compared to a page-interleaving data placement scheme. It can also significantly reduce data migration overhead by 83% and 69% compared to the state-of-the-art page migration scheme CLOCK-DWF and 2PP, respectively, while improving application performance by up to 22% and 10%.

18 November 2019 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
PDF file
YZYongbin Zhao
Yongbin Zhao
MCMeng Cui
Meng Cui
LZLijuan Zheng
Lijuan Zheng
RZRui Zhang
Rui Zhang
LMLili Meng
Lili Meng
YZYu Zhang
Yu Zhang
For the medical industry, there are problems such as poor sharing of medical data, tampering, and leakage of private data. In view of these problems, a blockchain-based electronic medical record access control research scheme based on the role-based access control model is proposed in this article. First, the appropriate access control strategy is adopted to solve the leakage problem of the user’s medical privacy information during the access process. Then, the information entropy technology is used to quantify the medical data, so that the medical data can be effectively and maximally utilized. Using the distributed general ledger characteristics of blockchain and its inherent security attributes, data islands can be eliminated, data sharing among medical systems can be promoted, access records can be prevented from being tampered with, and medical research and precise medical treatment can be better supported. Through this research, not only can user’s medical privacy information protection be realized during the service process but also patients can manage their own medical data autonomously, which is beneficial to privacy protection under the medical data sharing.

26 August 2020 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
BSBeibei Si
Beibei Si
YLYuxuan Liang
Yuxuan Liang
JZJin Zhao
Jin Zhao
YZYu Zhang
Yu Zhang
XLXiaoFei Liao
XiaoFei Liao
LGLin Gu
Lin Gu
Many iterative graph processing systems have recently been developed to analyze graphs. Although they are effective from different aspects, there is an important issue that has not been addressed yet. A real-world graph follows the power-law property, in which a small number of vertices have high degrees (i.e., are connected to most other vertices in the graph). These vertices are called hot-vertices and usually require more iterations to converge. In the existing solutions, these hot-vertices may be allocated to many or even all graph partitions along with other vertices that are easy to converge. As the result, the partitions with hot-vertices have to be loaded repeatedly (and consequently the system suffers from high data access cost), although perhaps only a few vertices in these partitions are active. To cope with this issue, we develop an efficient open source graph partition manager, called GGraph, which can be integrated into the existing graph processing systems to efficiently support iterative graph processing, by taking into account the power-law property of the graph structure. It uses a novel graph repartitioning scheme with low overhead to dynamically partition the hot-vertices together, so as to avoid loading the inactive vertices in the same partition as the repeatedly processed hot-vertices. By such means, it not only enables less data access cost, but also enables the privileged processing of the hot-vertices. In order to further increase the convergence speed, a scheduling algorithm is further proposed in this work to prioritize the processing of the hot-vertices with low overhead. To demonstrate the efficiency of GGraph, we plug it into four state-of-the-art graph processing systems, i.e., Gemini, GraphChi, Chaos, and GridGraph, and experimental results show that GGraph improves their performance by up to 3.2 times, 3.8 times, 3.9 times, 3.5 times, respectively.

4 October 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
HJHai Jin
Hai Jin
ZLZhiwei Li
Zhiwei Li
Haikun LiuHaikun Liu
Haikun Liu
XLXiaoFei Liao
XiaoFei Liao
YZYu Zhang
Yu Zhang
Emerging Non-Volatile Memory (NVM) technologies promise much higher memory density and energy efficiency than DRAM, at the expense of higher read/write latency and limited write endurance. Hybrid memory systems composed of DRAM and NVM have the potential to provide very large capacity of main memory for in-memory key-value (K-V) stores. However, there remains challenges to directly deploy DRAM-based K-V stores in hybrid memory systems. The performance and energy efficiency of K-V stores on hybrid memory systems have not been fully explored yet. In this paper, we propose HMCached, an in-memory K-V store built on a hybrid DRAM/NVM system. HMCached utilizes an application-level data access counting mechanism to identify frequently-accessed (hotspot) objects (i.e., K-V pairs) in NVM, and migrates them to fast DRAM to reduce the costly NVM accesses. We also propose an NVM-friendly index structure to store the frequently-updated portion of object metadata in DRAM, and thus further mitigate the NVM accesses. Moreover, we propose a benefit-aware memory reassignment policy to address the slab calcification problem in slab-based K-V store systems, and significantly improve the benefit gain from the DRAM. We implement the proposed schemes with Memcached and evaluate it with Zipfian-like workloads. Experiment results show that HMCached significantly reduces NVM accesses by 70 percent compared to the vanilla Memcached running on a DRAM/NVM hybrid memory system without any optimizations, and improves application performance by up to 50 percent. Moreover, compared to a DRAM-only system, HMCached achieves 90 percent of performance and 46 percent reduction of energy consumption for realistic (read-intensive) workloads while significantly reducing the DRAM usage by 75 percent.