Abstract
In this paper we present a static mapping heuristic, called Heterogeneous Multi-phase Mapping (HMM), which allows a suboptimal mapping of a parallel program onto a metacomputer to minimize the program execution time. HMM allocates parallel tasks by exploiting the information embedded in the parallelism forms used to implement an application. Moreover, it uses a local search technique together with the tabu search meta-heuristic. The experimental results show that the proposed approach performs well promising a significant potential to develop efficient mapping solutions for metacomputers.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Freund, R.F., Siegel, H.J.: Heterogeneous Processing. IEEE Computer 26(6), 13–17 (1993)
Cattlet, C.E., Smarr, L.: Metacomputing. Communication of the ACMÂ 53(6), 45 (1992)
Foster, I., Kesselman, C.: The Grid: blueprint for new computing infrastructure. Morgan Kaufmann Publishers, San Francisco (1998)
Ali, H.H., El-Rewini, H., Lewis, T.G.: Task Scheduling in Parallel and Distributed Systems. PTR Prentice Hall, Englewood Cliffs (1994)
Eshaghian, M.M.: Heterogeneous Computing. Artech House Publishers (1996)
Lo, V.M.: Heuristic Algorithms for Task Assignment in Distributed Systems. IEEE Transaction on Computers 37(11), 1384–1397 (1988)
Shen, C., Tsai, W.: A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minmax Criterion. IEEE Transaction on Computers C-34(3), 197–203 (1985)
Iverson, M.A., Ozguner, F., Follen, G.J.: Parallelizing Existing Applications in a Distributed Heterogeneous Environment. In: Proc. 4th IEEE Heterogeneous Computing Workshop (HCW 1995), pp. 93–100 (1995)
Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions on Parallel and Distributed Systems 13(3) (March 2002)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Hey, A.J.G.: Experiments in MIMD Parallelism. In: Odijk, E., Syre, J.-C., Rem, M. (eds.) PARLE 1989. LNCS, vol. 365, Springer, Heidelberg (1989)
Gropp, W., Lusk, E., Skjellum, A.: Using MPI Portable Parallel Programming with the Message-Passing Interface. The MIT Press, Cambridge (1999)
Skillicorn, D.B.: Models for Practical Parallel Computation. International Journal of Parallel Programming 20(2), 133–158 (1991)
Jiang, H., Bhuyan, L.N., Ghosal, D.: Approximate Analysis of Multiprocessing Task Graphs. In: Proceedings of International Conference on Parallel Processing, vol. III, pp. 228–235 (1990)
Baraglia, R., Ferrini, R., Ritrovato, P.: A Static Mapping Heuristics to Map Parallel Applications to Heterogeneous Computing Systems. Concurrency: Practice and Experience, 17, 1579–1605 (2005) published online
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baraglia, R., Ferrini, R., Ritrovato, P. (2006). HMM: A Static Mapping Algorithm to Map Parallel Applications on Grids. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_88
Download citation
DOI: https://doi.org/10.1007/11752578_88
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34141-3
Online ISBN: 978-3-540-34142-0
eBook Packages: Computer ScienceComputer Science (R0)