Xiaojin Ma

Xiaojin Ma

Auto-generated profile, based on publicly available information

Xiaojin Ma

School of Computer Engineering and Science, Shanghai University, Shanghai, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
22 March 2021 in IEEE Transactions on Green Communications and Networking
Verified
Journal Article
Closed access
YHYuzhe Huang
Yuzhe Huang
HXHuahu Xu
Huahu Xu
Honghao GaoHonghao Gao
Honghao Gao
XMXiaojin Ma
Xiaojin Ma
WHWalayat Hussain
Walayat Hussain
Cloud data centers provide services for an increasing number of applications. The virtual machines (VMs) that perform the corresponding application tasks need to be allocated to physical machines (PMs). For VM allocation, cloud service centers consider both energy consumption and quality of service (QoS), while cloud users are primarily concerned with their own needs, such as throughput and reliability. This paper proposes an allocation scheme for optimization based on user requirements in a cloud data center. First, various application requests from mobile phones and devices, which are regarded as a group of VM lists in the data center, are submitted to the cloud platform. Our method first allocates these arriving VMs to appropriate PMs based on their usage of hardware resources and the current throughput of the PMs in the data center. Second, due to dynamic workloads, the loads of the PMs that host these VMs may become very high. CPU utilization thresholds are set to determine whether migration is required, and the energy consumption before and after allocation is used to choose which VMs are reallocated. A suitable strategy for VM migration and PM shutdown can improve reliability and reduce energy consumption. Finally, it is shown through experimental simulations that compared with two existing algorithms, on the premise that the user requirements are met, the proposed method offers good performance in terms of total energy consumption, CPU utilization, number of PMs used and number of service-level agreement (SLA) violation.

8 November 2019 in EURASIP Journal on Wireless Communications and Networking
Verified
Journal Article
Open access
PDF file
XMXiaojin Ma
Xiaojin Ma
Honghao GaoHonghao Gao
Honghao Gao
HXHuahu Xu
Huahu Xu
MBMinjie Bian
Minjie Bian
Large-scale applications of Internet of things (IoT), which require considerable computing tasks and storage resources, are increasingly deployed in cloud environments. Compared with the traditional computing model, characteristics of the cloud such as pay-as-you-go, unlimited expansion, and dynamic acquisition represent different conveniences for these applications using the IoT architecture. One of the major challenges is to satisfy the quality of service requirements while assigning resources to tasks. In this paper, we propose a deadline and cost-aware scheduling algorithm that minimizes the execution cost of a workflow under deadline constraints in the infrastructure as a service (IaaS) model. Considering the virtual machine (VM) performance variation and acquisition delay, we first divide tasks into different levels according to the topological structure so that no dependency exists between tasks at the same level. Three strings are used to code the genes in the proposed algorithm to better reflect the heterogeneous and resilient characteristics of cloud environments. Then, HEFT is used to generate individuals with the minimum completion time and cost. Novel schemes are developed for crossover and mutation to increase the diversity of the solutions. Based on this process, a task scheduling method that considers cost and deadlines is proposed. Experiments on workflows that simulate the structured tasks of the IoT demonstrate that our algorithm achieves a high success rate and performs well compared to state-of-the-art algorithms.

8 November 2021 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
XMXiaojin Ma
Xiaojin Ma
HXHuahu Xu
Huahu Xu
Honghao GaoHonghao Gao
Honghao Gao
MBMinjie Bian
Minjie Bian
With the development of cloud computing, an increasing number of applications in different fields have been deployed to the cloud. In this process, the real-time scheduling of multiple workflows composed of tasks from these different applications must consider various influencing factors that strongly affect scheduling performance. This paper proposes a real-time multiple-workflow scheduling (RMWS) scheme to schedule workflows dynamically with minimum cost under different deadline constraints. Due to the uncertainty of workflow arrival time and specification, RMWS dynamically allocates tasks and divides the scheduling process into three stages. First, when a new workflow arrives, the latest start time and the latest finish time of each task are calculated according to the deadline, and the subdeadline of each task is obtained by probabilistic upward ranking. Then, each ready task is allocated according to its subdeadline and the increased cost of the virtual machine (VM). Meanwhile, only one waiting task can be assigned to each VM to reduce delay fluctuations. Finally, when the task is completed on the assigned VM, all the parameters of the relevant tasks are updated before allocating them to appropriate VMs. The experimental results based on four real-world workflow traces show that the proposed algorithm is superior to two state-of-the-art algorithms in terms of total rental cost, resource utilization, success rate and deadline deviation under different conditions.

4 October 2022 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
XMXiaojin Ma
Xiaojin Ma
HXHuahu Xu
Huahu Xu
HGHonghao Gao
Honghao Gao
MBMinjie Bian
Minjie Bian
WHWalayat Hussain
Walayat Hussain
The widespread adoption of Industrial Internet of Things (IIoT)-based applications has driven the emergence and development of cloud-related computing paradigms with the ability to seamlessly leverage cloud resources. Heterogeneous resources, mobility factors in IoT, and dynamic behavior make it challenging for the corresponding virtual machine (VM) scheduling problem to address the processing effectiveness of application requests in these kinds of cloud environments. Based on reinforcement learning theory, this article proposes an online VM scheduling scheme (OSEC) for joint energy consumption and cost optimization that divides the scheduling process into two parts: VM allocation and VM migration. First, all the VMs and the physical machines (PMs) are regarded as a set of states and actions in the cloud environment, and the Q-learning feedback is used to achieve the iterative computation of Q-values to obtain the optimal parallel allocation sequence for multiple VMs. Then, VMs are migrated among the active PMs according to a grouping policy and the best-fit principle to achieve dynamic consolidation of the resources in the data center. Finally, experimental results show that compared with state-of-the-art algorithms under different conditions, the proposed method reduces energy consumption by approximately 18.25%, VM execution costs by approximately 21.34%, and service level agreement (SLA) violations by approximately 90.51%.

30 August 2022 in Future Internet
Verified
Journal Article
Open access
PDF file
HZhongtao zhu
hongtao zhu
HXHuahu Xu
Huahu Xu
XMXiaojin Ma
Xiaojin Ma
MBMinjie Bian
Minjie Bian
Facial Expression Recognition (FER) can achieve an understanding of the emotional changes of a specific target group. The relatively small dataset related to facial expression recognition and the lack of a high accuracy of expression recognition are both a challenge for researchers. In recent years, with the rapid development of computer technology, especially the great progress of deep learning, more and more convolutional neural networks have been developed for FER research. Most of the convolutional neural performances are not good enough when dealing with the problems of overfitting from too-small datasets and noise, due to expression-independent intra-class differences. In this paper, we propose a Dual Path Stacked Attention Network (DPSAN) to better cope with the above challenges. Firstly, the features of key regions in faces are extracted using segmentation, and irrelevant regions are ignored, which effectively suppresses intra-class differences. Secondly, by providing the global image and segmented local image regions as training data for the integrated dual path model, the overfitting problem of the deep network due to a lack of data can be effectively mitigated. Finally, this paper also designs a stacked attention module to weight the fused feature maps according to the importance of each part for expression recognition. For the cropping scheme, this paper chooses to adopt a cropping method based on the fixed four regions of the face image, to segment out the key image regions and to ignore the irrelevant regions, so as to improve the efficiency of the algorithm computation. The experimental results on the public datasets, CK+ and FERPLUS, demonstrate the effectiveness of DPSAN, and its accuracy reaches the level of current state-of-the-art methods on both CK+ and FERPLUS, with 93.2% and 87.63% accuracy on the CK+ dataset and FERPLUS dataset, respectively.