Skip to main content

Generalized asynchronous iterations

  • Namerical Algorithms (Session 3.2)
  • Conference paper
  • First Online:
CONPAR 86 (CONPAR 1986)

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

Included in the following conference series:

Abstract

Asynchronous iterative methods for multiprocessors are generalized to relaxation techniques involving discrete variables. Asynchronous algorithms are more efficient than synchronized algorithms in multiprocessors because processes do not have to wait on each other at synchronization points. Sufficient conditions for the convergence of generalized asynchronous iterations are given and proved. Applications of the theory presented in this paper include asynchronous relaxation algorithms for scene labeling in image processing applications.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. G.M. Baudet, "Asynchronous Iterative Methods," JACM, April 1978.

    Google Scholar 

  2. D. Chazan, and W. Miranker, "Chaotic Relaxation," Linear Algebra and Applications, 1969, pp.199–222.

    Google Scholar 

  3. M. Dubois and F.A. Briggs, "Performance of Synchronized Iterative Processes in Multiprocessor Systems," IEEE Transactions on Software, Vol. SE-8, No.4, July 1982, pp.419–432.

    Google Scholar 

  4. H.T. Kung, "Synchronized and Asynchronous Parallel Algorithms for Multiprocessors," Algorithms and Complexity: New Directions and Recent Results, J.F. Traub Ed., New York: Academic Press, 1976.

    Google Scholar 

  5. J.T. Robinson, "Some Analysis Techniques for Asynchronous Multiprocessor Algorithms," IEEE Transactions on Software Engineering, Vol. SE-5, Jan. 1979, pp24–30.

    Google Scholar 

  6. A. Rosenfeld, et al. "Scene Labeling by Relaxation Operations," IEEE Transactions on Systems, Man and Cybernetics, June 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wolfgang Händler Dieter Haupt Rolf Jeltsch Wilfried Juling Otto Lange

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Uresin, A., Dubois, M. (1986). Generalized asynchronous iterations. In: Händler, W., Haupt, D., Jeltsch, R., Juling, W., Lange, O. (eds) CONPAR 86. CONPAR 1986. Lecture Notes in Computer Science, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16811-7_180

Download citation

  • DOI: https://doi.org/10.1007/3-540-16811-7_180

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44856-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics