DocumentCode
1656184
Title
An Improved Resource Scheduling Algorithm Based on the PSO in Mobile Grid
Author
Wu Runze ; Zhu Dandan ; Zhicong Chen
Author_Institution
Sch. of Electr. & Electron. Eng., North China Electr. Power Univ., Beijing, China
fYear
2011
Firstpage
1
Lastpage
4
Abstract
Mobile grid, based on the integration of the Grid computing and mobile computing, has become a research hotspot in the fields of resources sharing and high performance computing. This paper focuses on the characteristics of mobile grid, establishing the network communication model of mobile grid and keying on the scheduling algorithm in the computing resource allocation module. An improved Particles Swarm Optimization (PSO) algorithm used for mobile grid is proposed, which discrete the codes of the basic PSO, introducing genetic operator and mutation operator in the iteration. The simulation of an example shows that the improved PSO algorithm can not only improve the pressing speed of the overall particle swarm to optimization solution, but also help to avoid local convergence. The effect of using the improved algorithm to solve large mobile grid resource scheduling is superior.
Keywords
grid computing; mobile computing; particle swarm optimisation; scheduling; computing resource allocation module; genetic operator; grid computing; high-performance computing; improved PSO algorithm; improved particles swarm optimization; improved resource scheduling algorithm; mobile computing; mobile grid; mutation operator; network communication model; resource sharing; Mobile communication; Mobile computing; Optimal scheduling; Particle swarm optimization; Resource management; Scheduling; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on
Conference_Location
Wuhan
ISSN
2161-9646
Print_ISBN
978-1-4244-6250-6
Type
conf
DOI
10.1109/wicom.2011.6040580
Filename
6040580
Link To Document