VSL Publications

A Memory-Efficient Data Redistribution Algorithm

Cite
Stephen F. Siegel and Andrew R. Siegel, A Memory-Efficient Data Redistribution Algorithm. In: Ropo, M., Westerholm, J., and Dongarra, J. (Eds), Recent Advances in Parallel Virtual Machine and Message Passing Interface, 16th European PVM/MPI User's Group Meeting, Proceedings (EuroPVM/MPI 2009). Lecture Notes in Computer Science 5759, Springer-Verlag (2009), pages 219–229.
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.
Downloads
  1. Paper on publisher's web site
  2. medra_pvmmpi_2009.pdf (preprint)
Related Links
  1. The MADRE Web Page
BibTeX 
@InProceedings{siegel-siegel:2009:madre_pvmmpi,
	Author = {Stephen F. Siegel and Andrew R. Siegel},
	Crossref = {pvmmpi2009},
	Pages = {219--229},
	Title = {A Memory-Efficient Data Redistribution Algorithm}}

@Proceedings{pvmmpi2009,
	Booktitle = {Recent Advances in {P}arallel {V}irtual {M}achine and {M}essage {P}assing {I}nterface, 16th {E}uropean {PVM/MPI} User's Group Meeting, Proceedings},
	Editor = {Matti Ropo and Jan Westerholm and Jack Dongarra},
	Publisher = {Springer},
	Series = {LNCS},
	Title = {Recent Advances in {P}arallel {V}irtual {M}achine and {M}essage {P}assing {I}nterface, 16th {E}uropean {PVM/MPI} User's Group Meeting, Proceedings},
	Volume = {5759},
VSL | Publications