Skip to main content
SpringerLink
Log in

Overlapping and short-cutting techniques in loosely synchronous irregular problems

  • Regular Talks
  • Conference paper
  • First Online:
Book cover Solving Irregularly Structured Problems in Parallel (IRREGULAR 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1457))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    Google Scholar 

  2. L. R. Scott and Xie Dexuan; Parallel linear stationary iterative methods. Research Report UH/MD 239, Dept. Math., Univ. Houston, 1997.

    Google Scholar 

  3. G. A. Geist and C. H. Romine; LU factorization algorithms on distributed-memory multiprocessor architectures. SIAM J. Sci. Stat. Comput., 9:639–649, 1988.

    Google Scholar 

  4. Message Passing Interface Forum; MPI: A message Passing Interface Standard. June 12, 1995, Version 1.1, http://www.mcs.anl.gov/mpi/

    Google Scholar 

  5. B. Bagheri, T. W. Clark and L. R. Scott; Pfortran: A Parallel Dialect of Fortran. Fortran Forum, ACM Press, 11, pp. 3–20, 1992.

    Google Scholar 

  6. W. H. Press, B. P.Flannery, A. A. Teulkosky, W. T. Vetterling; Numerical Methods: The Art of Scientific Computing. Cambridge 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Texas Center for Advanced Molecular Computation, University of Houston, Texas, USA

    Ernesto Gomez

  2. Department of Mathematics and Texas Center for Advanced Molecular Computation, University of Houston, Texas, USA

    L. Ridgway Scott

Authors
  1. Ernesto Gomez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Ridgway Scott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alfonso Ferreira José Rolim Horst Simon Shang-Hua Teng

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation