Classification and Performance Study of Task Scheduling Algorithms in Cloud Computing Environment

Cloud computing is becoming very common in recent years and is growing rapidly due to its attractive benefits and features such as resource pooling, accessibility, availability, scalability, reliability, cost saving, security, flexibility, on-demand services, pay-per-use services, use from anywhere, quality of service, resilience, etc. With this rapid growth of cloud computing, there may exist too many users that require services or need to execute their tasks simultaneously by resources provided by service providers. To get these services with the best performance, and minimum cost, response time, makespan, effective use of resources, etc. an intelligent and efficient task scheduling technique is required and considered as one of the main and essential issues in the cloud computing environment. It is necessary for allocating tasks to the proper cloud resources and optimizing the overall system performance. To this end, researchers put huge efforts to develop several classes of scheduling algorithms to be suitable for the various computing environments and to satisfy the needs of the various types of individuals and organizations. This research article provides a classification of proposed scheduling strategies and developed algorithms in cloud computing environment along with the evaluation of their performance. A comparison of the performance of these algorithms with existing ones is also given. Additionally, the future research work in the reviewed articles (if available) is also pointed out. This research work includes a review of 88 task scheduling algorithms in cloud computing environment distributed over the seven scheduling classes suggested in this study. Each article deals with a novel scheduling technique and the performance improvement it introduces compared with previously existing task scheduling algorithms. Keywords: Cloud computing, Task scheduling, Load balancing, Makespan, Energy-aware, Turnaround time, Response time, Cost of task, QoS, Multi-objective. DOI: 10.7176/IKM/12-5-03 Publication date:September 30th 2022

Optimization grid scheduling with priority base and bees algorithm

Grid computing depends upon sharing large-scales in a network that is widely connected within itself such as the Internet. Therefore, many grid computing researchers and scholars have focused on task scheduling, which is considered one of the NP-Complete issues. The main aim of this current research to propose an optimization of the initial scheduler for grid computing using the bees algorithm. Modern algorithms informed this research. The suggested procedure means that a newly developed algorithm can implement the schedule grid task while accounting for priorities and deadlines to decrease the completion time required for the tasks. The average waiting time of the grid environment can be minimized, and this minimization, in turn, creates an increase in the throughput of the environment

An improved dynamic load balancing for virtualmachines in cloud computing using hybrid bat and bee colony algorithms

Cloud technology is a utility where different hardware and software resources are accessed on pay-per-user ground base. Most of these resources are available in virtualized form and virtual machine (VM) is one of the main elements of visualization. In virtualization, a physical server changes into the virtual machine (VM) and acts as a physical server. Due to the large number of users sometimes the task sent by the user to cloud causes the VM to be under loaded or overloaded. This system state happens due to poor task allocation process in VM and causes the system failure or user tasks delayed. For the improvement of task allocation, several load balancing techniques are introduced in a cloud but stills the system failure occurs. Therefore, to overcome these problems, this study proposed an improved dynamic load balancing technique known as HBAC algorithm which dynamically allocates task by hybridizing Artificial Bee Colony (ABC) algorithm with Bat algorithm. The proposed HBAC algorithm was tested and compared with other stateof-the-art algorithms on 200 to 2000 even tasks by using CloudSim on standard workload format (SWF) data sets file size (200kb and 400kb). The proposed HBAC showed an improved accuracy rate in task distribution and reduced the makespan of VM in a cloud data center. Based on the ANOVA comparison test results, a 1.25 percent improvement on accuracy and 0.98 percent reduced makespan on task allocation system of VM in cloud computing is observed with the proposed HBAC algorithm

Proceedings of the Second International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2015) Krakow, Poland

Proceedings of: Second International Workshop on Sustainable Ultrascale Computing Systems (NESUS 2015). Krakow (Poland), September 10-11, 2015

Log-Based Session Profiling and Online Behavioral Prediction in E-Commerce Websites

Improvements to customer experience give companies a competitive advantage, as understanding customers' behaviors allows e-commerce companies to enhance their marketing strategies by means of recommendation techniques and the customization of products and services. This is not a simple task, and it becomes more difficult when working with anonymous sessions since no historical information of the user can be applied. In this article, analysis and clustering of the clickstreams of past anonymous sessions are used to synthesize a prediction model based on a neural network. The model allows for prediction of a user's profile after a few clicks of an online anonymous session. This information can be used by the e-commerce's decision system to generate online recommendations and better adapt the offered services to the customer's profile

A Bio-inspired Load Balancing Technique for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) consist of multiple distributed nodes each with limited resources. With their strict resource constraints and application-specific characteristics, WSNs contain many challenging trade-offs. This thesis is concerned with the load balancing of Wireless Sensor Networks (WSNs). We present an approach, inspired by bees’ pheromone propagation mechanism, that allows individual nodes to decide on the execution process locally to solve the trade-off between service availability and energy consumption. We explore the performance consequences of the pheromone-based load balancing approach using a system-level simulator. The effectiveness of the algorithm is evaluated on case studies based on sound sensors with different scenarios of existing approaches on variety of different network topologies. The performance of our approach is dependant on the values chosen for its parameters. As such, we utilise the Simulated Annealing to discover optimal parameter configurations for pheromone-based load balancing technique for any given network schema. Once the parameter values are optimised for the given network topology automatically, we inspect improving the pheromone-based load balancing approach using robotic agents. As cyber-physical systems benefit from the heterogeneity of the hardware components, we introduce the use of pheromone signalling-based robotic guidance that integrates the robotic agents to the existing load balancing approach by guiding the robots into the uncovered area of the sensor field. As such, we maximise the service availability using the robotic agents as well as the sensor nodes