Abstract
Program module allocation problem (PMAP) is an important application of the quadratic assignment problem (QAP), which has been shown to be NPcomplete. The aim of the PMAP is to allocate a package of program modules to a number of distributed processors such that the incurred cost is minimal subject to specified resource constraints. We propose to employ a new metaheuristic, the cyber swarm algorithm (CSA), for finding the near optimal solution with reasonable time. The CSA has previously manifested excellent performance on solving continuous optimization problems. Our experimental results show that the CSA is more effective and efficient than modifications of genetic algorithm, particle swarm optimization, and harmony search in tackling the PMAP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lo, V.M.: Task Assignment in Distributed Systems. Ph.D. dissertation, Dep. Comput. Sci., Univ. Illinois (1983)
Lee, C.H., Shin, K.G.: Optimal Task Assignment in Homogeneous Networks. IEEE Transactions on Parallel and Distributed Systems 8, 119–129 (1997)
Vidyarthi, D.P., Tripathi, A.K.: Maximizing Reliability of Distributed Computing System With Task Allocation Using Simple Genetic Algorithm. Journal of Systems Architecture 47, 549–554 (2001)
Yang, B., Hu, H., Guo, S.: Cost-oriented Task Allocation and Hardware Redundancy Policies in Heterogeneous Distributed Computing Systems Considering Software Reliability. Computers & Industrial Engineering 56, 1687–1696 (2009)
Semchedine, F., Bouallouche-Medjkoune, L., Assani, D.: Task Assignment Policies in Distributed Server Systems: A Survey. Journal of Network and Computer Applications 34, 1123–1130 (2011)
Ernst, A., Hiang, H., Krishnamoorthy, M.: Mathematical Programming Approaches for Solving Task Allocation Problems. In: Proc. of the 16th National Conf. of Australian Society of Operations Research (2001)
Billionnet, A., Costa, M.C., Sutter, A.: An Efficient Algorithm for a Task Allocation Problem. Journal of ACM 39, 502–518 (1992)
Chen, G.H., Yur, J.S.: A Branch-And-Bound-With-Underestimates Algorithm for the Task Assignment Problem With Precedence Constraint. In: Proc. of the 10th International Conf. on Distributed Computing Systems, pp. 494–501 (1990)
Pendharkar, P.C.: Lower Bounds For Constrained Task Allocation Problem in Distributed Computing Environment. In: IEEE Canadian Conference on Electrical & Computer Engineering (2012)
Lee, C.H., Shin, K.G.: Optimal Task Assignment in Homogeneous Networks. IEEE Transactions on Parallel and Distributed Systems 8, 119–129 (1997)
Kafil, M., Ahmad, I.: Optimal Task Assignment in Heterogeneous Distributed Computing Systems. IEEE Concurrency 6, 42–50 (1998)
Tripathi, A.K., Sarker, B.K., Kumar, N.: A GA Based Multiple Task Allocation Considering Load. International Journal of High Speed Computing, 203–214 (2000)
Pagea, A.J., Keanea, T.M., Naughton, T.J.: Multi-heuristic Dynamic Task Allocation Using Genetic Algorithms in a Heterogeneous Distributed System. Journal of Parallel and Distributed Computing 70, 758–766 (2010)
Hamam, Y., Hindi, K.S.: Assignment of Program Tasks To Processors: A Simulated Annealing Approach. European Journal of Operational Research 122, 509–513 (2000)
Ho, S.Y., Lin, H.S., Liauh, W.H., Ho, S.J.: OPSO: Orthogonal Particle Swarm Optimization and Its Application to Task Assignment Problems. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans 38, 288–298 (2008)
Zou, D., Gaoa, L., Li, S., Wua, J., Wang, X.: A Novel Global Harmony Search Algorithm for Task Assignment Problem. Journal of Systems and Software 83, 1678–1688 (2010)
Lusa, A., Potts, C.N.: A Variable Neighbourhood Search Algorithm for the Constrained Task Allocation Problem. Journal of the Operational Research Society 59, 812–822 (2008)
Yin, P.Y., Shao, B.M., Cheng, Y.P., Yeh, C.C.: Metaheuristic Algorithms for Task Assignment in Distributed Computing Systems: A Comparative and Integrative Approach. The Open Artificial Intelligence Journal 3, 16–26 (2009)
Lin, J., Cheng, A.M.K., Kumar, R.: Real-Time Task Assignment in Heterogeneous Distributed Systems with Rechargeable Batteries. In: International Conference on Advanced Information Networking and Applications, pp. 82–89 (2009)
Yin, P.Y., Glover, F., Laguna, M., Zhu, J.X.: Cyber Swarm Algorithms – Improving Particle Swarm Optimization Using Adaptive Memory Strategies. European Journal of Operational Research 201, 377–389 (2010)
Omran, M.: Special Issue on Scatter Search and Path Relinking Methods. International Journal of Swarm Intelligence Research 2 (2011)
Maquera, G., Laguna, M., Gandelman, D.A., Sant’Anna, A.P.: Scatter Search Applied to the Vehicle Routing Problem with Simultaneous Delivery and Pickup. International Journal of Applied Metaheuristic Computing 2, 1–20 (2011)
Yin, P.Y., Yu, S.S., Wang, P.P., Wang, Y.T.: A Hybrid Particle Swarm Optimization Algorithm for Optimal Task Assignment in Distributed Systems. Computer Standards & Interfaces 28, 441–450 (2006)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, Reading (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Yin, PY., Wang, PP. (2014). A Cyber Swarm Algorithm for Constrained Program Module Allocation Problem. In: Huynh, V., Denoeux, T., Tran, D., Le, A., Pham, S. (eds) Knowledge and Systems Engineering. Advances in Intelligent Systems and Computing, vol 245. Springer, Cham. https://doi.org/10.1007/978-3-319-02821-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-02821-7_16
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02820-0
Online ISBN: 978-3-319-02821-7
eBook Packages: EngineeringEngineering (R0)