Abstract
Many memory-bound distributed applications require frequent redistribution of data. Pinar and Hendrickson investigated two families of memory-limited redistribution algorithms. The first family has many advantages, but fails on certain inputs, and, if not implemented carefully, may lead to an explosion in the number of local data copies. The second family eliminates the possibility of failure at the expense of considerable additional overhead. We carefully analyze these algorithms and develop a modified method that potentially combines advantages of each. The resulting algorithm has been implemented in MADRE and experiments reveal its performance to be superior to that of other MADRE algorithms in most cases.
This research was supported by the National Science Foundation under Grants CCF-0733035 and CCF-0540948.
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
Bertrand, F., Bramley, R., Sussman, A., Bernholdt, D.E., Kohl, J.A., Larson, J.W., Damevski, K.B.: Data redistribution and remote method invocation in parallel component architectures. In: IPDPS 2005: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2005) - Papers, Washington, DC, USA, p. 40.2. IEEE Computer Society Press, Los Alamitos (2005)
Bertrand, F., Yuan, Y., Chiu, K., Bramley, R.: An approach to parallel MxN communication. In: Proceedings of the Los Alamos Computer Science Institute (LACSI) Symposium, Santa Fe, NM (October 2003)
Park, N., Prasanna, V.K., Raghavendra, C.: Efficient algorithms for block-cyclic array redistribution between processor sets. In: Supercomputing 1998: Proceedings of the 1998 ACM/IEEE Conference on Supercomputing (CDROM), Washington, DC, USA, 1998, pp. 1–13. IEEE Computer Society Press, Los Alamitos (1998)
Pinar, A., Hendrickson, B.: Interprocessor communication with limited memory. IEEE Transactions on Parallel and Distributed Systems 15(7), 606–616 (2004)
Siegel, S.F., Siegel, A.R.: MADRE: The Memory-Aware Data Redistribution Engine. In: Lastovetsky, A., Kechadi, T., Dongarra, J. (eds.) EuroPVM/MPI 2008. LNCS, vol. 5205, pp. 218–226. Springer, Heidelberg (2008)
Siegel, S.F., Siegel, A.R.: MADRE: The Memory-Aware Data Redistribution Engine. Technical Report UDEL-CIS 2009/335, Department of Computer and Information Sciences, University of Delaware (2009); The International Journal of High Performance Computing Applications (to appear)
Thakur, R., Choudhary, A., Fox, G.: Runtime array redistribution in HPF programs. In: Proc. of Scalable High Performance Computing Conference, pp. 309–316. IEEE, Los Alamitos (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Siegel, S.F., Siegel, A.R. (2009). A Memory-Efficient Data Redistribution Algorithm. In: Ropo, M., Westerholm, J., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2009. Lecture Notes in Computer Science, vol 5759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03770-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-03770-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03769-6
Online ISBN: 978-3-642-03770-2
eBook Packages: Computer ScienceComputer Science (R0)