Hai Liu

Dr. Hai Liu

Department of Computing, The Hang Seng University of Hong Kong, Hongkong, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
8 June 2022 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
QWQiang Wang
Qiang Wang
XMXinxin Mei
Xinxin Mei
HLHai Liu
Hai Liu
YLYiu-Wing Leung
Yiu-Wing Leung
ZLZongpeng Li
Zongpeng Li
XCXiaowen Chu
Xiaowen Chu
Energy conservation of large data centers for high performance computing workloads, such as deep learning with Big Data, is of critical significance, where cutting down a few percent of electricity translates into million-dollar savings. This work studies energy conservation on emerging CPU-GPU hybrid clusters through dynamic voltage and frequency scaling (DVFS). We aim at minimizing the total energy consumption of processing a batch of offline tasks or a sequence of real-time tasks under deadline constraints. We derive a fast and accurate analytical model to compute the appropriate voltage/frequency setting for each task, and assign multiple tasks to the cluster with heuristic scheduling algorithms. In particular, our model stresses the nonlinear relationship between task execution time and processor speed for GPU-accelerated applications, for more accurately capturing real-world GPU energy consumption. In performance evaluation driven by real-world power measurement traces, our scheduling algorithm shows comparable energy savings to the theoretical upper bound. With a GPU scaling interval where analytically at most 36% of energy can be saved, we record 33-35% of energy savings. Our results are applicable to energy management on modern heterogeneous clusters.

12 September 2023 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
QZQianru Zhou
Qianru Zhou
HLHai Liu
Hai Liu
BCBaolei Cheng
Baolei Cheng
YWYan Wang
Yan Wang
YHYuejuan Han
Yuejuan Han
JFJianxi Fan
Jianxi Fan

30 July 2020 in Mobile Networks and Applications
Verified
Journal Article
Closed access
PDF file
WWWai Kit Wong
Wai Kit Wong
SYShujin Ye
Shujin Ye
HLHai Liu
Hai Liu
YWYue Wang
Yue Wang

20 August 2025 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
HLHai Liu
Hai Liu
SYShujin Ye
Shujin Ye
YMYu Tak Ma
Yu Tak Ma
YWYue Wang
Yue Wang
TCTse-Tin Chan
Tse-Tin Chan
With the rapid advancement of robotics technologies, a group of robots are able to communicate with one another by wireless transmissions and form a robot swarm. Robot swarm has many applications and a typical one is target search in which swarm robots are sent to places that might be dangerous for human workers, and they coordinate with one another to search for targets such as survivors in a disaster. However, motion coordination of swarm robots for target search has received little attention especially when the targets are mobile. In this work, we develop a motion coordination algorithm for swarm robots to search for targets in an unknown area. Our basic idea is to divide the search area into grids and build a gray-scale map in which each grid is associated with a gray scale indicating the efficiency of searching targets in this grid. The Voronoi diagram is adopted to coordinate swarm robots to search different portions of the search area for maximizing search efficiency. By theoretical analysis, our motion coordination algorithm is validated to ensure that all static targets are guaranteed to be found. We derive an upper-bound on the total time for robots to traverse all the grids in the search area. Extensive simulations are conducted and the results show that the proposed motion coordination algorithm outperforms the state-of-the-art and achieves a success rate of over 90% in finding all mobile targets with low search latency.

15 August 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
QZQianru Zhou
Qianru Zhou
BYBai Yin
Bai Yin
BCBaolei Cheng
Baolei Cheng
YWYan Wang
Yan Wang
HLHai Liu
Hai Liu
JFJianxi Fan
Jianxi Fan
Large-scale parallel and distributed applications and platforms rely heavily on high-performance network architectures, which greatly emphasize factors including network latency, bandwidth, communication reliability (e.g., connectivity and fault-tolerant routing), etc. Due to the expansion of network scales and the increase of component failures, the demand for the network’s high reliability has grown substantially. Enhancing fault tolerance is the key to improving the network’s reliability, which can be achieved by establishing the connectivity under the “ $g$ -good-neighbor condition”. In the presence of component failures, to maintain normal network operation and minimize communication delays, effective fault-tolerant routing strategies are required. This paper proposes a new class of recursive networks with small diameter, named generalized recursive match networks (GRMNs). GRMNs include well-known networks like generalized hypercubes, BC networks, BCube, HyperX, FBFLY, 2DFB, etc, and other future networks. We investigate the classical connectivity and $g$ -good-neighbor connectivity ( $g\geq 0$ ) of the GRMN. In addition, we present an $O(N)$ fault-tolerant unicast routing algorithm with the $g$ -good-neighbor faulty set, called F-TRouting, where N is the number of edges in the GRMN. The algorithm and results can be directly applied to all networks falling within the description of GRMNs, including generalized hypercubes, BC networks, BCube, HyperX, FBFLY, 2DFB, and other future networks. Finally, we give simulation experiment results on the performances of the GRMN and the F-TRouting algorithm, which demonstrate that the GRMN and the F-TRouting have advantageous performances.

28 May 2025 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
XLXiaoqing Liu
Xiaoqing Liu
HLHai Liu
Hai Liu
YWYan Wang
Yan Wang
BCBaolei Cheng
Baolei Cheng
JFJianxi Fan
Jianxi Fan
GWGuijuan Wang
Guijuan Wang
It is widely known that parallel and distributed systems are crucial technologies and platforms necessary to support supercomputing and cloud computing. The network architecture forms the foundational support for the stable operation of these systems, directly influencing their reliability, scalability, and robustness. As the network scale expands, the probability of processor/server and communication link failures increases. Therefore, it is imminent to consider how to build up the fault tolerance and reliability of the network. The circulant-based recursive networks (CRNs) are a novel type of network with several desirable properties such as regularity, recursiveness, vertex (edge) transitivity and so on. CRNs contain not only interconnection networks hypercubes and $k$-ary $n$-cubes, but also data center network BCube, as well as some future networks. Connectivity and diagnosability of networks have garnered significant attention, as they suffice for analyzing and measuring networks' fault tolerance. This article focuses primarily on conditional connectivity and diagnosability under the good neighbor fault pattern. In this work, we explore the conditional connectivity and diagnosability (built on $g$-good neighbor fault pattern) of the $f$-dimensional $r$-order CRN under the PMC model and MM* model, respectively. These values are nearly $g$ times greater than the traditional connectivity and diagnosability of CRNs, respectively, implying that they can further improve fault tolerance of CRNs. Furthermore, it is worth noting that the results can be effectively utilized in BCube and other future networks given that they are both subclasses of CRNs.