Abstract
This paper proposes a hybrid approach for dynamic scheduling of soft real-time tasks in multiprocessor environment using hybrid quantum-inspired genetic algorithm (HQIGA) combined with well-known heuristic earlier-deadline-first (EDF) algorithm. HQIGA exploits the power of quantum computation which relies on the concepts and principles of quantum mechanics. The HQIGA comprises variable size chromosomes represented as qubits for exploration in the Hilbert space 0–1 using the updating operator rotation gate. Earlier-deadline-first algorithm is employed in the proposed work for finding fitness values. In order to establish the comparison with the classical genetic algorithm-based approach, this paper demonstrates the usage of various numbers of processors and tasks along with arbitrary processing time. Simulation results show that quantum-inspired genetic algorithm-based approach outperforms the classical counterpart in finding better fitness values using same number of generations.
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
Mall, R.: Real-Time Systems: Theory and Practice. Pearson Education, India (2007)
Ramamritham, K., Stankovic, J.A.: Scheduling algorithms and operating systems support for real-time systems. Proc. IEEE 82(1), 55–67 (1994)
Manimaran, G., Siva Ram Murthy, C.: An efficient dynamic scheduling algorithm for multiprocessor real-time systems. IEEE Trans. Parallel Distrib. Syst. 9(3), 312–319 (1998)
Srinivasan, A., Anderson, A.: Fair scheduling of dynamic task systems on multiprocessors. J. Syst. Softw. 77, 67–80 (2005)
Kwok, Y.K., Ahmad, I.: Dynamic critical path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Trans. Parallel Distrib. Syst. 7(5), 506–521 (1996)
Correa, R.C., Ferreira, A., Rebreyend, P.: Schuduling multiprocessor tasks with genetic algorithms. IEEE Trans. Parallel Distrib. Syst. 10(8), 825–837 (1999)
Wu, A.S., Yu, H.: An incremental genetic algorithm approach to multiprocessor scheduling. IEEE Trans. Parallel Distrib. Syst. 15(9), 824–834 (2004). September
Bonyadi, M.R., Moghaddam, M.E.: A bipartite genetic algorithm for multi-processor task scheduling. Int. J. Parallel Program. 37(5), 462–487 (2009)
Sivanandam, S.N., Visalakshi, P., Bhuvaneswari, A.: Multiprocessor scheduling using hybrid particle swarm optimization with dynamically varying inertia. Int. J. Comput. Sci. Appl. 4(3), 95–106 (2007)
Chen, H., Cheng, A.K.: Applying ant colony optimization to the partitioned scheduling problem for heterogeneous multiprocessors. Special Issue IEEE RTAS 2005 Work-in-Progress 2(2), 11–14 (2005)
Ercan, M.F.: A hybrid particle swarm optimization approach for scheduling flow-shops with multiprocessor tasks. In: Proceedings of the International Conference on Information Science and Security, pp. 13–16 (2008)
Dhingra, S., Gupta, S., Biswas, R.: Genetic algorithm parameters optimization for bi-criteria multiprocessor task scheduling using design of experiments. World Academy of Science, Engineering and Technology, International Journal of Computer, Control, Quantum and Information Engineering, vol. 8, no. 4 (2014)
Bohler, M., Moore, F. Pan, Y.: Improved multiprocessor task scheduling using genetic algorithms. In: FLAIRS Conference (1999)
Hou, E.S.H., Ansari, N., Hong, R.: A genetic algorithm for multiprocessor scheduling. IEEE Trans. Parallel Distrib. Syst. 10(8), 113–120 (1999)
Gary, M.R., Johnson, D.S.: Computers and Imractibility: A Guide to the Theory of NP Completeness. W.H Freeman and Company, New York (1979)
Cheng, S.C., Huang, Y.M.: Dynamic Real-Time Scheduling for Multi-Processor Tasks using Genetic Algorithm. Comput. Softw. Appli. Conf. COMPSAC 2004, 154–161 (2004)
Narayan, A., Moore, M.: Quantum-Inspired Genetic Algorithms. Proc. IEEE Evol. Comput. 1, 61–66 (1996)
Han, K.H., Kim, J.H.: Genetic quantum algorithm and its application to combinatorial optimization problem. Proc. Congr. Evol. Comput. 1, 1354–1360 (2000)
Eggers, E.: Dynamic Scheduling Algorithms in Real-time, Multiprocessor Systems. Term paper, EECS Department, Milwaukee School of Engineering, North Broadway, Milwaukee, WI, USA (1998–99)
Han, K.H., Kim, J.H.: Quantum-Inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans. Evol. Comput. 6(6), 580–593 (2002)
Mcmohan, D.: Quantum Computing Explained. Wiley, New Jersey (2008)
Dahal, K., Hossain, A., Varghese, B., Abraham, A. Xhafa, F., Daradoumis A.: Scheduling in multiprocessor system using genetic algorithms. In: Proceedings of the 7th IEEE Computer Information System and Industrial Mangement Applications, pp. 281–286 (2008)
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
Konar, D., Sharma, K., Pradhan, S.R., Sharma, S. (2016). An Efficient Dynamic Scheduling Algorithm for Soft Real-Time Tasks in Multiprocessor System Using Hybrid Quantum-Inspired Genetic Algorithm. In: Das, S., Pal, T., Kar, S., Satapathy, S., Mandal, J. (eds) Proceedings of the 4th International Conference on Frontiers in Intelligent Computing: Theory and Applications (FICTA) 2015. Advances in Intelligent Systems and Computing, vol 404. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2695-6_1
Download citation
DOI: https://doi.org/10.1007/978-81-322-2695-6_1
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2693-2
Online ISBN: 978-81-322-2695-6
eBook Packages: EngineeringEngineering (R0)