Abstract
The paper presents comparison of the two scheduling algorithms developed for program structurization for execution in dynamic SMP clusters implemented in Systems on Chip (SoC) technology. SoC modules are built of a set of processors, memory modules and a multi–bus interconnection network. A set of such SoCs is interconnected by a global communication network. Inter–processor communication inside SoC modules uses a novel technique of data transfers on the fly. The algorithms present two different scheduling approaches. The first uses ETF–based genetically supported list scheduling heuristics to map nodes of a program to processors. The second is a clustering–based algorithm using Moldable Tasks (MT) to structure the graph. Both algorithms structure computations and local data transfers to introduce processor switching and data transfers on the fly. The algorithms were tested using a set of automatically generated parameterized program graphs. The results were compared to results obtained using a classic ETF–based list scheduling without data transmissions on the fly.
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
Hwang, J.-J., Chow, Y.-C., Anger, F.D., Lee, C.-Y.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing 18(2) (1989)
Leung, J.Y.-T., Anderson, J.H.: Handbook of scheduling. In: Algorithms, Models and Performance Analysis. Chapman and Hall, Boca Raton (2004)
Lepere, R., Trystram, D., Woeginger, G.J.: Approximation algorithms for scheduling malleable tasks under precedence constraints. In: 9th Annual European Symposium on Algorithms, LNCS. Springer, Heidelberg (2001)
Benini, L., De Micheli, G.: Networks on Chips: A New SoC Paradigm. IEEE Computing, 70–78 (Janyary 2002)
Maśko, Ł.: Atomic operations for task scheduling for systems based on communication on–the–fly between SMP clusters. In: 2nd International Symposium on Parallel and Distributed Computing, ISPDC 2003, Ljubljana, Slovenia. IEEE CS Press, Los Alamitos (2003)
Maśko, Ł., Dutot, P.–F., Mounié, G., Trystram, D., Tudruj, M.: Scheduling Moldable Tasks for Dynamic SMP Clusters in SoC Technology. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 879–887. Springer, Heidelberg (2006)
Tchernykh, A., et al.: Two Level Job–Scheduling Strategies for a Computational Grid. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 774–781. Springer, Heidelberg (2006)
Tudruj, M., Maśko, Ł.: Parallel Matrix Multiplication Based on Dynamic SMP Clusters in SoC Technology. In: Thulasiraman, P., He, X., Xu, T.L., Denko, M.K., Thulasiram, R.K., Yang, L.T., et al. (eds.) ISPA Workshops 2007. LNCS, vol. 4743, pp. 375–385. Springer, Heidelberg (2007)
Maśko, Ł., Tudruj, M.: Task Scheduling for SoC-Based Dynamic SMP Clusters with Communication on the Fly. In: Proceedings of the ISPDC 2008 Conference, Kraków, Poland. IEEE CS Press, Los Alamitos (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maśko, Ł., Tudruj, M., Mounie, G., Trystram, D. (2010). Comparison of Program Task Scheduling Algorithms for Dynamic SMP Clusters with Communication on the Fly. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2009. Lecture Notes in Computer Science, vol 6068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14403-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-14403-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14402-8
Online ISBN: 978-3-642-14403-5
eBook Packages: Computer ScienceComputer Science (R0)