Internal:Metric Adaptive CDT3D

From crtc.cs.odu.edu
Jump to navigation Jump to search

Preliminary data

# Tetrahedra # Vertices Isotropic Boundary

Refinement (MMGS)

Boundary

Recovery

Mesh Refinement Total Time (sec) Memory (GB)
#Iterations Par. Deactivation Par. Vertex Creation Vertex Insertion Partition Par. Reconnection
case 1 (x8) 14,094,106 2,390,948 3.04 4.93 78 7.42 12.38 5.62 82.91 238.17 352.66 6.1
case 2 (x10) 26,859,966 4,546,172 3.78 11.64 80 14.69 25.17 9.85 154.10 437.97 655.05 10.4
case 3 (x20) 209,865,483 35,344,507 25.64 169.53 276 311.71 381.31 74.69 3781.33 9321.10 14045.37 74.31

Notes

  • using cube and Polar-1 metric from [UGAWG https://github.com/UGAWG/adapt-benchmarks/tree/master/cube-cylinder#polar-1]
  • No boundary adaptation,due to the increasing prepossessing time and the difficulty to recover the boundary.
  • Grouping (that enhances significantly performance) is disabled due to Delaunay criterion issues.
  • The experiments performed on a DELL workstation with Linux Red Hat Enterprise, 24 hardware cores Intel® Xeon® CPU E5-2697v2@2.70 GHz, and 757 GB RAM
  • Using 24+24 (HyperThreading) threads
  • parameters --met=1 --meval=2 --mrecm2=1 --mrec4=1 --nadapt=0 --mpp=2 --qstatr=1 --outmesh=${NAME}.meshb --ndfs=0 --nthreads=24 --nbuckets=640 --nthreadsaf=24 --nbucketsaf=640 --blockmul=500000 --nqual=0 --nminpts=30 --ordt=1 --pardeact=1 --mdse=0

TO DO (shorterm)

  • Try enabling sorting ( sortp)

TO DO (long term)