Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Processing

CONPAR 1981: Conpar 81 pp 25–36Cite as

Tree machines and divide-and-conquer algorithms

  • Matching The Structure Of Computations And Machine Architecture
  • Conference paper
  • First Online:

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

Abstract

A tree machine consists of a number of processors (each with its own memory) mutually connected via communication branches so as to form a binary tree. Two processors may communicate only via a common communication link. Such a tree machine is a completely general, concurrent processing engine and can be used for problems decomposed in a hierarchical way. Implementation of divide-and-conquer algorithms on a tree machine is discussed. Algorithms for which a tree machine can be effective are characterized. Examples are shown and it is proven that for a class of k-dimensional divide-and-conquer algorithms the running time may be reduced from 0(N logk−1 N) on a sequential machine to 0(kN) on a tree machine.

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. Bentley, J.L., Multidimensional divide-and-conquer. Comm. ACM, 23 (1980), pp. 214–229.

    Article  MATH  MathSciNet  Google Scholar 

  2. Blum, M. et al., Time bounds for selection. J. Comptr. Syst. Sci., 7 (1972), pp. 448–461.

    Article  MathSciNet  Google Scholar 

  3. Browning, S.A., A tree machine. Lambda, 1 (1980), pp. 31–36.

    Google Scholar 

  4. Hoare, C.A.R., Quicksort. Comp. J., 5(1962), pp. 10–25.

    Article  MATH  MathSciNet  Google Scholar 

  5. Hoare, C.A.R., Communicating sequential processes. Comm. ACM, 21(1978), pp. 666–677.

    Article  MATH  Google Scholar 

  6. Martin, A.J., A distributed architecture for parallel recursive computations. Internal report, AJM 18, Eindhoven, Philips Research Laboratories, 1979.

    Google Scholar 

  7. Peters, F.J., Sparse matrices and substructures. Mathematical Centre Tracts 119. Amsterdam, Mathematical Centre, 1980.

    MATH  Google Scholar 

  8. Peters, F.J., Parallel large scale finite element computations, in: Proceedings IEEE Conference on Circuits and Computers for Large Scale Systems (N.B. Guy Rabbat ed.), New York, 1980, pp. 992–995.

    Google Scholar 

  9. Rose, D.J. and G.F. Whitten, A recursive analysis of dissection strategies, in Sparse matrix computations (J.R. Bunch and D.J. Rose eds.), New York, Academic Press, 1976.

    Google Scholar 

  10. Strang, G and G.J. Fix, An analysis of the finite element method. Englewood Cliffs, Prentice-Hall, 1973.

    MATH  Google Scholar 

  11. Zienkiewicz, O.C., The finite element method, third edition, Lond, McGraw-Hill, 1977.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Eindhoven University of Technology, 5600 MB, Eindhoven, the Netherlands

    Frans J. Peters

Authors
  1. Frans J. Peters
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Brauer P. Brinch Hansen D. Gries C. Moler G. Seegmüller J. Stoer N. Wirth Wolfgang Händler

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peters, F.J. (1981). Tree machines and divide-and-conquer algorithms. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105107

Download citation

  • DOI: https://doi.org/10.1007/BFb0105107

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10827-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation