Quantum Particle Swarm Optimization Technique for Load Balancing in Cloud Computing

Elrasheed Ismail, Sultan (2013) Quantum Particle Swarm Optimization Technique for Load Balancing in Cloud Computing. PhD thesis, Universiti Malaysia Pahang (Contributors, UNSPECIFIED: UNSPECIFIED).

Full text not available from this repository.


Cloud Computing systems are widely applied in many fields such as communication data management, web application, network monitoring, financial management and so on. The distributed Cloud Computing technology has been produced as the development of the computer network and distributed computing technology. Researches on data Cloud Computing become the necessary trend in the distributed Cloud Computing system domain since the sources and application of the data are distributed and the scale of the applications enlarges quickly. Load management is the focus of research in both of the area in distributed Cloud Computing systems and centralized Cloud Computing systems. Although researches on the load management in the cloud systems is similar to that of traditional parallel and distributed systems in many aspects, essential differences exist between them. The choice of a scheduling strategy has significant impact on the runtime Central Processing Unit, memory consumption as well as the storage systems. Load balancing optimization techniques such as Ant Colony Optimization (ACO), First Come First Served (FCFS), Round Robin (RR) and Particle Swarm Optimization (PSO) are popular techniques being used for scheduling and load balancing. However, these techniques have its weaknesses in terms of minimizing makespan, computation cost and communication cost. In this study, load balancing technique in Cloud Computing called Quantum Particle Swarm Optimization (QPSO) technique proposed by considering only minimization of makespan, computation cost and communication cost. Performance of the QPSO technique based on many heuristic algorithms it is comprised the following steps. Firstly, tasks are assigned averagely to the machines according to a special initialization policy. Then the optimal criterion for exchanging tasks between two machines is proposed and exploited to speed up the improving process towards load balance. Secondly, this thesis proposes job-combination based static algorithm for load balancing where all jobs should organized into the standard job combinations, each task of which consists of one to four jobs. Then they are assigned to the machines according to the assignment algorithm for job combinations, which is a special integer partition algorithm. Finally, the result of experiment shows that QPSO can achieve at least three times cost saving as compared with ACO, FCFS, RR and PSO.

Item Type: Thesis (PhD)
Additional Information: Thesis (Doctor of Philosophy in Computer Science) -- Universiti Malaysia Pahang - 2013
Uncontrolled Keywords: Logic programming Swarm intelligence
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Ms Suriati Mohd Adam
Date Deposited: 11 Nov 2014 02:14
Last Modified: 18 Aug 2021 06:22
URI: http://umpir.ump.edu.my/id/eprint/7286
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item