Congfeng JIANG

Congfeng JIANG

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
30 August 2019 in IEEE Access
Verified
Journal Article
Open access
CJCongfeng JIANG
Congfeng JIANG
XCXiaolan Cheng
Xiaolan Cheng
Honghao GaoHonghao Gao
Honghao Gao
XZXin Zhou
Xin Zhou
JWJian Wan
Jian Wan
The explosive growth of massive data generation from Internet of Things in industrial, agricultural and scientific communities has led to a rapid increase for data analytics in cloud data centers. The ubiquitous and pervasive demand for near-data processing urges the edge computing paradigm in recent years. Edge computing is promising for less network backbone bandwidth usage and thus less data center side processing pressure, as well as enhanced service responsiveness and data privacy protection. Computation offloading plays a crucial role in edge computing in terms of network packets transmission and system responsiveness through dynamic task partitioning between cloud data centers and edge servers and edge devices. In this paper a thorough literature review is conducted to reveal the state-of-the-art of computation offloading in edge computing. Various aspects of computation offloading, including energy consumption minimization, Quality of Services guarantee, and Quality of Experiences enhancement are surveyed. Moreover, resource scheduling approaches, gaming and tradeoffing among system performance and overheads for computation offloading decision making are also reviewed.

6 August 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
Wenbing ZhaoWenbing Zhao
Wenbing Zhao
CJCongfeng JIANG
Congfeng JIANG
Honghao GaoHonghao Gao
Honghao Gao
SYShunkun Yang
Shunkun Yang
Xiong LuoXiong Luo
Xiong Luo
In this article, we provide a concise but systematic review on blockchain-enabled cyber-physical systems (CPS). We dissect various blockchain-enabled CPS as reported in the literature in terms of their operations and the features of blockchain that have been used. We identify key common CPS operations that can be enabled by blockchain, and classify them in terms of their time sensitivity and throughput requirements. We also elaborate and classify features of blockchain in terms of different levels of benefits to CPS, including security, privacy, immutability, fault tolerance, interoperability, data provenance, atomicity, automation, data/service sharing, and trust. Finally, we point out two primary open research issues for developing blockchain-enabled CPS, namely, excessive delay in reaching consensus and limited throughput, and outline future research directions.

6 February 2019 in IEEE Access
Verified
Journal Article
Open access
CJCongfeng JIANG
Congfeng JIANG
Guangjie HanGuangjie Han
Guangjie Han
JLJiangbin Lin
Jiangbin Lin
GJGangyong Jia
Gangyong Jia
WSWeisong Shi
Weisong Shi
JWJian Wan
Jian Wan
In order to reduce power and energy costs, giant cloud providers now mix online and batch jobs on the same cluster. Although the co-allocation of such jobs improves machine utilization, it challenges the data center scheduler and workload assignment in terms of quality of service, fault tolerance, and failure recovery, especially for latency critical online services. In this paper, we explore various characteristics of co-allocated online services and batch jobs from a production cluster containing 1.3k servers in Alibaba Cloud. From the trace data we find the following:(1) For batch jobs with multiple tasks and instances, 50.8% failed tasks wait and halted after a very long time interval when their first and the only one instance fails. This wastes much time and resources as the remaining instances are running for an impossible successful termination. (2) For online services jobs, they are clustered in 25 categories according to their requested CPU, memory, and disk resources. Such clustering can help co-allocation of online services jobs with batch jobs. (3) Servers are clustered into 7 groups by CPU utilization, memory utilization, and their correlations. Machines with strong correlation between CPU and memory utilization provides opportunity for job co-allocation and resource utilization estimation. (4) The MTBF (mean time between failures) of instances are in the interval [400, 800] seconds while the average completion time of the 99th percentile is 1003 seconds. We also compare the cumulative distribution functions of jobs and servers and explain the differences and opportunities for workload assignment between them. Our findings and insights presented in this paper can help the community and data center operators better understand the workload characteristics, improve resource utilization, and failure recovery design.

