scholarly journals Independent Task Scheduling in Heterogeneous System

2019 ◽  
Vol 8 (4) ◽  
pp. 10093-10099
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Task Scheduling ◽  
Rapid Development ◽  
Network Connectivity ◽  
Variable Number ◽  
Cloud Infrastructure ◽  
Storage Devices ◽  
Quantum Genetic Algorithm ◽  
Test Scenarios

Recently, the rapid development in processing speeds, fast storage devices and better network connectivity, hasaccelerated the popularization of cloud computing. Cloud computing is an on-demand-servicewhich provides users with high end servers,storage and processing capabilities where the user need not be concerned with its infrastructure.Although, there are abundant resources in the cloud infrastructure, for the efficient working and execution of tasks, task scheduling plays a crucial role. Task scheduling results in better performance (throughput) of the system along with better resource utilization which ultimately results inreduced energy consumption. At any given time, a processor should never be in idle state, as it still consumes some amount of energy. In this paper, the use of Quantum Genetic Algorithm has led to the reduction in energy consumption. The objective is to find a scheduling sequencewhich can be implemented ina cloud computing environment. Along with minimizing energy consumption, the algorithm helps reduce makespan time of a processor as well.The results show a decrease in energy consumption by 10-15% under different test scenarios involving a variable number of tasks, processors, and the number of iterations (generations) for which the algorithm was run. The algorithm converges to the desired result within 10-15 iterations, as can be seen from the results published in this paper.

Task Scheduling of Cloud Computing in Weapon Network System

2014 ◽  
Vol 610 ◽  
pp. 695-698
Author(s):  
Qian Tao ◽  
Bo Pan ◽  
Wen Quan Cui
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Evaluation System ◽  
Large Scale ◽  
Rapid Development ◽  
It Industry ◽  
Control Scheme ◽  
Tasks Scheduling ◽  
Constant Bandwidth

In recent years, the rapid development of cloud computing brings significant innovation in the whole IT industry. For the local tasks scheduling on each computational node of the top model of weapon network, an open task scheduling framework was introduced a task accept control scheme based on the tasks based on load balancing, quality of service (QoS) and an improved constant bandwidth server algorithm was presented. The result of simulation shows that the scheduling policies can improve the schedule speed when the number of tasks increases and can meet the demand better for the real time requirementsof the tactical training evaluation system for complexity and Large-scale.

Cost-Aware Ant Colony Optimization for Resource Allocation in Cloud Infrastructure

2020 ◽  
Vol 13 (3) ◽  
pp. 326-335
Author(s):  
Punit Gupta ◽  
Ujjwal Goyal ◽  
Vaishali Verma
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Fitness Function ◽  
Low Cost ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Ant Colony ◽  
Cloud Infrastructure ◽  
Network Cost

Background: Cloud Computing is a growing industry for secure and low cost pay per use resources. Efficient resource allocation is the challenging issue in cloud computing environment. Many task scheduling algorithms used to improve the performance of system. It includes ant colony, genetic algorithm & Round Robin improve the performance but these are not cost efficient at the same time. Objective: In early proven task scheduling algorithms network cost are not included but in this proposed ACO network overhead or cost is taken into consideration which thus improves the efficiency of the algorithm as compared to the previous algorithm. Proposed algorithm aims to improve in term of cost and execution time and reduces network cost. Methods: The proposed task scheduling algorithm in cloud uses ACO with network cost and execution cost as a fitness function. This work tries to improve the existing ACO that will give improved result in terms of performance and execution cost for cloud architecture. Our study includes a comparison between various other algorithms with our proposed ACO model. Results: Performance is measured using an optimization criteria tasks completion time and resource operational cost in the duration of execution. The network cost and user requests measures the performance of the proposed model. Conclusion: The simulation shows that the proposed cost and time aware technique outperforms using performance measurement parameters (average finish time, resource cost, network cost).

Load and Cost Aware Min-Min Workflow Scheduling Algorithm for Heterogeneous Resources in Fog, Cloud and Edge Scenarios

2022 ◽  
Vol 12 (1) ◽  
pp. 0-0
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Load Balancing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Fog Computing ◽  
Workflow Scheduling ◽  
Heterogeneous Environment ◽  
Cloud Servers ◽  
Heterogeneous Resources

Fog computing and Edge computing are few of the latest technologies which are offered as solution to challenges faced in Cloud Computing. Instead of offloading of all the tasks to centralized cloud servers, some of the tasks can be scheduled at intermediate Fog servers or Edge devices. Though this solves most of the problems faced in cloud but also encounter other traditional problems due to resource-related constraints like load balancing, scheduling, etc. In order to address task scheduling and load balancing in Cloud-fog-edge collaboration among servers, we have proposed an improved version of min-min algorithm for workflow scheduling which considers cost, makespan, energy and load balancing in heterogeneous environment. This algorithm is implemented and tested in different offloading scenarios- Cloud only, Fog only, Cloud-fog and Cloud-Fog-Edge collaboration. This approach performed better and the result gives minimum makespan, less energy consumption along with load balancing and marginally less cost when compared to min-min and ELBMM algorithms

scholarly journals Low Power Consumption on Cloud Data Centers Using HSA Algorithm

2020 ◽  
pp. 78-84
Author(s):  
Louay Al Nuaimy ◽  
Tadele Debisa Deressa ◽  
Mohammad Mastan ◽  
Syed Umar
Keyword(s):  
Energy Consumption ◽  
Virtual Machine ◽  
Virtual Machines ◽  
Search Algorithm ◽  
Rapid Development ◽  
Electricity Consumption ◽  
Cloud Infrastructure ◽  
Virtual Machine Migration ◽  
Cloud Data ◽  
The Right

