Balanced job scheduling based on ant algorithm for grid network

Preve, N

dc.contributor.author	Preve, N	en
dc.date.accessioned	2014-03-01T01:59:37Z
dc.date.available	2014-03-01T01:59:37Z
dc.date.issued	2010	en
dc.identifier.issn	19380259	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/29010
dc.subject	Ant colony optimization algorithm	en
dc.subject	Grid computing	en
dc.subject	Heuristics	en
dc.subject	Job scheduling	en
dc.subject.other	Ant algorithms	en
dc.subject.other	Ant colony optimization algorithm	en
dc.subject.other	Ant Colony Optimization algorithms	en
dc.subject.other	Entire system	en
dc.subject.other	Grid environments	en
dc.subject.other	Grid network	en
dc.subject.other	Job scheduling	en
dc.subject.other	Job scheduling algorithms	en
dc.subject.other	Makespan	en
dc.subject.other	Competition	en
dc.subject.other	Computation theory	en
dc.subject.other	Grid computing	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Optimization	en
dc.subject.other	Scheduling algorithms	en
dc.title	Balanced job scheduling based on ant algorithm for grid network	en
heal.type	journalArticle	en
heal.identifier.primary	10.4018/jghpc.2010092803	en
heal.identifier.secondary	http://dx.doi.org/10.4018/jghpc.2010092803	en
heal.publicationDate	2010	en
heal.abstract	Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this article is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms. Copyright © 2010, IGI Global.	en
heal.journalName	International Journal of Grid and High Performance Computing	en
dc.identifier.doi	10.4018/jghpc.2010092803	en
dc.identifier.volume	2	en
dc.identifier.issue	1	en
dc.identifier.spage	34	en
dc.identifier.epage	50	en