Abstract
Assigning real-time tasks in a heterogeneous parallel and distributed computing environment is a challenging problem, in general, to be NP hard. This paper addresses the problem of finding a solution for real-time task assignment to heterogeneous processors without exceeding the processor capacity and fulfilling the deadline constraints. The proposed Hybrid Max–Min Ant System (HACO-TS) makes use of the merits of Max–Min ant system with Tabu search algorithm for assigning tasks efficiently than various metaheuristic approaches. The Tabu search is used to intensify the search by the MMAS method. The performance of the proposed HACO-TS algorithm has been tested on consistent and inconsistent heterogeneous multiprocessor systems. Experimental comparisons with existing Modified BPSO algorithms demonstrate the effectiveness of the proposed HACO-TS algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Chen H, Cheng AMK, Kuo YW (2011) Assigning real-time tasks to heterogeneous processors by applying ant colony optimization. J Parallel Distrib Comput 71(1):132–142
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman & Co, San Francisco
Srikanth UG, Maheswari VU, Shanthi P, Siromoney A (2012) Tasks scheduling using ant colony optimization. J Comput Sci 8(8):1314–1320
Prescilla K, Selvakumar AI (2013) Modified binary particle swarm optimization algorithm application to real-time task assignment in heterogeneous multiprocessor. Microprocess Microsyst 37(6):583–589
Abdelhalim MB (2008) Task assignment for heterogeneous multiprocessors using re-excited particle swarm optimization. In: Proceedings of the IEEE international conference on computer and electrical Engineering, pp 23–27
Braun TD, Siegel HJ, Beck N, Bölöni L, Maheswaran M, Reuther AI, Robertsong JP, Mitchell DT, Bin Y, Debra H, Freund RF (2001) A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J Parallel Distrib Comput 61(56):810–837
Kang Q, He H (2013) Honeybee mating optimization algorithm for task assignment in heterogeneous computing systems. Intell Autom Soft Comput 19(1):69–84
Poongothai M, Rajeswari A, Kanishkan V (2014) A heuristic based real time task assignment algorithm for the heterogeneous multiprocessors. IEICE Electron Express 11(3):1–9
Krishna CM, Shin KG (2010) Real-time systems. Tata MacGraw-Hill Edition
Stützle T, Hoos H (1997) The MAX–MIN ant system and local search for the traveling salesman problem. In: Proceedings of the IEEE international conference on evolutionary computation, pp 309–314
Thamilselvan R, Balasubramanie P (2012) Integration of genetic algorithm with tabu search for job shop scheduling with unordered subsequence exchange crossover. J Comput Sci 8(5):681–693
Ho SL, Yang S, Ni G, Machado JM (2006) A modified ant colony optimization algorithm modeled on tabu-search methods. IEEE Trans Magn 42(4):1195–1198
Prescilla K, Selvakumar AI (2013) Comparative study of task assignment on consistent and inconsistent heterogeneous multiprocessor system. In: Proceedings of the IEEE international conference on advanced computing and communication systems (ICACCS), pp 1–6
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer India
About this paper
Cite this paper
Poongothai, M., Rajeswari, A. (2016). A Hybrid Ant Colony Tabu Search Algorithm for Solving Task Assignment Problem in Heterogeneous Processors. In: Suresh, L., Panigrahi, B. (eds) Proceedings of the International Conference on Soft Computing Systems. Advances in Intelligent Systems and Computing, vol 398. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2674-1_1
Download citation
DOI: https://doi.org/10.1007/978-81-322-2674-1_1
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2672-7
Online ISBN: 978-81-322-2674-1
eBook Packages: EngineeringEngineering (R0)