scholarly journals Energy-Aware Real-Time Task Scheduling for Heterogeneous Multiprocessors with Particle Swarm Optimization Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Weizhe Zhang ◽  
Hucheng Xie ◽  
Boran Cao ◽  
Albert M. K. Cheng
Keyword(s):  
Particle Swarm Optimization ◽  
Energy Consumption ◽  
Real Time ◽  
Task Scheduling ◽  
Particle Swarm ◽  
Energy Aware ◽  
Swarm Optimization ◽  
Heterogeneous Multiprocessors ◽  
Time Task ◽  
Feasible Solutions

Energy consumption in computer systems has become a more and more important issue. High energy consumption has already damaged the environment to some extent, especially in heterogeneous multiprocessors. In this paper, we first formulate and describe the energy-aware real-time task scheduling problem in heterogeneous multiprocessors. Then we propose a particle swarm optimization (PSO) based algorithm, which can successfully reduce the energy cost and the time for searching feasible solutions. Experimental results show that the PSO-based energy-aware metaheuristic uses 40%–50% less energy than the GA-based and SFLA-based algorithms and spends 10% less time than the SFLA-based algorithm in finding the solutions. Besides, it can also find 19% more feasible solutions than the SFLA-based algorithm.

A Comparison of Genetic Algorithm, Particle Swarm Optimization and Simulated Annealing in Real-Time Task Scheduling on CMP

2013 ◽  
Vol 679 ◽  
pp. 77-81 ◽  
Author(s):  
Song Chai ◽  
Yu Bai Li ◽  
Chang Wu ◽  
Jian Wang
Keyword(s):  
Genetic Algorithm ◽  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Real Time ◽  
Schedule Problem ◽  
Particle Swarm ◽  
Full Potential ◽  
Swarm Optimization ◽  
Task Schedule ◽  
Time Task

Real-time task schedule problem in Chip-Multiprocessor (CMP) receives wide attention in recent years. It is partly because the increasing demand for CMP solutions call for better schedule algorithm to exploit the full potential of hardware, and partly because of the complexity of schedule problem, which itself is an NP-hard problem. To address this task schedule problem, various of heuristics have been studied, among which, Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Simulated Annealing (SA) are the most popular ones. In this paper, we implement these 3 schedule heuristics, and compare their performance under the context of real-time tasks scheduling on CMP. According to the results of our intensive simulations, PSO has the best fitness optimization of these 3 algorithms, and SA is the most efficient algorithm.

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

Smart teaching mode based on particle swarm image recognition and human-computer interaction deep learning

2020 ◽  
Vol 39 (4) ◽  
pp. 5699-5711
Author(s):  
Shirong Long ◽  
Xuekong Zhao
Keyword(s):  
Feature Extraction ◽  
Particle Swarm Optimization ◽  
Deep Learning ◽  
Real Time ◽  
Image Recognition ◽  
Particle Swarm ◽  
Learning Technology ◽  
Search Performance ◽  
Swarm Optimization ◽  
Teaching Mode

The smart teaching mode overcomes the shortcomings of traditional teaching online and offline, but there are certain deficiencies in the real-time feature extraction of teachers and students. In view of this, this study uses the particle swarm image recognition and deep learning technology to process the intelligent classroom video teaching image and extracts the classroom task features in real time and sends them to the teacher. In order to overcome the shortcomings of the premature convergence of the standard particle swarm optimization algorithm, an improved strategy for multiple particle swarm optimization algorithms is proposed. In order to improve the premature problem in the search performance algorithm of PSO algorithm, this paper combines the algorithm with the useful attributes of other algorithms to improve the particle diversity in the algorithm, enhance the global search ability of the particle, and achieve effective feature extraction. The research indicates that the method proposed in this paper has certain practical effects and can provide theoretical reference for subsequent related research.

Sign in / Sign up

Export Citation Format

Share Document