Revision as of 15:42, 15 May 2018

Delta Wing 50k Complexity (Scitech 2018)

All time data are given in seconds.
# Threads	# Tetrahedra	# Vertices	Intitialize Bg Mesh	Boundary Adaptation (MMGS)	Boundary Recovery	Mesh Refinement						Total Time (without MMGS)	Memory (GB)
# Threads	# Tetrahedra	# Vertices	Intitialize Bg Mesh	Boundary Adaptation (MMGS)	Boundary Recovery	# Iterations	Par. Deactivation	Par. Vertex Creation	Vertex Insertion	Partition	Par. Reconnection	Total Time (without MMGS)	Memory (GB)
1	357,165	62,177	1.44	6.32	0.36	20	2.09	11.92	0.09	1.26	57.35	80.97	0.44
6	36,1037	62,795	1.49	6.23	0.35	21	0.51	2.78	0.11	1.45	14.06	27.12	0.63
12	363,278	63,198	1.41	6.27	0.33	22	0.32	1.55	0.11	1.62	8.24	19.99	0.86
24	363,756	63,270	1.49	6.26	0.33	22	0.2	0.88	0.11	1.6	5.13	16.15	1.31

according to Mike's email mesh should be around 100k vertices
Metric Input Data available at https://github.com/UGAWG/parallel-adapt-results
Input surface is the coase mesh available at https://github.com/UGAWG/solution-adapt-cases
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
Memory is measured at the end of Mesh refinement and thus it may reach a slightly higher value before the point of measurement
parameters --brec=2 --met=1 --meval=3 --mrecm2=1 --mrec4=1 --nadapt=2 --malign=0 --mpp=2 --ndfs=0 --nthreads=$THREADS --nbuckets=20*$THREADS --nthreadsaf=20*$THREADS --nbucketsaf=20*${THREADS} --blockmul=500000 --nqual=0 --nminpts=30 --ordt=0 --pardeact=1 --mdse=0
using commit bb7819619eb9b8831ac1d4515b9605869df72b47 or tag Delta-wiki
smoothing : Tetrahedral Mesh Improvement Using Swapping and Smoothing, Lori A. Freitag and Carl Ollivier-Gooch PDF
An Efficient Method to Solve the Minmax Problem Directly PDF

@@ Line 92: / Line 92: @@
 * parameters <code> --brec=2 --met=1 --meval=3 --mrecm2=1 --mrec4=1  --nadapt=2 --malign=0 --mpp=2  --ndfs=0 --nthreads=$THREADS --nbuckets=20*$THREADS --nthreadsaf=20*$THREADS --nbucketsaf=20*${THREADS} --blockmul=500000 --nqual=0 --nminpts=30 --ordt=0 --pardeact=1 --mdse=0  </code>
 * using commit <code> bb7819619eb9b8831ac1d4515b9605869df72b47</code> or tag <code> Delta-wiki </code>
-* smoothing : [https://onlinelibrary.wiley.com/doi/abs/10.1002/%28SICI%291097-0207%2819971115%2940%3A21%3C3979%3A%3AAID-NME251%3E3.0.CO%3B2-9 Tetrahedral Mesh Improvement Using Swapping and Smoothing, Lori A. Freitag and Carl Ollivier-Gooch ]
+* smoothing : [https://onlinelibrary.wiley.com/doi/abs/10.1002/%28SICI%291097-0207%2819971115%2940%3A21%3C3979%3A%3AAID-NME251%3E3.0.CO%3B2-9 Tetrahedral Mesh Improvement Using Swapping and Smoothing, Lori A. Freitag and Carl Ollivier-Gooch ] [http://www.cs.odu.edu/crtc/internal/Christos/Freitag_et_al-1997-International_Journal_for_Numerical_Methods_in_Engineering.pdf PDF]
-* [https://epubs.siam.org/doi/abs/10.1137/0715011 An Efficient Method to Solve the Minimax Problem Directly]
+* [https://epubs.siam.org/doi/abs/10.1137/0715011 An Efficient Method to Solve the Minmax Problem Directly] [http://www.cs.odu.edu/crtc/internal/Christos/Charalambous_An_Efficient_Method_To_Solve_The_Minmax_problem_directly.pdf PDF]