scholarly journals Methods of Resource Scheduling Based on Optimized Fuzzy Clustering in Fog Computing

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2122 ◽  
Author(s):  
Guangshun Li ◽  
Yuncui Liu ◽  
Junhua Wu ◽  
Dandan Lin ◽  
Shuaishuai Zhao

Cloud computing technology is widely used at present. However, cloud computing servers are far from terminal users, which may lead to high service request delays and low user satisfaction. As a new computing architecture, fog computing is an extension of cloud computing that can effectively solve the aforementioned problems. Resource scheduling is one of the key technologies in fog computing. We propose a resource scheduling method for fog computing in this paper. First, we standardize and normalize the resource attributes. Second, we combine the methods of fuzzy clustering with particle swarm optimization to divide the resources, and the scale of the resource search is reduced. Finally, we propose a new resource scheduling algorithm based on optimized fuzzy clustering. The experimental results show that our method can improve user satisfaction and the efficiency of resource scheduling.

Author(s):  
Jia Jia ◽  
Dejun Mu

In order to reduce the energy cost in cloud computing, this paper represents a novel energy-orientated resource scheduling method based on particle swarm optimization. The energy cost model in cloud computing environment is studied first. The optimization of energy cost is then considered as a multiobjective optimization problem, which generates the Pareto optimization set. To solve this multiobjective optimization problem, the particle swarm optimization is involved. The states of one particle consist of both the allocation plan for servers and the frequency plans on servers. Each particle in this algorithm obtains its Pareto local optimization. After the assembly of local optimizations, the algorithm generates the Pareto global optimization for one server plan. The final solution to our problem is the optimal one among all server plans. Experimental results show the good performance of the proposed method. Comparing with the widely-used Round robin scheduling method, the proposed method requires only 45.5% dynamic energy cost.


Author(s):  
Zhou Wu ◽  
Jun Xiong

With the characteristics of low cost, high availability, and scalability, cloud computing has become a high demand platform in the field of information technology. Due to the dynamic and diversity of cloud computing system, the task and resource scheduling has become a challenging issue. This paper proposes a novel task scheduling algorithm of cloud computing based on particle swarm optimization. Firstly, the resource scheduling problem in cloud computing system is modeled, and the objective function of the task execution time is formulated. Then, the modified particle swarm optimization algorithm is introduced to schedule applications' tasks and enhance load balancing. It uses Copula function to explore the relation of the random parameters random numbers and defines the local attractor to avoid the fitness function to be trapped into local optimum. The simulation results show that the proposed resource scheduling and allocation model can effectively improve the resource utilization of cloud computing and greatly reduce the completion time of tasks.


2018 ◽  
Vol 7 (4.7) ◽  
pp. 131
Author(s):  
NV Abhinav Chand ◽  
A Hemanth Kumar ◽  
Surya Teja Marella

Emerging cloud computing technology is a big step in virtual computing. Cloud computing provides services to clients through the internet. Cloud computing enables easy access to resources distributed all over the world. Increase in the number of the population has further increased the challenge. The main challenge of cloud computing technology is to achieve efficient load balancing. Load balancing is a process of assigning load to available resources in such a way that it avoids overloading of resources. If load balancing is performed efficiently, it improves QoS metric including cost, throughput, response time, resource utilization and performance. Efficient load balancing techniques also provide better user satisfaction. Various load balancing algorithms are used in different scenarios for ensuring the same. In the current research, we will study different algorithms for load balancing and benefits and limitations caused to the system due to the algorithms. In this paper, we will compare static and dynamic load balancing algorithms for various measures of efficiency. These will be useful for future research in the concerned field. 


Symmetry ◽  
2021 ◽  
Vol 13 (12) ◽  
pp. 2270
Author(s):  
Sina Zangbari Koohi ◽  
Nor Asilah Wati Abdul Hamid ◽  
Mohamed Othman ◽  
Gafurjan Ibragimov

High-performance computing comprises thousands of processing powers in order to deliver higher performance computation than a typical desktop computer or workstation in order to solve large problems in science, engineering, or business. The scheduling of these machines has an important impact on their performance. HPC’s job scheduling is intended to develop an operational strategy which utilises resources efficiently and avoids delays. An optimised schedule results in greater efficiency of the parallel machine. In addition, processes and network heterogeneity is another difficulty for the scheduling algorithm. Another problem for parallel job scheduling is user fairness. One of the issues in this field of study is providing a balanced schedule that enhances efficiency and user fairness. ROA-CONS is a new job scheduling method proposed in this paper. It describes a new scheduling approach, which is a combination of an updated conservative backfilling approach further optimised by the raccoon optimisation algorithm. This algorithm also proposes a technique of selection that combines job waiting and response time optimisation with user fairness. It contributes to the development of a symmetrical schedule that increases user satisfaction and performance. In comparison with other well-known job scheduling algorithms, the simulation assesses the effectiveness of the proposed method. The results demonstrate that the proposed strategy offers improved schedules that reduce the overall system’s job waiting and response times.


2020 ◽  
Vol 19 ◽  

Fog computing is a promising technology that is used by many organizations and end-users. It has characteristics and advantages that offer services such as computing, storage, communication, and application services. It facilitates these services to end-users and allows to increase the number of devices that can connect to the network. In this paper, we provide a survey of Fog computing technology in terms of its architecture, features, advantages and disadvantages. We provide a comparison of this model with Cloud Computing, Mobile-Edge Computing, and Cloudlet Computing. We also present challenges and issues that face Fog Computing such as privacy and security, control and management, fog networking and task scheduling. Finally, we discuss aspects of Fog computing security and the benefits of integration between Fog computing and other techniques like Internet of Things and Cloud Computing.


2013 ◽  
Vol 662 ◽  
pp. 957-960 ◽  
Author(s):  
Jing Liu ◽  
Xing Guo Luo ◽  
Xing Ming Zhang ◽  
Fan Zhang

Cloud computing is an emerging high performance computing environment with a large scale, heterogeneous collection of autonomous systems and flexible computational architecture. The performance of the scheduling system influences the cost benefit of this computing paradigm. To reduce the energy consumption and improve the profit, a job scheduling model based on the particle swarm optimization(PSO) algorithm is established for cloud computing. Based on open source cloud computing simulation platform CloudSim, compared to GA and random scheduling algorithms, the results show that the proposed algorithm can obtain a better solution concerning the energy cost and profit.


Sign in / Sign up

Export Citation Format

Share Document