Change search
ReferencesLink to record
Permanent link

Direct link
A Parallel Metaheuristic Framework Based on Harmony Search for Scheduling in Distributed Computing Systems
The University of Sydney, Sydney, Australia.
The University of Sydney, Australia.ORCID iD: 0000-0001-9194-010X
The University of Sydney, Sydney, Australia.
2012 (English)In: International Journal of Foundations of Computer Science, ISSN 0129-0541, Vol. 23, no 2, 445-464 p.Article in journal (Refereed) Published
Abstract [en]

A large number of optimization problems have been identified as computationally challenging and/or intractable to solve within a reasonable amount of time. Due to the NP-hard nature of these problems, in practice, heuristics account for the majority of existing algorithms. Metaheuristics are one very popular type of heuristics used for many of these optimization problems. In this paper, we present a novel parallel-metaheuristic framework, which effectively enables to devise parallel metaheuristics, particularly with heterogeneous metaheuristics. The core component of the proposed framework is its harmony-search-based coordinator. Harmony search is a recent breed of metaheuristic that mimics the improvisation process of musicians. The coordinator facilitates heterogeneous metaheuristics (forming a parallel metaheuristic) to escape local optima. Specifically, best solutions generated by these worker metaheuristics are maintained in the harmony memory of the coordinator, and they are used to form new-possibly better-harmonies (solutions) before actual solution sharing between workers occurs; hence, their solutions are harmonized with each other. For the applicability validation and the performance evaluation, we have implemented a parallel hybrid metaheuristic using the framework for the task scheduling problem on multiprocessor computing systems (e.g., computer clusters). Experimental results verify that the proposed framework is a compelling approach to parallelize heterogeneous metaheuristics.

Place, publisher, year, edition, pages
WORLD SCIENTIFIC PUBL CO PTE LTD , 2012. Vol. 23, no 2, 445-464 p.
National Category
Computer Science
Research subject
Computer Science
URN: urn:nbn:se:kau:diva-46056DOI: 10.1142/S0129054112400229ISI: 000302061000015OAI: diva2:970858

B, IF (2009) : 0.512

Available from: 2016-09-14 Created: 2016-09-14 Last updated: 2016-09-16Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Taheri, Javid
In the same journal
International Journal of Foundations of Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 11 hits
ReferencesLink to record
Permanent link

Direct link