Multiobjective grid scheduling using a domain decomposition based parallel micro evolutionary algorithm Online publication date: Thu, 18-Sep-2014
by Sergio Nesmachnow; Santiago Iturriaga
International Journal of Grid and Utility Computing (IJGUC), Vol. 4, No. 1, 2013
Abstract: This work studies the problem of scheduling independent tasks in heterogeneous computing grid systems. A new bi-objective formulation of the scheduling problem is introduced, which aims at minimising the makespan and weighted response ratio objectives. A novel parallel micro evolutionary algorithm is developed in order to efficiently solve the problem. By using a domain decomposition approach, the proposed method allows to efficiently deal with the multiobjective optimisation version of the scheduling problem. The new decomposition-based parallel micro evolutionary algorithm is implemented over MALLBA, a general-purpose library for combinatorial optimisation. The experimental analysis performed on both well-known and new large problem instances that model medium-sized grid environments demonstrate that the new parallel micro evolutionary algorithm achieves a high problem-solving efficacy and shows very good scalability behaviour when facing high-dimensional instances.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook