Abstract
We introduce short-cutting and overlapping techniques that, separately and in combination show promise of speedup for parallel processing of problems with irregular or asymmetric computation. Methodology is developed and demonstrated on an example problem. Experiments on an IBM SP-2 and a workstation cluster are presented.
Preview
Unable to display preview. Download preview PDF.
References
R. Ponnusamy, J. Saltz, and A. Choudhary; Runtime-Compilation Techniques for Data Partitioning and Communication Schedule Reuse. Proceedings Supercomputing '93, pages 361–370, Portland, Oregon, November 15–19, 1993
L. R. Scott and Xie Dexuan; Parallel linear stationary iterative methods. Research Report UH/MD 239, Dept. Math., Univ. Houston, 1997.
G. A. Geist and C. H. Romine; LU factorization algorithms on distributed-memory multiprocessor architectures. SIAM J. Sci. Stat. Comput., 9:639–649, 1988.
Message Passing Interface Forum; MPI: A message Passing Interface Standard. June 12, 1995, Version 1.1, http://www.mcs.anl.gov/mpi/
B. Bagheri, T. W. Clark and L. R. Scott; Pfortran: A Parallel Dialect of Fortran. Fortran Forum, ACM Press, 11, pp. 3–20, 1992.
W. H. Press, B. P.Flannery, A. A. Teulkosky, W. T. Vetterling; Numerical Methods: The Art of Scientific Computing. Cambridge 1986
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gomez, E., Scott, L.R. (1998). Overlapping and short-cutting techniques in loosely synchronous irregular problems. In: Ferreira, A., Rolim, J., Simon, H., Teng, SH. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1998. Lecture Notes in Computer Science, vol 1457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018532
Download citation
DOI: https://doi.org/10.1007/BFb0018532
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64809-3
Online ISBN: 978-3-540-68533-3
eBook Packages: Springer Book Archive