Skip to main content
SpringerLink
Log in

ParTopS: compact topological framework for parallel fragmentation simulations

  • Original Article
  • Published:
Engineering with Computers Aims and scope Submit manuscript

Abstract

Cohesive models are used for simulation of fracture, branching and fragmentation phenomena at various scales. Those models require high levels of mesh refinement at the crack tip region so that nonlinear behavior can be captured and physical results obtained. This imposes the use of large meshes that usually result in computational and memory costs prohibitively expensive for a single traditional workstation. If an extrinsic cohesive model is to be used, support for dynamic insertion of cohesive elements is also required. This paper proposes a topological framework for supporting parallel adaptive fragmentation simulations that provides operations for dynamic insertion of cohesive elements, in a uniform way, for both two- and three-dimensional unstructured meshes. Cohesive elements are truly represented and are treated like any other regular element. The framework is built as an extension of a compact adjacency-based serial topological data structure, which can natively handle the representation of cohesive elements. Symmetrical modifications of duplicated entities are used to reduce the communication of topological changes among mesh partitions and also to avoid the use of locks. The correctness and efficiency of the proposed framework are demonstrated by a series of arbitrary insertions of cohesive elements into some sample meshes.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25

Similar content being viewed by others

References

  1. Zhang Z, Paulino GH, Celes W (2007) Extrinsic cohesive modelling of dynamic fracture and microbranching instability in brittle materials. Int J Numer Methods Eng 72(8):893–923

    Article  Google Scholar 

  2. Papoulia KD, Vavasis SA, Ganguly P (2006) Spatial convergence of crack nucleation using a cohesive finite-element model on a pinwheel-based mesh. Int J Numer Methods Eng 67(1):1–16

    Article  MATH  MathSciNet  Google Scholar 

  3. Beall MW, Shephard MS (1997) A general topology-based mesh data structure. Int J Numer Methods Eng 40(9):1573–1596

    Article  MathSciNet  Google Scholar 

  4. Celes W, Paulino GH, Espinha R (2005) A compact adjacency-based topological data structure for finite element mesh representation. Int J Numer Methods Eng 64(11):1529–1565

    Article  MATH  Google Scholar 

  5. Garimella RV (2002) Mesh data structure selection for mesh generation and FEA applications. Int J Numer Methods Eng 55(4):451–478

    Article  MATH  Google Scholar 

  6. Park K, Paulino GH, Roesler JR (2009) A unified potential-based cohesive model of mixed-mode fracture. J Mech Phys Solids. doi:10.1016/j.jmps.2008.10.003 (in press)

  7. Owen SJ, Shephard MS (2003) Editorial: special issue on trends in unstructured mesh generation. Int J Numer Methods Eng 58(2):159–160

    Article  Google Scholar 

  8. Pandolfi A, Ortiz M (1998) Solid modeling aspects of three-dimensional fragmentation. Eng Comput 14(4):287–308

    Article  MATH  Google Scholar 

  9. Pandolfi A, Ortiz M (2002) An efficient adaptive procedure for three-dimensional fragmentation simulations. Eng Comput 18(2):148–159

    Article  Google Scholar 

  10. Paulino GH, Jin Z-H, Dodds RH Jr (2003) Failure of functionally graded materials. In: Karihaloo B, Knauss WG (eds) Comprehensive structure integrity, 2(13) edn. Elsevier, Amsterdam, pp 607–644

    Google Scholar 

  11. Zhang Z, Paulino GH (2005) Cohesive zone modeling of dynamic failure in homogeneous and functionally graded materials. Special Issue on Inelastic Response of Multiphase Materials. Int J Plast 21(6):1195–1254

    Article  MATH  Google Scholar 

  12. Celes W, Paulino GH, Espinha R (2005) Efficient handling of implicit entities in reduced mesh representations. J Comput Inf Sci Eng 5(4):348–359 (Special Issue on Mesh-Based Geometric Data Process)

    Article  Google Scholar 

  13. Paulino GH, Celes W, Espinha R, Zhang Z (2008) A general topology-based framework for adaptive insertion of cohesive elements in finite element meshes. Eng Comput 24(1):59–78

    Article  Google Scholar 

  14. Kalé LV, Krishnan S (1993) CHARM++: a portable concurrent object oriented system based on C++. In: Paepcke A (ed) Proceedings of OOPSLA’93. ACM Press, September 1993, pp 91–108

  15. Kalé LV, Krishnan S (1996) Charm++: Parallel Programming with Message-Driven Objects. In: Wilson GV, Lu P (eds) Parallel Programming using C++. MIT Press, London, pp 175–213

  16. Lawlor O, Chakravorty S, Wilmarth T, Choudhury N, Dooley I, Zheng G, Kalé L (2006) ParFUM: a parallel framework for unstructured meshes for scalable dynamic physics applications. Eng Comput 22(3–4):215–235

    Article  Google Scholar 

  17. Remacle J-F, Klaas O, Flaherty JE, Shephard MS (2002) Parallel algorithm oriented mesh database. Eng Comput 18(3):274–284

    Article  Google Scholar 

  18. Seol ES, Shephard MS (2006) Efficient distributed mesh data structure for parallel automated adaptive analysis. Eng Comput 22(3–4):197–213

    Article  Google Scholar 

  19. Foster I (1995) Designing and building parallel programs: concepts and tools for parallel software engineering. Addison–Wesley, Boston

    MATH  Google Scholar 

  20. Waltz J (2002) Derived data structure algorithms for unstructured finite element meshes. Int.J Numer Methods Eng 54(7):945–963

    Article  MATH  Google Scholar 

  21. Gara A, Blumrich MA, Chen D et al (2005) Overview of the Blue Gene/L system architecture. IBM J Res Dev 49(2/3):195–212

    Article  Google Scholar 

  22. Karypis G, Kumar V (1995) METIS—Serial Graph Partitioning and Fill-reducing Matrix Ordering Library, Department Computer Science Engineering, University of Minnesota. http://www.cs.umn.edu/~karypis/metis

  23. Karypis G, Kumar V (1998) Multilevel k-way partitioning scheme for irregular graphs. J Parallel Distrib Comput 48(1):96–129

    Article  MathSciNet  Google Scholar 

  24. Karypis G, Kumar V (1998) A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J Parallel Distrib Comput 48(1):71–95

    Article  MathSciNet  Google Scholar 

  25. Hendrickson B, Devine K (2000) Dynamic load balancing in computational mechanics. Comput Methods Appl Mech Eng 184(2–4):485–500

    Article  MATH  Google Scholar 

  26. Devine K, Boman E, Heaphy R, Hendrickson B, Vaughan C (2002) Zoltan data management services for parallel dynamic applications. Comput Sci Eng 4(2):90–97

    Article  Google Scholar 

  27. Ozturan C (1995) Distributed environment and load balancing for adaptive unstructured meshes. PhD Thesis, Comput Sci Department, Rensselaer Polytechnic Institute

  28. Ozturan C, de Cougny HL, Shephard MS, Flaherty JE (1994) Parallel adaptive mesh refinement and redistribution on distributed memory computers. Comp Methods Appl Mech Eng 119(1–2):123–127

    Article  Google Scholar 

  29. Kirk BS, Peterson JW, Stogner RH, Carey GF (2006) libMesh: a C++ library for parallel adaptive mesh refinement/coarsening simulations. Eng Comput 22(3):237–254

    Article  Google Scholar 

  30. Stewart JR, Edwards HC (2004) A framework approach for developing parallel adaptive multiphysics applications. Finite Elem Anal Des 40(12):1599–1617

    Article  Google Scholar 

  31. Remacle J-F, Shephard MS (2003) An algorithm oriented mesh database. Int J Numer Methods Eng 58(2):349–374

    Article  MATH  Google Scholar 

  32. Wang S (2007) Krylov Subspace Methods for Topology Optimization on Adaptive Meshes. PhD Thesis, Department of Computer Science, University of Illinois at Urbana-Champaign

  33. Wang S, de Sturler E, Paulino GH (2007) Large-scale topology optimization using preconditioned Krylov subspace methods with recycling. Int J Numer Methods Eng 69(12):2441–2468

    Article  Google Scholar 

  34. Mangala S, Wilmarth T, Chakravorty S, Choudhury N, Kalé LV, Geubelle PH (2008) Parallel adaptive simulations of dynamic fracture events. Eng Comput 24(3):341–358

    Article  Google Scholar 

  35. Huang C, Lawlor O, Kale LV (2003) Adaptive MPI. In: Proceedings of the 16th international workshop on languages and compilers for parallel computing (LCPC 2003). Lecture Notes in Computer Science, vol 2958, pp 306–322

  36. The Message Passing Interface (MPI) standard library (2009) Argonne National Laboratory. http://www-unix.mcs.anl.gov/mpi

  37. Choudhury N (2006) Parallel Incremental adaptivity for Unstructured Meshes in Two Dimensions. MSc. Dissertation, Department of Computer Science, Univesity of Illinois at Urbana-Champaign

  38. Quinn MJ (2004) Parallel Programming in C with MPI and OpenMP. McGraw-Hill, New York

    Google Scholar 

  39. Kumar V, Gupta A (1994) Analyzing scalability of parallel algorithms and architectures. J Parallel Distrib Comput 22(3):379–391

    Article  Google Scholar 

  40. Grama AY, Gupta A, Kumar V (1993) Isoefficiency: measuring the scalability of parallel algorithms and architectures. IEEE Parallel Distrib Technol 1(3):12–21

    Article  Google Scholar 

Download references

Acknowledgments

RE and WC would like to thank the Tecgraf laboratory at PUC-Rio, which is mainly funded by the Brazilian oil company, Petrobras. RE and NR also thank CNPq (National Council for Scientific and Technological Development of Brazil) for partially funding this research. GHP acknowledges support from the National Science Foundation (NSF) through Grant CMMI #0800805. The information presented in this paper is the sole opinion of the authors and does not necessarily reflect the views of the sponsoring agencies.

Author information

Authors and Affiliations

  1. Tecgraf, Computer Science Department, PUC-Rio, Pontifical Catholic University of Rio de Janeiro, Rua Marquês de São Vicente 225, Rio de Janeiro, RJ, 22453-900, Brazil

    Rodrigo Espinha & Waldemar Celes

  2. Computer Science Department, PUC-Rio, Pontifical Catholic University of Rio de Janeiro, Rua Marquês de São Vicente 225, Rio de Janeiro, RJ, 22453-900, Brazil

    Noemi Rodriguez

  3. Newmark Laboratory, Department of Civil and Environmental Engineering, University of Illinois at Urbana-Champaign, MC-250, 205 North Mathews Avenue, Urbana, IL, 61801-2397, USA

    Glaucio H. Paulino

Authors
  1. Rodrigo Espinha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Waldemar Celes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Noemi Rodriguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Glaucio H. Paulino
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Waldemar Celes.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Espinha, R., Celes, W., Rodriguez, N. et al. ParTopS: compact topological framework for parallel fragmentation simulations. Engineering with Computers 25, 345–365 (2009). https://doi.org/10.1007/s00366-009-0129-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00366-009-0129-2

Keywords

Search

Navigation