Abstract
In the distributed processing area, mapping and scheduling are very important issues in order to exploit the gain from parallelization. The generation of efficient static mapping techniques implies a previous modelling phase of the parallel application as a task graph, which properly reflects its temporal behaviour. In this paper we use a new model, the Temporal Task Interaction Graph (TTIG), which explicitly captures the temporal behaviour of program tasks; and we evaluate the advantages that derive from the use of the TTIG model in task allocation. Experimentation was performed in a current PVM environment, for a set of synthetic graphs which exhibit different ratios of computation/communication cost (coarse-grain, medium-grain). The execution times when these programs were mapped using the information contained in the TTIG model, were compared with the times obtained using the two following mapping alternatives: (a) PVM default scheme and, (b) mapping strategy based on the classical model TIG (Task Interaction Graph). The results confirm that with the TTIG model, better assignments are obtained, providing improvements of up to 49% compared with the PVM assignments and up to 30% compared with TIG assignments.
This work was supported by the CICYT under contract TIC98-0433
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Kwok Y-K. and Ahmad I.: Benchmarking the Task Graph Scheduling Algorithms. Proc. 12th. Int’l Parallel Processing Symp., pp. 531–537, Apr. 1998.
Sadayappan P., Ercal R. and Ramanujam J.: Cluster Partitioning Approaches to Mapping Parallel Programs onto Hypercube. Parallel Computing 13, pp. 1–16, 1990.
Roig C., Ripoll A., Senar M. A., Guirado F. and Luque E.: Modelling Message-Passing Programs for Static Mapping. Proc. 8th. Euromicro Workshop on Parallel and Distributed Processing. pp. 229–236 Jan. 2000.
Fahringer T.: Compile-Time Estimation of Communication Costs for Data Parallel Programs. J. Parallel and Distributed Computing, vol 39, pp. 46–65, 1996.
Gupta M. and Banerjee P.: Compile-Time Estimation of Communication Costs on Multicomputers. Proc. Sixth Int. Parallel Processing Symp. Mar. 1992.
Geist A., Beguelin A., Dongarra J., Jiang W., Manchek R. and Sunderam V.: PVM: Parallel Virtual Machine. A Users’ Guide and Tutorial for Networked Parallel Computing. The MIT Press. Cambridge, Massachusets.
Hui Ch. and Chanson S.: Allocating Task Interaction Graph to Processors in Heterogeneous Networks. IEEE Trans. on Parallel and Distributed Systems. vol 8, n. 9, pp 908–925 Sep. 1997.
Senar M. A., Ripoll A., Cortés A. and Luque E.: Clustering and Reassignment-base Mapping Strategy for Message-Passing Architectures. Int. Par. Proc Symp&Sym. On Par. Dist. Proc. (IPPS/SPDP 98) 415–421. IEEE CS Press USA, 1998.
Senar M. A., Ripoll A., Cortés A. and Luque E.: Performance Comparison of Strategies for Static Mapping of Parallel Programs. High Performance Computing and Networking (HPCN97) Lecture Notes in Computer Science 225, 575–587. Springer. Germay, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roig, C., Ripoll, A., Senar, M.A., Guirado, F., Luque, E. (2000). Exploiting Knowledge of Temporal Behaviour in Parallel Programs for Improving Distributed Mapping. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_35
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive