Abstract
The emergence of multicore processors makes multicore task scheduling a focus of researchers. Since the multicore task scheduling problem is NP-hard, in most cases only approximate algorithms can be adopted to resolve it. This paper provides a detail analysis of the four aspects of applying variable neighborhood search algorithm (VNSA) to the multicore task scheduling problem. We further give a solution: (1) we propose a general solution model named task assignment matrix (TAM) (2) and define relevant element swap operations between the TAM instances; (3) then we present a construction method of the neighborhood and the neighborhood set; (4) finally we introduce a local search strategy for the neighborhood set. We have proved the effectiveness of this scheme through experiments. The results show that the scheduled tasks with different communication to computation ratio have a 1.079-4.258 times performance improvement.
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
Hill, M.D., Marty, M.R.: Amdahl’s Law in the Multicore Era. Computer 41, 33–38 (2008)
Lusa, A., Potts, C.A.: Variable Neighbourhood Search Algorithm for the Constrained Task Allocation Problem. Journal of the Operational Research Society 59, 812–822 (2007)
Geng, X., Xu, G., Wang, D.: A Task Scheduling Algorithm Based on Multicore Processors. In: 2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC), pp. 942–945 (2011)
Song, F., YarKhan, A., Dongarra, J.: Dynamic Task Scheduling for Linear Algebra Algorithms on Distributed-Memory Multicore Systems. In: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis (2009)
Chen, W., Hung, H.: Energy-efficient Scheduling of Periodic Real-time Tasks for Reliable Multicore Systems. In: Electrical and Control Engineering (ICECE), pp. 5887–5890 (2011)
Mladenovic, N., Hansen, P.: Variable Neighborhood Search. Computers & Operations Research 24, 1097–1100 (1997)
Blum, C.: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys (CSUR) 35, 268–308 (2003)
Hansen, P., Mladenović, N.: Variable Neighborhood Search: Principles and Applications. European Journal of Operational Research 130, 449–467 (2001)
Cheng, H.: A High Efficient Task Scheduling Algorithm Based on Heterogeneous Multi-Core Processor. In: 2010 2nd Database Technology and Applications (DBTA), pp. 26–29 (2010)
Ilavarasan, E., Thambidurai, P.: Low Complexity Performance Effective Task Scheduling Algorithm for Heterogeneous Computing Environments. Journal of Computer Sciences 3, 94–103 (2007)
Kwok, Y.-K., Ahmad, I.: Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm. Journal of Parallel and Distributed Computing 47, 58–77 (1997)
Kwok, Y.: Benchmarking the Task Graph Scheduling Algorithms. In: Parallel Processing Symposium, IPPS/SPDP 1998, pp. 531–537 (1998)
Olteanu, A., Marin, A.: Generation and Evaluation of Scheduling DAGs: How to Provide Similar Evaluation 1, 57–66 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, C., Jiang, J., Xu, X., Han, X., Cao, Q. (2013). Applying Variable Neighborhood Search Algorithm to Multicore Task Scheduling Problem. In: Xu, W., Xiao, L., Zhang, C., Li, J., Yu, L. (eds) Computer Engineering and Technology. NCCET 2013. Communications in Computer and Information Science, vol 396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41635-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-41635-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41634-7
Online ISBN: 978-3-642-41635-4
eBook Packages: Computer ScienceComputer Science (R0)