The rapid development of knowledge and communication has created a new processing style called cloud computing. One of the key issues facing cloud infrastructure providers is minimizing costs and maximizing profitability. Power management in cloud centres is very important to achieve this. Energy consumption can be reduced by releasing inactive nodes or by reducing the migration of virtual machines. The second is one of the challenges of choosing the virtual machine deployment method to migrate to the right node. This article proposes an approach to reduce electricity consumption in cloud centres. This approach adapts Harmony's search algorithm to move virtual machines. Positioning is done by sorting nodes and virtual machines according to their priorities in descending order. Priority is calculated based on the workload. The proposed procedure is envisaged. The evaluation results show less virtual machine migration, greater efficiency and lower energy consumption.

scholarly journals An efficient population-based multi-objective task scheduling approach in fog computing systems

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Zahra Movahedi ◽  
Bruno Defude ◽  
Amir mohammad Hosseininia
Keyword(s):  
Energy Consumption ◽  
Task Scheduling ◽  
Heuristic Algorithms ◽  
Rapid Development ◽  
Fog Computing ◽  
Scheduling Problem ◽  
Distributed Resources ◽  
Iot Applications ◽  
Whale Optimization ◽  
Iot Devices

AbstractWith the rapid development of Internet of Things (IoT) technologies, fog computing has emerged as an extension to the cloud computing that relies on fog nodes with distributed resources at the edge of network. Fog nodes offer computing and storage resources opportunities to resource-less IoT devices which are not capable to support IoT applications with computation-intensive requirements. Furthermore, the closeness of fog nodes to IoT devices satisfies the low-latency requirements of IoT applications. However, due to the high IoT task offloading requests and fog resource limitations, providing an optimal task scheduling solution that considers a number of quality metrics is essential. In this paper, we address the task scheduling problem with the aim of optimizing the time and energy consumption as two QoS parameters in the fog context. First, we present a fog-based architecture for handling the task scheduling requests to provide the optimal solutions. Second, we formulate the task scheduling problem as an Integer Linear Programming (ILP) optimization model considering both time and fog energy consumption. Finally, we propose an advanced approach called Opposition-based Chaotic Whale Optimization Algorithm (OppoCWOA) to enhance the performance of the original WOA for solving the modelled task scheduling problem in a timely manner. The efficiency of the proposed OppoCWOA is shown by providing extensive simulations and comparisons with the original WOA and some existing meta-heuristic algorithms such as Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA).

scholarly journals An Optimization of Makespan, Energy Consumption, and Load Balancing on the Task Scheduling in Cloud Computing using Particle Swarm Optimization (PSO)

2019 ◽  
Vol 8 (4) ◽  
pp. 3040-3049
Keyword(s):  
Cloud Computing ◽  
Particle Swarm Optimization ◽  
Energy Consumption ◽  
Load Balancing ◽  
Task Scheduling ◽  
Particle Swarm ◽  
Clonal Selection Algorithm ◽  
Data Set ◽  
Swarm Optimization ◽  
Optimum Solution

Cloud computing is widely used resource sharing computational technology to provide fast, reliable, and scalable computational process for organizations and companies without the need to build and maintain their own server. The research area about cloud computing is dynamic and versatile. One may have concern on the privacy, security, networking, optimization, etc. Due to huge demand for cloud computing, it creates several problems such as makespan, energy consumption, and load balancing. Task scheduling is one of the technologies that have been applied to solve those objectivities. However, task scheduling is one of the well-known NP-hard problems, and it is difficult to find the optimum solution. In order to solve this problem, previous studies have utilized meta-heuristic method to find the best solution based on the solution spaces. This study proposed Particle Swarm Optimization (PSO) to solve the multi-objective task scheduling to achieve the optimum solution. The effectiveness of the proposed algorithm will be compared with Genetic Algorithm (GA), Clonal Selection Algorithm (CSA), and Bat Algorithm (BA). This study converts three objectivities into single objectivity optimization with each objectivity act as variable assigned with weight that present its priority and has implemented those meta-heuristics. The simulation result from ten data set shows that PSO able to outperform GA, CSA, and BA especially for makespan and energy consumption without the cost of algorithm duration since PSO has fast convergence rate compare to the other three algorithms and making it a good choice for dynamic task scheduling in data center cloud computing where the algorithm duration is one of important factor

scholarly journals A Hybrid Approach Based on Grey Wolf and Whale Optimization Algorithms for Solving Cloud Task Scheduling Problem

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Jafar Ababneh
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Task Scheduling ◽  
Virtual Machines ◽  
Hybrid Approach ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Use Of Resources ◽  
Whale Optimization ◽  
Resources Assessment

In the context of cloud computing, one problem that is frequently encountered is task scheduling. This problem has two primary implications, which are the planning of tasks on virtual machines and the attenuation of performance. In order to address the problem of task scheduling in cloud computing, requisite nontraditional optimization attitudes to attain the optima of the problem, the present paper puts forth a hybrid multiple-objective approach called hybrid grey wolf and whale optimization (HGWWO) algorithms, that integrates two algorithms, namely, the grey wolf optimizer (GWO) and the whale optimization algorithm (WOA), with the purpose of conjoining the advantages of each algorithm for minimizing costs, energy consumption, and total execution time needed for task implementation, beside that improving the use of resources. Assessment of the aims of the proposed approach is carried out with the help of the tool known as CloudSim. As pointed out by the results of the experimental work undertaken, the proposed approach has the capability of performing at a superior level by comparison to the original algorithms GWO and WOA on their own with regard to costs, energy consumption, makespan, use of resources, and degree of imbalance.

Sign in / Sign up

Export Citation Format

Share Document