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 Capacity Preserve Assignment Scheduling Algorithm in context of Determination System for Cloud Computing

2019 ◽  
Vol 8 (2S8) ◽  
pp. 647-650
Keyword(s):  
Cloud Computing ◽  
Information Systems ◽  
Load Balancing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Processing Condition ◽  
Feedback Mechanism ◽  
Determination System

Booking figuring is reliably a fervently issue in appropriated processing condition. Remembering the true objective to take out system bottleneck and modify stack logically. A stack changing endeavor booking count in light of weighted self-assertive and input frameworks was proposed in this paperFrom the outset the picked cloud masterminding host picked assets by necessities and made static estimation, and some time later coordinated them; other than the tally picked assets from which composed by weight self-confidently; by then it got standing out powerful data from effect burden to channel and sort the left. Finally it accomplished oneself adaptively to structure stack through information systems. The examination demonstrates that the calculation has stayed away from the framework bottleneck adequately and has accomplished adjusted burden and furthermore self-flexibility to it.keywords: Task Scheduling; Feedback Mechanism; Cloud Computing; Load Balancing

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 An Efficient Dynamic-Decision Based Task Scheduler for Task Offloading Optimization and Energy Management in Mobile Cloud Computing

Sensors ◽  
2021 ◽  
Vol 21 (13) ◽  
pp. 4527
Author(s):  
Abid Ali ◽  
Muhammad Munawar Iqbal ◽  
Harun Jamil ◽  
Faiza Qayyum ◽  
Sohail Jabbar ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Mobile Devices ◽  
Task Scheduling ◽  
Time Management ◽  
Mobile Cloud Computing ◽  
Fog Computing ◽  
Mobile Cloud ◽  
Computational Performance ◽  
Task Offloading

Restricted abilities of mobile devices in terms of storage, computation, time, energy supply, and transmission causes issues related to energy optimization and time management while processing tasks on mobile phones. This issue pertains to multifarious mobile device-related dimensions, including mobile cloud computing, fog computing, and edge computing. On the contrary, mobile devices’ dearth of storage and processing power originates several issues for optimal energy and time management. These problems intensify the process of task retaining and offloading on mobile devices. This paper presents a novel task scheduling algorithm that addresses energy consumption and time execution by proposing an energy-efficient dynamic decision-based method. The proposed model quickly adapts to the cloud computing tasks and energy and time computation of mobile devices. Furthermore, we present a novel task scheduling server that performs the offloading computation process on the cloud, enhancing the mobile device’s decision-making ability and computational performance during task offloading. The process of task scheduling harnesses the proposed empirical algorithm. The outcomes of this study enable effective task scheduling wherein energy consumption and task scheduling reduces significantly.

The Cloud Computing Tasks Scheduling Algorithm Based on Improved K-Means

2014 ◽  
Vol 513-517 ◽  
pp. 1830-1834
Author(s):  
Xue Ying Sun ◽  
Xue Liang Fu ◽  
Hua Hu ◽  
Tao Gui
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Theoretical Research ◽  
Experimental Result ◽  
Task Completion ◽  
Time Efficiency ◽  
Task Scheduling Algorithm ◽  
Resource Requirements

Cloud task scheduling is a hot technology today, how to effectively improve the utilization of resources, time efficiency, load balancing, is the focus and difficult of the study. The time efficiency, load balancing of K-Min algorithm still need to be improved, so this paper proposes cloud computing task scheduling algorithm based on modified K-Means (Improved K-Min), firstly, This paper improves the k-means algorithm using the BFA and PSO,then according to the length attribute of the task, resource requirements, the algorithm uses the improved K-means for packet processing tasks, then performs Min-Min scheduling algorithm within the group. Through theoretical research and simulation of Cloud-sim platform, when the number of tasks is 300, experimental result is best, comparing with Min-Min algorithm, the total task completion time improved 17.13%.

Sign in / Sign up

Export Citation Format

Share Document