activity
20122021
most citedDeep Reinforcement Learning-based Methods for Resource Scheduling in Cloud Computing: A Review and Future Directions

204 citations · 503 across the 18 of their papers we have counts for

collaborators

18 papers

cs.DC2021★ 1 cited

Prepartition: Load Balancing Approach for Virtual Machine Reservations in a Cloud Data Center

Wenhong Tian, Minxian Xu, Guangyao Zhou +3

Load balancing is vital for the efficient and long-term operation of cloud data centers. With virtualization, post (reactive) migration of virtual machines after allocation is the…

cs.DC2021★ 1 cited

Machine Learning (ML)-Centric Resource Management in Cloud Computing: A Review and Future Directions

Tahseen Khan, Wenhong Tian, Rajkumar Buyya

Cloud computing has rapidly emerged as model for delivering Internet-based utility computing services. In cloud computing, Infrastructure as a Service (IaaS) is one of the most imp…

cs.DC2021★ 204 cited

Deep Reinforcement Learning-based Methods for Resource Scheduling in Cloud Computing: A Review and Future Directions

Guangyao Zhou, Wenhong Tian, Rajkumar Buyya +2

As the quantity and complexity of information processed by software systems increase, large-scale software systems have an increasing requirement for high-performance distributed c…

cs.DC2020★ 3 cited

Energy Efficient Algorithms based on VM Consolidation for Cloud Computing: Comparisons and Evaluations

Qiheng Zhou, Minxian Xu, Sukhpal Singh Gill +4

Cloud Computing paradigm has revolutionized IT industry and be able to offer computing as the fifth utility. With the pay-as-you-go model, cloud computing enables to offer the reso…

cs.AI2018★ 11 cited

A New Approach for Resource Scheduling with Deep Reinforcement Learning

Yufei Ye, Xiaoqin Ren, Jin Wang +4

With the rapid development of deep learning, deep reinforcement learning (DRL) began to appear in the field of resource scheduling in recent years. Based on the previous research o…

cs.CC2018

An Efficient Method to Transform SAT problems to Binary Integer Linear Programming Problem

Wenxia Guo, Jin Wang, Majun He +3

In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. Although a solution to a NP-complete can be verified quickly, there is no k…

cs.DS2016

On Equivalent Color Transform and Four Coloring Theorem

Wenhong Tian

In this paper, we apply an equivalent color transform (ECT) for a minimal -coloring of any graph . It contracts each color class of the graph to a single vertex and produces…

cs.DC2016★ 180 cited

A Survey on Load Balancing Algorithms for VM Placement in Cloud Computing

Minxian Xu, Wenhong Tian, Rajkumar Buyya

The emergence of cloud computing based on virtualization technologies brings huge opportunities to host virtual resource at low cost without the need of owning any infrastructure.…

cs.DS2016

On Polynomial Time Approximation Bounded Solution for TSP and NP Complete Problems

Wenhong Tian

The question of whether all problems in NP class are also in P class is generally considered one of the most important open questions in mathematics and theoretical computer scienc…

cs.DC2016

Self-Adaptive Consolidation of Virtual Machines For Energy-Efficiency in the Cloud

Guozhong Li, Yaqiu Jiang, Wutong Yang +2

In virtualized data centers, consolidation of Virtual Machines (VMs) on minimizing the number of total physical machines (PMs) has been recognized as a very efficient approach. Thi…

cs.DS2016★ 4 cited

On Dynamic Job Ordering and Slot Configurations for Minimizing the Makespan Of Multiple MapReduce Jobs

Wenhong Tian, Guangchun Luo, Ling Tian +1

MapReduce is a popular parallel computing paradigm for Big Data processing in clusters and data centers. It is observed that different job execution orders and MapReduce slot confi…

cs.DC2015★ 10 cited

CloudSimNFV: Modeling and Simulation of Energy-Efficient NFV in Cloud Data Centers

Wutong Yang, Minxian Xu, Guozhong Li +1

Network Function Virtualization (NFV) takes advantage of hardware virtualization to undertake software processing for various functions, and complements the drawbacks of traditiona…

cs.DC2015

Prepartition: Paradigm for the Load Balance of Virtual Machine Allocation in Data Centers

Minxian Xu, Guangchun Luo, Ling Tian +4

It is significant to apply load-balancing strategy to improve the performance and reliability of resource in data centers. One of the challenging scheduling problems in Cloud data…

cs.DC2015★ 51 cited

Open-Source Simulators for Cloud Computing: Comparative Study and Challenging Issues

Wenhong Tian, Minxian Xu, Aiguo Chen +3

Resource scheduling in infrastructure as a service (IaaS) is one of the keys for large-scale Cloud applications. Extensive research on all issues in real environment is extremely d…

cs.CC2015★ 1 cited

Transforming NP to P: An Approach to Solve NP Complete Problems

Wenhong Tian, GuoZhong Li, Xinyang Wang +2

NP complete problem is one of the most challenging issues. The question of whether all problems in NP are also in P is generally considered one of the most important open questions…

cs.DS2015★ 5 cited

Obtaining Quality-Proved Near Optimal Results for Traveling Salesman Problem

Wenhong Tian, Chaojie Huang, Xinyang Wang +1

The traveling salesman problem (TSP) is one of the most challenging NP-hard problems. It has widely applications in various disciplines such as physics, biology, computer science a…

cs.DC2015★ 4 cited

FlexCloud: A Flexible and Extendible Simulator for Performance Evaluation of Virtual Machine Allocation

Minxian Xu, Wenhong Tian, Xinyang Wang +1

Cloud Data centers aim to provide reliable, sustainable and scalable services for all kinds of applications. Resource scheduling is one of keys to cloud services. To model and eval…

cs.DC2012★ 28 cited

Enhanced Load Balancing Approach to Avoid Deadlocks in Cloud

K. S. Rashmi, V. Suma, M. Vaidehi

The state-of-art of the technology focuses on data processing to deal with massive amount of data. Cloud computing is an emerging technology, which enables one to accomplish the af…