An efficient implementation of the spectral partitioning algorithm on connection machine systems | SpringerLink
Skip to main content
Springer Nature Link
Log in

An efficient implementation of the spectral partitioning algorithm on connection machine systems

  • VI. Scientific Computing, Numerical Software, Aided-Engineering and Computer
  • Conference paper
  • First Online:
Future Tendencies in Computer Science, Control and Applied Mathematics (INRIA 1992)

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

Included in the following conference series:

Abstract

A parallel implementation of the spectral partitioning algorithm is developed. A two-level parallelization is proposed to achieve maximum efficiency on massively parallel computers. Special features of the Connection Machine software such as scan operations and communication primitives are used to improve the efficiency of the algorithm. Decompositions of unstructured finite element meshes demonstrate the performance of this implementation.

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.

Similar content being viewed by others

References

  1. F. Chalot and T.J.R. Hughes, “Analysis of hypersonic flows in thermochemical equilibrium by application of the Galerkin/least-squares formulation,” ICIAM 91: Proceedings of the International Conference for Industrial and Applied Mathematics, ed. R.E. O'Malley, SIAM, 1992.

    Google Scholar 

  2. CMSSL for CM Fortran, Version 2.2, Thinking Machines Corporation, Cambridge, MA, 1991.

    Google Scholar 

  3. R. Das, D.J. Mavriplis, J. Saltz, S. Gupta and R. Ponnusamy, “The design and implementation of a parallel unstructured Euler solver using software primitives,” AIAA 30th Aerospace Sciences Meeting, AIAA-92-0562, 1992.

    Google Scholar 

  4. M. Fiedler, “Algebraic connectivity of graphs,” Czechoslovak Mathematical Journal, 23 (1973) 298–305.

    MathSciNet  Google Scholar 

  5. M. Fiedler, “Eigenvectors of acyclic matrices,” Czechoslovak Mathematical Journal, 25 (1975) 607–618.

    MathSciNet  Google Scholar 

  6. M. Fiedler, “A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory,” Czechoslovak Mathematical Journal, 25 (1975) 619–633.

    MathSciNet  Google Scholar 

  7. Z. Johan, “Data parallel finite element techniques for large-scale computational fluid dynamics,” Ph.D. Thesis, Stanford University, 1992.

    Google Scholar 

  8. K.K. Mathur, “On the use of randomized address maps in unstructured three-dimensional finite element simulations,” Technical Report, TMC-37/CS90-4, Thinking Machines Corporation, Cambridge, MA, 1990.

    Google Scholar 

  9. B.N. Parlett, H. Simon and L.M. Stringer, “On estimating the largest eigenvalue with the Lanzcos algorithm,” Mathematics of Computation, 38 (1982) 153–165.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Pothen, H.D. Simon and K.-P. Liou, “Partitioning sparse matrices with eigen-vectors of graphs,” SIAM Journal of Matrix Analysis and Applications, 11 (1990) 430–452.

    Article  MATH  MathSciNet  Google Scholar 

  11. H.D. Simon, “Partitioning of unstructured problems for parallel processing,” Computing Systems in Engineering, 2 (1991) 135–148.

    Article  Google Scholar 

  12. V. Venkatakrishnan, H.D. Simon and T.J. Barth, “A MIMD implementation of a parallel Euler solver for unstructured grids,” Report RNR-91-024, NASA Ames Research Center, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Applied Mechanics, Stanford University, 94305-4040, Stanford, CA

    Zdenek Johan & Thomas J. R. Hughes

Authors
  1. Zdenek Johan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas J. R. Hughes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Bensoussan J. -P. Verjus

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Johan, Z., Hughes, T.J.R. (1992). An efficient implementation of the spectral partitioning algorithm on connection machine systems. In: Bensoussan, A., Verjus, J.P. (eds) Future Tendencies in Computer Science, Control and Applied Mathematics. INRIA 1992. Lecture Notes in Computer Science, vol 653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56320-2_72

Download citation

  • DOI: https://doi.org/10.1007/3-540-56320-2_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56320-4

  • Online ISBN: 978-3-540-47520-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation