Zhiping Jia

Zhiping Jia

Auto-generated profile, based on publicly available information

Zhiping Jia

Shandong University, Qingdao, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
30 August 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
TWTianyu Wang
Tianyu Wang
QWQian Wang
Qian Wang
ZSZhaoyan Shen
Zhaoyan Shen
ZJZhiping Jia
Zhiping Jia
ZSZili Shao
Zili Shao
Blockchain is starting to be deployed in the Internet of Things (IoT) to enable autonomous device-to-device transactions. However, traditional block-based blockchain techniques, such as Bitcoin and Ethereum, are not suitable for IoT environments due to their low throughput, high computation overhead, and costly transaction fee. To satisfy the requirements of IoT environments, directed-acyclic-graph (DAG)-based approaches, aiming to provide cheap blockchain services with low latency and high throughput, are emerging. This article presents a set of comprehensive experimental studies on IOTA, a representative DAG-based blockchain. We aim to exhibit its unique characteristics mainly from three aspects: 1) performance; 2) security; and 3) system robustness. We have developed a series of benchmark tools and judiciously selected typical configurations to perform experimental examinations with a real private IOTA network. Our studies reveal several interesting findings: 1) the throughput of IOTA is higher than the traditional block-based blockchain but far less than the reported thousands of transactions per second (TPS) in its whitepaper, even with scaling-up configurations; 2) the database query heavily impacts the performance of IOTA, even more than its mining [i.e., Proof of Work (PoW)] process; and 3) the system robustness of IOTA is closely related to the frequency of the incoming transactions while the milestone sent by the centralized coordinator has little effect on the system robustness. We make our benchmark tools public and expect our works can inspire system architects, application designers, and practitioners with new optimization directions and potential application cases for further exploration.

30 July 2024 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
YJYan Jiongcheng
Yan Jiongcheng
CLChanggang Li
Changgang Li
YLYutian Liu
Yutian Liu
Dongxiao YuDongxiao Yu
Dongxiao Yu
ZJZhiping Jia
Zhiping Jia
Security early warning is crucial for resisting power system risk. To deal with renewable uncertainty, offline trained early-warning models need to be evolved incrementally. Catastrophic forgetting is main obstacle of model evolution. With the evolution times of early-warning models increasing, the capability of existing methods to mitigate catastrophic forgetting gradually decreases. Knowledge distillation can transfer the learned knowledge from the previous model to the updated model. To mitigate catastrophic forgetting, an incremental model evolution method for security early warning based on knowledge distillation and active learning is proposed. First, an incremental style-based generative adversarial network is formulated to generate renewable power scenarios, which utilizes knowledge distillation to retain previously learned knowledge. An improved concept drift detection method is proposed to determine model evolution moment. Then, an incremental deep regression model based on stacked target-related denoising autoencoder and knowledge distillation is constructed to assess system security index. Finally, active learning is deployed to select informative new samples and solve the objective conflict problem of knowledge distillation. Simulation results of a provincial grid in China demonstrate that proposed method can constantly improve early warning accuracy and effectively retain knowledge learned by previous samples. The proposed method can improve the adaptability of early-warning models to actual power system operating conditions, which enhances the intelligence level of security analysis to copy with renewable uncertainty.

18 July 2018 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
LJLei Ju
Lei Ju
XSXiaojin Sui
Xiaojin Sui
SLShiqing Li
Shiqing Li
Mengying ZhaoMengying Zhao
Mengying Zhao
CXChun Jason Xue
Chun Jason Xue
ZJZhiping Jia
Zhiping Jia
The capacity of SRAM-based FPGA block RAM (BRAM) is restrained by the low density and high leakage power of the current CMOS technology. In this paper, we propose a nonvolatile memory (NVM)-based BRAM architecture which enables flexible conversions between single-level cell (SLC) and multilevel cell (MLC) states. We show that despite the high per-access latency and power consumption, MLC-based BRAM blocks reduce the routing cost between logic units and on-chip data storages, which potentially leads to a smaller critical path delay and power consumption. Therefore, we propose an NVM BRAM architecture and an EDA framework which adaptively packs data into SLC- or MLC-state BRAMs during FPGA design flow in order to achieve better system performance. This paper illustrates that a simple memory device replacement from SRAM to NVM leads to nonoptimal system performance. On the other hand, compared with operating all NVM BRAM blocks in the SLC state with better per-access latency and power consumption, the proposed hybrid SLC-MLC architecture and design flow improves the critical path delay by 18.51%, with a system power reduction of 25.83% at the same time. Moreover, compared with the traditional “fast” SRAM-based BRAM blocks under the same BRAM area constraint, our hybrid NVM BRAM architecture improves the critical path delay by 8.55% on average, with an average system power reduction of 54.34% at the same time.