28 October 2020 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
CJCongfeng JIANG
Congfeng JIANG
YQYitao Qiu
Yitao Qiu
WSWeisong Shi
Weisong Shi
ZGZhefeng Ge
Zhefeng Ge
JWJiwei Wang
Jiwei Wang
JLJiangbin Lin
Jiangbin Lin
Workload characteristics are vital for both data center operation and job scheduling in co-located data centers, where online services and batch jobs are deployed on the same production cluster. In this paper, a comprehensive analysis is conducted on Alibaba‘s cluster-trace-v2018 of a production cluster of 4034 machines. The findings and insights are the following: (1) The workload on the production cluster poses a daily cyclical fluctuation, in terms of CPU and disk I/O utilization, and the memory system has become the performance bottleneck of a co-located cluster. (2) Batch jobs including their tasks and derived instances can be approximated as Zipf distribution. However, for all batch jobs with directed acyclic graph dependency, they suffer from co-location with online services since the online services are highly prioritized. (3) The resource usages of containers have similar cyclical fluctuation consistent with the whole cluster, while their memory usages remain approximately constant. (4) The number of batch jobs co-located with online services is dependent on the mispredictions per kilo instructions of online services. In order to guarantee the QoS of online services, when the MPKI of online services rises, the number of batch jobs to be co-located on the same machine should decrease.

17 February 2019 in Energies
Verified
Journal Article
Open access
PDF file
YQYeliang Qiu
Yeliang Qiu
CJCongfeng JIANG
Congfeng JIANG
YWYumei Wang
Yumei Wang
DODongyang Ou
Dongyang Ou
YLYouhuizi Li
Youhuizi Li
JWJian Wan
Jian Wan
Power consumption is a primary concern in modern servers and data centers. Due to varying in workload types and intensities, different servers may have a different energy efficiency (EE) and energy proportionality (EP) even while having the same hardware configuration (i.e., central processing unit (CPU) generation and memory installation). For example, CPU frequency scaling and memory modules voltage scaling can significantly affect the server’s energy efficiency. In conventional virtualized data centers, the virtual machine (VM) scheduler packs VMs to servers until they saturate, without considering their energy efficiency and EP differences. In this paper we propose EASE, the Energy efficiency and proportionality Aware VM SchEduling framework containing data collection and scheduling algorithms. In the EASE framework, each server’s energy efficiency and EP characteristics are first identified by executing customized computing intensive, memory intensive, and hybrid benchmarks. Servers will be labelled and categorized with their affinity for different incoming requests according to their EP and EE characteristics. Then for each VM, EASE will undergo workload characterization procedure by tracing and monitoring their resource usage including CPU, memory, disk, and network and determine whether it is computing intensive, memory intensive, or a hybrid workload. Finally, EASE schedules VMs to servers by matching the VM’s workload type and the server’s EP and EE preference. The rationale of EASE is to schedule VMs to servers to keep them working around their peak energy efficiency point, i.e., the near optimal working range. When workload fluctuates, EASE re-schedules or migrates VMs to other servers to make sure that all the servers are running as near their optimal working range as they possibly can. The experimental results on real clusters show that EASE can save servers’ power consumption as much as 37.07%–49.98% in both homogeneous and heterogeneous clusters, while the average completion time of the computing intensive VMs increases only 0.31%–8.49%. In the heterogeneous nodes, the power consumption of the computing intensive VMs can be reduced by 44.22%. The job completion time can be saved by 53.80%.

5 September 2019 in IEEE Access
Verified
Journal Article
Open access
CJCongfeng JIANG
Congfeng JIANG
YQYeliang Qiu
Yeliang Qiu
Honghao GaoHonghao Gao
Honghao Gao
TFTiantian Fan
Tiantian Fan
KLKangkang Li
Kangkang Li
JWJian Wan
Jian Wan
The increasing demand for cloud-based services, such as big data analytics and online e-commerce, leads to rapid growth of large-scale internet data centers. In order to provide highly reliable, cost effective, and high quality cloud services, data centers are equipped with sensors to monitor the operational states of infrastructure hardware, such as servers, storage arrays, networking devices, and computer room air conditioning systems. However, such coarse grained monitoring cannot provide fine grained real time information for resource multiplexing and job scheduling. Moreover, the monitoring of node level power consumption plays an important role in the optimization of workload placement and energy efficiency in data centers. In this paper, we propose an edge computing platform for intelligent operational monitoring in data centers. The platform integrates wireless sensors and on-board built-in sensors to collect data during the operation and maintenance of data centers. Using logical functions, we divide the data center clusters into grids, and then deploy wireless sensors and edge servers in each grid. As such, data processing on edge servers can reduce the latency in data transmission to central clouds and thereby enhance the real time resource mapping decisions in data centers. In addition, the proposed platform also provides predictions of resource utilization, workload characteristics, and hardware health trends in data centers.