Call for Paper - May 2023 Edition
IJCA solicits original research papers for the May 2023 Edition. Last date of manuscript submission is April 20, 2023. Read More

An Inherent Approach based on ACO and Tabu Search for Resource Allocation in Grid Environment

International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 87 - Number 6
Year of Publication: 2014
Sonal Nagariya
Mahendra Mishra
Manish Shrivastava

Sonal Nagariya, Mahendra Mishra and Manish Shrivastava. Article: An Inherent Approach based on ACO and Tabu Search for Resource Allocation in Grid Environment. International Journal of Computer Applications 87(6):39-45, February 2014. Full text available. BibTeX

	author = {Sonal Nagariya and Mahendra Mishra and Manish Shrivastava},
	title = {Article: An Inherent Approach based on ACO and Tabu Search for Resource Allocation in Grid Environment},
	journal = {International Journal of Computer Applications},
	year = {2014},
	volume = {87},
	number = {6},
	pages = {39-45},
	month = {February},
	note = {Full text available}


The persistence of grid environment is to yield a virtual mainframe by using different types of assets available in the large area using broad networks. Grid computing is expanding promptly in the existing era. Grid Computing for controlling and allotment large-scale resources to solve complex technical obstacles. Arrangement is the greatest contemporary theme used to achieve high performance in grid environments. The rotation of the assets floods dishonest announcement infrastructure and availability of the resources carriage a major challenge for proficient resource carriage. Due to fundamental scattering of the assets and their observation, grid provision is a NP-hard exertion. It has been exposed that heuristic algorithms such as tabu search offer optimal performance for resource provision in grid atmosphere. This paper presented a unusual merging algorithm inspired by the tabu search with ant colony optimization . The proposed fusion approach ambitions to breed energetically, an peak skeleton to widespread responsibilities within tiniest time period and also to use assets skillfully.


  • Avijit Bhowmick, Nirmalya Mukhopadhyay, Abhishek Bandyopadhyay, "A Proposed Robust Authentication Approach for Secure Data Transmission in Grid Computing Environment", International Journal of Computer Applications (0975 – 8887) ,Volume 50– No. 22, July 2012.
  • Zahra Pooranian, Mohammad Shojafar, Jemal H. Abawajy, and Mukesh", GLOA: A New Job Scheduling Algorithm for Grid Computing", International Journal of Artificial Intelligence and Interactive Multimedia, Vol. 2, Nº 1.
  • Zafril Rizal M Azmi, Kamalrulnizam Abu Bakar, Mohd Shahir Shamsir, Wan Nurulsafawati Wan Manan, Abdul Hanan Abdullah, "Scheduling Grid Jobs Using Priority Rule Algorithms and Gap Filling Techniques",International Journal of Advanced Science and Technology Vol. 37, December, 2011.
  • Aram Galstyan, Karl Czajkowski and Kristina Lerman ,"Resource Allocation in the Grid with Learning Agents" . Journal of Grid Computing 2005, Volume 3,pp. 91–100 .
  • Shengwei YI, Zhichao WANG, Shilong MA, Zhanbin CHE, Yonggang HUANG , Xin CHEN ," An Effective Algorithm of Jobs Scheduling in Clusters " , Journal of Computational Information Systems, Volume 6:10 ,2010 , pp. 3163-3171 .
  • Fatos Xhafa, Javier Carretero, "A TABU SEARCH ALGORITHM FOR SCHEDULING INDEPENDENT JOBS IN COMPUTATIONAL GRIDS", Computing and Informatics, Vol. 28, 2009, 1001–1014, 2009-Mar-2
  • Fred Glover , Manuel Laguna, TABU SEARCH,
  • Mohd Kamir Yusof ,Kampus Gong Badak ,Muhamad Azahar Stapa ," Achieving of Tabu Search Algorithm for Scheduling Technique in Grid Computing Using GridSim Simulation Tool: Multiple Jobs on Limited Resource, " International Journal of Grid and Distributed Computing Grid and Distributed Computing, Vol. 3, No. 4, December No. 4, 2010 .
  • Vittorio Maniezzo,Luca Maria Gambardella, Fabio de Luigi," Ant Colony Optimization".
  • Przemys?aw Korytkowski & Szymon Rymaszewski & Tomasz Wi?niewski ," Ant colony optimization for job shop scheduling using multi-attribute dispatching rules", Springerlink. com.