Zhimin Gu

Zhimin Gu

Auto-generated profile, based on publicly available information

Zhimin Gu

Beijing Institute of Technology University

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
24 April 2012 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JTJie Tang
Jie Tang
SLShaoshan Liu
Shaoshan Liu
Chen LiuChen Liu
Chen Liu
ZGZhimin Gu
Zhimin Gu
JGJean-Luc Gaudiot
Jean-Luc Gaudiot
Extensible Markup Language (XML) has become a widely adopted standard for data representation and exchange. However, its features also introduce significant overhead threatening the performance of modern applications. In this paper, we present a study of XML parsing and determine that memory-side data loading in the parsing stage incurs a significant performance overhead, as much as the computation does. Hence, we propose memory-side acceleration which incorporates of data prefetching techniques, and can be applied on top of computation-side acceleration to speed up the XML data parsing. To this end, we study here the impact of our proposed scheme on the performance and energy consumption and demonstrated how it is capable of improving performance by up to 20 percent as well as produce up to 12.77 percent of energy saving when implemented in 32-nm technology. In addition, we implement a prefetcher on an platform in an effort to evaluate its implementation feasibility in terms of area and energy overhead.

1 May 2012
Verified
Conference Paper
Closed access
YHYan Huang
Yan Huang
ZGZhi-Min Gu
Zhi-Min Gu
JTJie Tang
Jie Tang
MCMin Cai
Min Cai
JZJianxun Zhang
Jianxun Zhang
NZNinghan Zheng
Ninghan Zheng
Threaded prefetching based on Chip Multiprocessor (CMP) issues memory requests for data needed later by the main computation, and therefore may lead to increased stress on limited shared cache space and bus bandwidth. In our earlier work, we had proposed an effective threaded prefetching technique that selects proper prefetch distance for specific application to improve the timeliness of prefetching. In this paper, we first estimate the upper limit of prefetch distance for specific application in our proposed threaded prefetching technique, and then analyze the effect of increasing prefetch distance on shared cache pollution. Our experimental evaluations indicated that the bounded range of effective prefetch distance can be determined using our method, and the shared cache pollution can be reduced by controlling prefetch distance in our proposed threaded prefetching technique.

19 September 2017
Verified
Book Chapter
Open access
PDF file
BWBo Wang
Bo Wang
JTJie Tang
Jie Tang
RZRui Zhang
Rui Zhang
ZGZhimin Gu
Zhimin Gu
To improve system performance, Spark places the RDDs into memory for further access through the caching mechanism. And it provides a variety of storage levels to put cache RDDs. However, the RDD-grained manual storage level selection mechanism can not adjust depending on computing resources of the node. In this paper, we firstly present a fine-grained automatic storage level selection mechanism. And then we provide a storage level for a partition based on a cost model which fully considering the system resources status, compression and serialization costs. Experiments show that our approach can offer a up to 77% performance improvement compared to the default storage level scheme provided by Spark.