Research on the Application of Ant Colony Algorithm in Grid Resource Scheduling

Author

Tang, Bing ; Yin, Yingying ; Liu, Quan ; Zhou, Zude

Author_Institution

Sch. of Inf. Eng., Wuhan Univ. of Technol., Wuhan

fYear

2008

fDate

12-14 Oct. 2008

Firstpage

1

Lastpage

4

Abstract

Grid resource scheduling is one of the popular issues in grid computing research field. Ant colony algorithm (ACA) is an effective method to solve NP (non-deterministic polynomial) problems. By studying the process of resource scheduling in grid environment and ant colony algorithm for classic TSP problem, a strategy of resource scheduling based on ACA in grid environment was proposed. Then, the new scheduling strategy was simulated using the GridSim toolkit package. The experimental result shows that ACA-based algorithm is more effective in grid resources scheduling with the advantages of reducing the executing time and completing time.

Keywords

distributed algorithms; grid computing; optimisation; resource allocation; scheduling; NP problem; TSP; ant colony algorithm; distributed algorithm; grid resource scheduling; nondeterministic polynomial problem; Computational modeling; Costs; Distributed computing; Grid computing; Memory management; Packaging; Polynomials; Processor scheduling; Resource management; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on

Conference_Location

Dalian

Print_ISBN

978-1-4244-2107-7

Electronic_ISBN

978-1-4244-2108-4

Type

conf

DOI

10.1109/WiCom.2008.1354

Filename

4679262