Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Architectures and Languages Europe

PARLE 1993: PARLE '93 Parallel Architectures and Languages Europe pp 688–691Cite as

Convergence of asynchronous iterations of least fixed points

Extended abstract

  • Poster Session
  • Conference paper
  • First Online:

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

Abstract

This paper proves the convergence of parallel asynchronous iterations of least fixed points of monotone functions on finite-chain partially ordered sets. This provides a basis for efficiently parallizing normal sequential iterative algorithms for computing least fixed points. A detailed version of the paper can be found in [Wei93].

Gesellschaft für Mathematik und Datenverarbeitung mbH

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Conforti et al. A model of efficient asynchronous parallel algorithms on multicomputer systems. Parallel Computing, 18:31–45, 1992.

    Google Scholar 

  2. P. Cousot and R. Cousot. Automatic synthesis of optimal invariant assertions: Mathematical foundations. SIGPLAN Notices, 12(8):1–12, 1977.

    Google Scholar 

  3. J.B. Kam and J.D. Ullman. Global data flow analysis and iterative algorithms. Journal of the ACM, 23(1):158–171, 1976.

    Google Scholar 

  4. H.T. Kung. Synchronized and asynchronous parallel algorithms for multiprocessors. In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results., pages 153–200. Academic Press, 1976.

    Google Scholar 

  5. H. R. Nielson and F. Nielson. Bounded fixed point iteration. In Proc. ACM Symp. on Principle of Programming Language, pages 71–82, 1992.

    Google Scholar 

  6. A. Üresin and M. Dubois. Parallel asynchronous algorithms for discrete data. Journal of the ACM, 37(3):588–606, 1990.

    Google Scholar 

  7. J. Wei. Parallel asynchronous iterations of least fixed points. accepted in Parallel Computing, 1993.

    Google Scholar 

  8. J. Wei and Z. Zhang. Convergence of chaotic iterative least fixed point computations. Intern. J. Computer Mathematics, 40:231–238, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GMD Research Laboratory at the University of Karlsruhe, Vincenz-Prießnitzstr.1, D-7500, Karlsruhe 1, F.R. Germany

    Jiawang Wei

Authors
  1. Jiawang Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arndt Bode Mike Reeve Gottfried Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wei, J. (1993). Convergence of asynchronous iterations of least fixed points. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-56891-3_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56891-9

  • Online ISBN: 978-3-540-47779-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation