Skip to main content

Self-Avoiding walks over adaptive unstructured grids

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

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

Included in the following conference series:

Abstract

In this paper, we present self-avoiding walks as a novel technique to “linearize” a triangular mesh. Unlike space-filling curves which are based on a geometric embedding, our algorithm is combinatorial since it uses the mesh connectivity only. We also show how the concept can be easily modified for adaptive grids that are generated in a hierarchical manner based on a set of simple rules, and made amenable for efficient parallelization. The proposed approach should be very useful in the run-time partitioning and load balancing of adaptive unstructured grids.

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.

References

  1. Biswas, R., Strawn, R.C.: Mesh Quality Control for Multiply-Refined Tetrahedral Grids. Appl. Numer. Math. 20 (1996) 337–348

    Article  MATH  Google Scholar 

  2. Gerlach, J.: Application of Natural Indexing to Adaptive Multilevel Methods for Linear Triangular Elements. RWCP Technical Report 97-010 (1997)

    Google Scholar 

  3. Gerlach, J., Heber, G.: Fundamentals of Natural Indexing for Simplex Finite Elements in Two and Three Dimensions. RWCP Technical Report 97-008 (1997)

    Google Scholar 

  4. Griebel, M., Zumbusch, G.: Hash-Storage Techniques for Adaptive Multilevel Solvers and their Domain Decomposition Parallelization. AMS Contemp. Math. Series 218 (1998) 279–286

    MathSciNet  Google Scholar 

  5. Heber, G., Biswas, R., Gao, G.R.: Self-Avoiding Walks over Two-Dimensional Adaptive Unstructured Grids. NAS Technical Report NAS-98-007 (1998)

    Google Scholar 

  6. Ou, C.-W., Ranka, S., Fox, G.: Fast and Parallel Mapping Algorithms for Irregular Problems, J. of Supercomp. 10 (1995) 119–140

    Google Scholar 

  7. Parashar, M., Browne, J.C.: On Partitioning Dynamic Adaptive Grid Hierarchies. 29th Hawaii Intl. Conf. on System Sciences (1996) 604–613

    Google Scholar 

  8. Pilkington, J.R., Baden, S.B.: Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves, IEEE Trans. Par. Dist. Sys. 7 (1996) 288–300

    Article  Google Scholar 

  9. Salmon, J., Warren, M.S.: Parallel, Out-of-Core Methods for Fast Evaluation of Long-Range Interactions. 8th SIAM Conf. on Par. Proc. for Sci. Comput. (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Heber, G., Biswas, R., Gao, G.R. (1999). Self-Avoiding walks over adaptive unstructured grids. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097981

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics