Internal:Metric Adaptive CDT3D
Preliminary data (no sorting)
| # Tetrahedra | # Vertices | Isotropic Boundary
Refinement (MMGS) |
Boundary
Recovery |
Mesh Refinement | Total Time
(without MMGS) |
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 | 3,781.33 | 9,321.10 | 14,045.37 | 74.31 |
| case 4 (x30) | 691,716,442 | 116,311,739 | 51.327 | 823.07 | 271 | 970.64 | 1,087.89 | 248.59 | 12,032.78 | 30,515.05 | 45,691.21 | 243 |
Preliminary data (with sorting)
| # Tetrahedra | # Vertices | Isotropic Boundary
Refinement (MMGS) |
Boundary
Recovery |
Mesh Refinement | Total Time
(without MMGS) |
Memory (GB) | |||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| # Iterations | Par. Deactivation | Par. Vertex Creation | Vertex Insertion | Sorting | Partition | Par. Reconnection | |||||||
| case 1 (x5) | 3,563,574 | 608,096 | 1.11 | 0.93 | 48 | 1.75 | 2.68 | 1.15 | 12.56 | 14.43 | 59.57 | 93.63 | 2.95 |
| case 2 (x7) | 9,490,845 | 1,612,343 | 1.78 | 2.82 | 71 | 4.75 | 7.89 | 3.45 | 40.02 | 50.94 | 157.99 | 268.8 | 4.74 |
| case 3 (x15) | 85,860,524 | 14,487,842 | 10.74 | 60.196 | 86 | 44.88 | 80.90 | 27.86 | 372.75 | 519.68 | 1,267.87 | 2,377.63 | 30.89 |
Notes
- Using a scaled unit cube ([0,1]3) and Polar-1 metric from UGAWG
- No boundary adaptation,due to the increasing prepossessing time and the difficulty to recover the boundary.
mrecm2needs to be disabled due to problems with inpshere falling in infinite loopmrec4needs to be on or highly anisotropic elements will not be refined ( this is due to the double flag omission of CDT3D)- 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 - raw data is under
crtc-gpu.cs.odu.edu:/research/ctsolakis/QCIRCLE
TO DO (shorterm)
- Try enabling sorting ( sortp)
- export quality to tecplot format
TO DO (long term)
- Parallel quality data
- replace recursive sorting with std::sort or others and this as comparator http://www.tiac.net/%7Esw/2008/10/Hilbert/moore/
- Parallel sorting (
_gnu_parallel) http://epic-alfa.kavli.tudelft.nl/share/doc/libstdc++-docs-4.4.7/html/api/a00865_source.html#l00074 - Replace spin locks in vertex creation
- Rollback treatment
- investigate insphere and grouping
mrecm2=0 - smoothing : Tetrahedral Mesh Improvement Using Swapping and Smoothing, Lori A. Freitag and Carl Ollivier-Gooch