Efficient task optimization algorithm for green computing in cloud.

Cloud infrastructure assets are accessed by all hooked heterogeneous network servers and applications to maintain entail reliability towards global subscribers with high performance and low cost is a tedious challenging task. Most of the extant techniques are considered limited constraints like task deadline, which leads Service Level Agreement (SLA) violation. In this manuscript, we develop Hadoop based Task Scheduling (HTS) algorithm which considers a task deadline time, completion time, migration time and future resource availability of each virtual machine. The Intelligent System (IS) enabled with adaptive neural computation method to assess all above attributes. Specifically, the result of Prophecy Resource Availability (PRA) method has been used to assess the status of each Virtual Machine (VM), which helps to streamline the resource wastage and increases the response time with low SLA violation rate

Reinforcement learning based multi core scheduling (RLBMCS) for real time systems

Embedded systems with multi core processors are increasingly popular because of the diversity of applications that can be run on it. In this work, a reinforcement learning based scheduling method is proposed to handle the real time tasks in multi core systems with effective CPU usage and lower response time. The priority of the tasks is varied dynamically to ensure fairness with reinforcement learning based priority assignment and Multi Core MultiLevel Feedback queue (MCMLFQ) to manage the task execution in multi core system

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

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