Xing Ting

Bio: Xing Ting is an academic researcher. The author has contributed to research in topics: Dynamic priority scheduling & Two-level scheduling. The author has an hindex of 1, co-authored 1 publications receiving 23 citations.

Application of adaptive load balancing algorithm based on minimum traffic in cloud computing architecture

Abstract: Cloud computing has officially entered the commercial application stage, which puts forward higher requirements on network load balancing. Leveraging effective load distribution and traffic scheduling algorithm to reasonably allocate the request data between every processing nods to achieve optimal processing capacity of the system is one of the effective ways to improve the utilization of network resources. The unique self-directed learning and reconfiguration capabilities of cognitive network [1] enable the load balancing to become more effective. Based on research of the existing traffic scheduling algorithm, this paper improves the weighted least connections scheduling algorithm, and designs the Adaptive Scheduling Algorithm Based on Minimum Traffic (ASAMT). ASAMT conducts the real-time minimum load scheduling to the node service requests and configures the available idle resources in advance to ensure the service QoS requirements. Being adopted for simulation of the traffic scheduling algorithm, OPNET is applied to the cloud computing architecture. Experimental results show that, under the premise of no large network cost, the load condition of this algorithm is better than that of the unmodified weighted least connection scheduling algorithm.

A Task Scheduling Algorithm With Improved Makespan Based on Prediction of Tasks Computation Time algorithm for Cloud Computing

Abstract: Cloud computing is extensively used in a variety of applications and domains, however task and resource scheduling remains an area that requires improvement. Put simply, in a heterogeneous computing system, task scheduling algorithms, which allow the transfer of incoming tasks to machines, are needed to satisfy high performance data mapping requirements. The appropriate mapping between resources and tasks reduces makespan and maximises resource utilisation. In this contribution, we present a novel scheduling algorithm using Directed Acyclic Graph (DAG) based on the Prediction of Tasks Computation Time algorithm (PTCT) to estimate the preeminent scheduling algorithm for prominent cloud data. In addition, the proposed algorithm provides a significant improvement with respect to the makespan and reduces the computation and complexity via employing Principle Components Analysis (PCA) and reducing the Expected Time to Compute (ETC) matrix. Simulation results confirm the superior performance of the algorithm for heterogeneous systems in terms of efficiency, speedup and schedule length ratio, when compared to the state-of-the-art Min-Min, Max-Min, QoS-Guide and MiM-MaM scheduling algorithms.

Cloud computing using load balancing and service broker policy for IT service: a taxonomy and survey

Abstract: Cloud computing is the big boom technology in IT industry infrastructure. Many people are moving to cloud computing because of dynamic allocation of resources and reduction in cost. Cloud computing delivers infrastructure, software, and platforms as a service to all consumers. But still, it has numerous issues related to performance unpredictability, resource sharing, security, storage capacity, availability of resources on each requirement, data confidentiality and many more. Load balancing and service brokering are the two main key areas, which ensures reliability, scalability, minimize response time, maximize throughput and cost in the cloud environment. These are the main things we have to focus to improve the performance of the computation. This survey paper presents a comparative and comprehensive study of various load balancing algorithm used in the load balancer and brokering policy used for each service and their scheduling types. The objectives of this survey is to (1) Determine, illustrate, compare and analyze newer methods developed for load balancing and service brokering (the most notable problem) by systematically reviewing papers from the year 2015 to 2018; (2) Classify and analyze techniques based on the key parameters in cloud computing techniques; (3) Ultimately set an updated, thorough and rigorous discussion on load balancing and service broker techniques so as to motivate and direct with valuable references for future research development and direction.

A Review on Load Balancing In Cloud Environment

Abstract: Cloud computing is Internet based development and use of computer technology. It is a style of computing in which dynamically scalable and often virtualized resources are provided as a service over the Internet. Users need not have knowledge of, expertise in, or control over the technology infrastructure "in the cloud" that supports them. Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous computing systems. On cloud computing platform, load balancing of the entire system can be dynamically handled by using virtualization technology through which it becomes possible to remap virtual machine and physical resources according to the change in load. However, in order to improve performance, the virtual machines have to fully utilize its resources and services by adapting to computing environment dynamically. The load balancing with proper allocation of resources must be guaranteed in order to improve resource utility.

A novel approach of optimizing performance using k-means clustering in cloud computing

Abstract: Cloud computing is distributed computing, storing, sharing and accessing data over the Internet. It provides a pool of shared resources to the users available on the basis of pay as you go service that means users pay only for those services which are used by him according to their access times. Load balancing ensures that no single node will be overloaded and used to distribute workload among multiple nodes. It helps to improve system performance and proper utilization of resources. We propose an improved load balancing algorithm for job scheduling in the cloud environment using K-Means clustering of cloudlets and virtual machines in the cloud environment. All the cloudlets given by the user are divided into 3 clusters depending upon client’s priority, cost and instruction length of the cloudlet. The virtual machines inside the datacenter hosts are also grouped into multiple clusters depending upon virtual machine capacity in terms of processor, memory, and bandwidth. Sorting is applied at both the ends to reduce the latency. Multiple number of experiments have been conducted by taking different configurations of cloudlets and virtual machine. Various parameters like waiting time, execution time, turnaround time and the usage cost have been computed inside the cloudsim environment to demonstrate the results. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results.