Skip to main content
Springer Nature Link
Log in

Solving the task assignment problem using Harmony Search algorithm

  • Original Paper
  • Published:
Evolving Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Ahmad I, Dhodhi MK (1995) Task assignment using problem-space genetic algorithm, Concurrency: Pract Exp 7(5):411–428

    Google Scholar 

  • Ahuja RK, Orlin JB, Tiwari A (2000) A greedy genetic algorithm for the quadratic assignment problem. Comput Oper Res 27(10):917–934

    Article  MathSciNet  MATH  Google Scholar 

  • Ali S, Siegel HJ, Maheswaran M, Hensgen D, Ali S (2000) Task execution time modeling for heterogeneous computing systems. In: Raghavendra C (ed) Proceedings of the Ninth Heterogeneous Computing Workshop, Cancun, Mexico, pp 185–199

  • Bokhari SH (1981) A shortest tree algorithm for optimal assignments across space and time in distributed processor system. IEEE Trans Softw Eng 7(6):583–589

    Article  Google Scholar 

  • Bokhari SH (1987) Assignment problems in parallel and distributed computing. Kluwer Academic Publishers, Boston

    Book  Google Scholar 

  • Bultan T, Aykanat C (1992) A new mapping heuristic based on mean field annealing. J Parallel Distributed Comput 16(4):292–215

    Google Scholar 

  • Chen WH, Lin CS (2000) A hybrid heuristic to solve task allocation problem. Comput Oper Res 27(3):287–303

    Article  MATH  Google Scholar 

  • Chockalingam T, Arunkumar S (1992) A randomized heuristics for the mapping problem: the genetic approach. Parallel Comput 18(10):1157–1165

    Article  MATH  Google Scholar 

  • Chu WW, Holloway LY, Lan MT, Efe K (1980) Task allocation in distributed data processing. Computer 13(11):57–69

    Article  Google Scholar 

  • Geem ZW, Choi JY (2007) Music composition using Harmony Search algorithm. Lect Notes Comput Sci 4448:593–600

    Article  Google Scholar 

  • Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: Harmony Search. Simulation 76(2):60–68

    Article  Google Scholar 

  • Geem ZW, Fesanghary M, Choi JY, Saka MP, Williams JC, Ayvaz MT, Li L, Ryu S, Vasebi A (2008) Recent advances in Harmony Search. I-Tech Education and Publishing, Vienna

    Google Scholar 

  • Hamam Y, Hindi KS (2000) Assignment of program modules to processors: a simulated annealing approach. Eur J Oper Res 122(2):509–513

    Article  MATH  Google Scholar 

  • Hui CC, Chanson ST (1997) Allocating task interaction graphs to processors in heterogeneous networks. IEEE Trans Parallel Distrib Syst 8(9):908–925

    Article  Google Scholar 

  • Kafil M, Ahmad I (1998) Optimal task assignment in heterogeneous distributed computing systems. IEEE Concurrency 6(3):42–51

    Article  Google Scholar 

  • Kang Q, He H, Song H, Deng R (2010) Task allocation for maximizing reliability of distributed computing systems using honeybee mating optimization. J Syst Architect 47(6):549–554

    Google Scholar 

  • Kaya K, Ucar B (2009) Exact algorithms for a task assignment problem. Parallel Process Lett 16(7):1–15

    MathSciNet  Google Scholar 

  • Kopidakis Y, Lamari M, Zissimopoulos V (1997) On the task assignment problem: two new heuristic algorithms. J Parallel Distributed Comput 42(1):21–29

    Article  Google Scholar 

  • Lee KS, Geem ZW (2004) A new structural optimization method based on Harmony Search algorithm. Comput Struct 82(9):781–798

    Article  Google Scholar 

  • Lee KS, Geem ZW, Lee SH, Bae KW (2005) The Harmony Search heuristic algorithm for discrete structural optimization. Eng Optim 37(7):663–684

    Article  MathSciNet  Google Scholar 

  • Lo VM (1988) Heuristic algorithms for task assignment in distributed systems. IEEE Trans Comput 37(11):1384–1397

    Article  MathSciNet  Google Scholar 

  • Norman MG, Thanisch P (1993) Models of machines and computation for mapping in multicomputers. ACM Comput Surv 25(3):263–302

    Article  Google Scholar 

  • Omran M, Mahdavi M (2008) Global-best Harmony Search. Appl Math Comput J 198(2):643–656

    Article  MathSciNet  MATH  Google Scholar 

  • Pierson JM (2011) Green task allocation: taking into account the ecological impact of task allocation in clusters and clouds. J Green Eng 1(2):129–144

    Google Scholar 

  • Salcedo-Sanz S, Xu Y, Yao X (2006) Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems. Comput Oper Res 33(3):820–835

    Article  MATH  Google Scholar 

  • Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26(8):363–371

    Article  Google Scholar 

  • Stone HS (1977) Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans Softw Eng SE-3(1):85–93

    Google Scholar 

  • Uçar B (2012) Bora Uçar’s Homepage http://perso.ens-lyon.fr/~bucar/tig/index.html, visited 23 Feb (2012)

  • Ucar B, Aykanat C, Kaya K, Ikinci M (2006) Task assignment in heterogeneous computing systems. J Parallel Distributed Comput 66(1):32–66

    Article  MATH  Google Scholar 

  • Yin PY, Yu SS, Wang PP, Wang YT (2006) A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems. Comput Stand Interface 28(4):441–450

    Article  Google Scholar 

  • Yin PY, Shao BBM, Cheng YP, Yeh CC (2009) Metaheuristic algorithms for task assignment in distributed computing systems: a comparative and integrative approach. Open Artif Intell J 3:16–26

    Article  Google Scholar 

  • Zou D, Gao L, Li S, Wu J, Wang X (2010) A novel global Harmony Search algorithm for task assignment problem. J Syst Softw 83(10):1678–1688

    Article  Google Scholar 

  • Zou D, Liu H, Gao L, Li S (2011) An improved differential evolution algorithm for the task assignment problem. Eng Appl Artif Intell 24(4):616–624

    Article  Google Scholar 

Download references

Acknowledgments

We acknowledge Dr. Bora Ucar (Ucar et al. 2006) from Resource Optimization: Models, Algorithms, and Scheduling (ROMA), France for his kind help in providing us with Data set, and his code as open source through his home page (Uçar et al. 2012).

Author information

Authors and Affiliations

  1. Department of Computer Engineering, College of Engineering and Petroleum, Kuwait University, Kuwait, Kuwait

    Ayed Salman, Imtiaz Ahmad, Hanaa AL-Rushood & Suha Hamdan

Authors
  1. Ayed Salman
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Imtiaz Ahmad
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Hanaa AL-Rushood
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Suha Hamdan
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ayed Salman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Salman, A., Ahmad, I., AL-Rushood, H. et al. Solving the task assignment problem using Harmony Search algorithm. Evolving Systems 4, 153–169 (2013). https://doi.org/10.1007/s12530-012-9058-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12530-012-9058-1

Keywords