Abstract
This paper addresses task assignment problem on heterogeneous multicore systems with time constraint considering communication overhead. Processing cores in a heterogeneous system considered in this paper are grouped into clusters according to core types. Therefore, clusters have different computation capabilities. Communication links among various clusters have different communication capacities as well. The goal of heterogeneous task assignment problem is to minimize the total system cost for allocating a set of given tasks with data dependencies to a group of heterogeneous clusters while the time constraint is satisfied. The system cost considered in this paper is related to both execution load and communication load on various clusters and communication links. The general heterogeneous assignment problem is NP-complete. In this paper, we present the ILP formulation for solving the heterogeneous assignment problem. We also propose a heuristic, the Ratio Greedy Assign algorithm (RGA), to solve the problem efficiently for directed acyclic graphs (DAG). According to our experimental results, the Ratio Greedy Assign algorithm generates near-optimal results efficiently for all the benchmarks, while the ILP method cannot find a solution with acceptable computation time for large-sized benchmarks, such as 10-4lattice filter. Compared with a method that assigns all the tasks to a cluster of homogeneous cores, the RGA algorithm reduces the total system cost by 35.1% on average with four heterogeneous clusters. It reduces the cost by 24.6% on average with three heterogeneous cluster.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chen, T., Raghavan, R., Dale, J.N., Iwata, E.: Cell broadband engine architecture and its first implementation - a performance view. IBM Journal of Research and Development 51(5), 559–572 (2007)
Nvidia Corporation, http://www.nvidia.com/object/tegra-3-processor.html
Ucar, B., Aykanat, C., Kaya, K., Ikinci, M.: Task assignment in heterogeneous computing systems. Journal of Parallel and Distributed Computing 66(1), 32–46 (2006)
Attiya, G., Hamam, Y.: Task Allocation for Minimizing Programs Completion Time in Multicomputer Systems. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3044, pp. 97–106. Springer, Heidelberg (2004)
Yin, P.Y., Yu, S.S., Wang, P.P., Wang, Y.T.: Task allocation for maximizing reliability of a distributed system using hybrid particle swarm optimization. Journal of Systems and Software 80(5), 724–735 (2007)
Shen, C.C., Tsai, W.H.: A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion. IEEE Transactions on Computers C-34(3), 197–203 (1985)
Ito, R., Parhi, K.: Register minimization in cost-optimal synthesis of dsp architectures. In: IEEE Signal Processing Society [Workshop on] VLSI Signal Processing, VIII, pp. 207–216 (October 1995)
Martinez, J., Ipek, E.: Dynamic multicore resource management: A machine learning approach. IEEE Micro 29(5), 8–17 (2009)
Ma, Y.C., Chen, T.F., Chung, C.P.: Branch-and-bound task allocation with task clustering-based pruning. Journal of Parallel and Distributed Computing 64(11), 1223–1240 (2004)
Kang, Q., He, H., Song, H.: Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm. Journal of Systems and Software 84(6), 985–992 (2011)
Sivanandam, S.N., Visalakshi, P.: Multiprocessor scheduling using hybrid particle swarm optimization with dynamically varying inertia. International Journal of Computer Science and Applications 4(5), 95–106 (2007)
Shao, Z., Zhuge, Q., Xue, C., Sha, E.M.: Efficient assignment and scheduling for heterogeneous dsp systems. IEEE Transactions on Parallel and Distributed Systems 16(6), 516–525 (2005)
Zivojnovic, V., Martinez, J., Schlager, C., Meyr, H.: Dspstone: A dsp-oriented benchmarking methodology. In: Proc. of ICSPAT 1994, Dallas (October 1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, L., Liu, J., Hu, J., Zhuge, Q., Liu, D., Sha, E.H.M. (2012). Efficient Task Assignment on Heterogeneous Multicore Systems Considering Communication Overhead. In: Xiang, Y., Stojmenovic, I., Apduhan, B.O., Wang, G., Nakano, K., Zomaya, A. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2012. Lecture Notes in Computer Science, vol 7439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33078-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-33078-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33077-3
Online ISBN: 978-3-642-33078-0
eBook Packages: Computer ScienceComputer Science (R0)