1 November 2018 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
WSWeining Song
Weining Song
YZYang Zhou
Yang Zhou
Mengying ZhaoMengying Zhao
Mengying Zhao
LJLei Ju
Lei Ju
CXChun Jason Xue
Chun Jason Xue
ZJZhiping Jia
Zhiping Jia
Wearable, implantable and Internet of Things devices are attracting increasing attention from both research and industry fields. Energy harvesting is a promising alternative of battery to power these embedded systems. However, the intrinsic instability of energy harvesting systems leads to potential frequent power interruptions. In traditional volatile processor, all the status will be lost at power failures and the program needs to re-start after power resumes. In order to survive the power failures and enable accumulative execution, non-volatile processor (NVP) is proposed to back up volatile information before power depletion and recover the system status after power resumes. Non-volatile memory (NVM) is typically attached for cache and main memory backup. There are researches working on optimization of the backup. However, little of them involve multiple level cell (MLC) NVM. In this work, we first discuss the benefit of applying MLC NVM for cache backup and the architecture of morphable hybrid cache, and then propose a three-stage energy-aware cache management strategy to improve the system performance and energy utilization while guaranteeing successful backups. Backup-aware cache replacement policies are also developed for backup optimization. Evaluation shows that the proposed EMC scheme can achieve 10.6 percent performance improvement and simultaneous 25.2 percent energy reduction when compared with the single level cell (SLC) based hybrid cache.

20 September 2023 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
ZSZhaoyan Shen
Zhaoyan Shen
QTQingxiang Tang
Qingxiang Tang
TZTianren Zhou
Tianren Zhou
YZYuhao Zhang
Yuhao Zhang
ZJZhiping Jia
Zhiping Jia
BLBingzhe Li
Bingzhe Li
With the increment of data sets and models sizes, distributed deep learning has been proposed to accelerate training and improve the accuracy of DNN models. The parameter server framework is a popular collaborative architecture for data-parallel training, which works well for homogeneous environments by properly aggregating the computation/communication capabilities of different workers. However, in heterogeneous environments, the resources of different workers vary a lot. Some stragglers may seriously limit the whole speed, which impacts the overall training process. In this paper, we propose an adaptive multi-stage distributed deep learning training framework, named ASHL, for heterogeneous environments. First, a profiling scheme is proposed to capture the capabilities of each worker to reasonably plan the training and communication tasks on each worker, and lay the foundation for the formal training. Second, a hybrid-mode training scheme (i.e., coarse-grained and fined-grained training) is proposed to balance the model accuracy and training speed. The coarse-grained training scheme (named AHL) adopts an asynchronous communication strategy, which involves less frequent communications. Its main goal is to make the model quickly converge to a certain level. The fine-grained training stage (named SHL) uses a semi-asynchronous communication strategy and adopts a high communication frequency. Its main goal is to improve the model convergence effect. Finally, a compression-based communication scheme is proposed to further increase the communication efficiency of the training process. Our experimental results show that ASHL reduces the overall training time by more than 35% to converge to the same degree and has better generalization ability compared with state-of-the-art schemes like ADSP.

2 May 2016 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
MZMengying Zhao
Mengying Zhao
YXYuan Xue
Yuan Xue
Jingtong HuJingtong Hu
Jingtong Hu
CYChengmo Yang
Chengmo Yang
TLTiantian Liu
Tiantian Liu
CXChun Jason Xue
Chun Jason Xue
Phase change memory (PCM) is one of the most promising candidates to replace DRAM as main memory in deep submicron regime. Regardless of single-level or multiple-level cells, the programming costs to each state exhibit significant asymmetries in latency, energy and endurance. In this paper, we exploit the potential of reducing programming costs in terms of latency, energy, and endurance for PCM through state remapping. First, quantitative programming models are constructed for cost assessments. Then, both dynamic and static remapping schemes are analyzed and compared. The observation that the efficacy of dynamic state remappings is instable motivates us to propose a static remapping technique, which outperforms previous work in cost reduction within much lower implementation overhead. The optimality of the proposed static state remapping is also proved. The evaluation results confirm the efficacy of the proposed state remapping technique in delivering a stable and promising cost reduction in latency, energy, and wear.