Abstract
This paper presents an improved version of a music-inspired meta-heuristic algorithm, Harmony Search (HS), for successfully solving the NP-complete task assignment problem (TAP) in distributed computing systems. Task assignment is an important and core step in distributed systems where program tasks must be properly allocated to the processors to effectively harness the computing power by better exploitation of the system parallelism and improving system performance. The proposed HS-based algorithm explores the search space effectively and efficiently by exploiting the factors of randomness, experience, and variation of experience. Our main contributions in this work are: introducing a modification in the pitch adjustment operator of the Harmony Search, mapping Harmony Search solutions to the clustering methodology which shows its superiority in solving TAP, and using a local refinement heuristic to improve a given assignment. The effectiveness of the proposed HS-based algorithm is demonstrated by comparing it with a recently reported Harmony Search algorithm, NGHS, and with a wide variety of other earlier reported meta-heuristic techniques such as GA, SA, PSO and many others, to solve the TAP. Simulation results indicate that the proposed HS-based algorithm is a viable approach for the TAP, which could find better quality (or even optimal) solutions within reasonable computation time.
| Original language | English |
|---|---|
| Pages (from-to) | 153-169 |
| Number of pages | 17 |
| Journal | Evolving Systems |
| Volume | 4 |
| Issue number | 3 |
| DOIs | |
| State | Published - Sep 2013 |
Keywords
- Genetic algorithm
- Harmony Search
- Task assignment problem
- Task interaction graph
Fingerprint
Dive into the research topics of 'Solving the task assignment problem using Harmony Search algorithm'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver