MARC details
| 000 -LEADER |
| fixed length control field |
03477nam a2200265 a 4500 |
| 001 - CONTROL NUMBER |
| control field |
vtls000078839 |
| 003 - CONTROL NUMBER IDENTIFIER |
| control field |
KUKTEM |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
| control field |
20251114204458.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
| fixed length control field |
140528t2013 my da f m 000 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
| International Standard Book Number |
THE0001733(Local) |
| 039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE] |
| Level of rules in bibliographic description |
201905131214 |
| Level of effort used to assign nonsubject heading access points |
yusri |
| Level of effort used to assign subject headings |
201710041242 |
| Level of effort used to assign classification |
aishah |
| -- |
201405280947 |
| -- |
Fida |
| 040 ## - CATALOGING SOURCE |
| Original cataloging agency |
UMP |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
QA76.63 .E47 2013 rs Bc. |
| 100 0# - MAIN ENTRY--PERSONAL NAME |
| Personal name |
Elrasheed Ismail Sultan |
| 245 10 - TITLE STATEMENT |
| Title |
Quantum particle swarm optimization technique for load balancing in cloud computing / |
| Statement of responsibility, etc. |
Elrasheed Ismail Sultan |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
| Place of publication, distribution, etc. |
Kuantan, Pahang : |
| Name of publisher, distributor, etc. |
UMP, |
| Date of publication, distribution, etc. |
2013 |
| 300 ## - PHYSICAL DESCRIPTION |
| Extent |
xvi, 148 p. : |
| Other physical details |
ill. (some col.) ; |
| Dimensions |
30 cm. + |
| Accompanying material |
1 CD-ROM |
| 502 ## - DISSERTATION NOTE |
| Dissertation note |
Thesis (Doctor of Philosophy in Computer Science) -- Universiti Malaysia Pahang - 2013 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
| Bibliography, etc. note |
Bibliography : p. 137-148 |
| 520 3# - SUMMARY, ETC. |
| Summary, etc. |
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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
| Topical term or geographic name entry element |
Logic programming |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
| Topical term or geographic name entry element |
Swarm intelligence |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
| Uniform Resource Identifier |
<a href="http://ecollib.ump.edu.my/2361/">http://ecollib.ump.edu.my/2361/</a> |
| Public note |
Library access only |