×

A parallel compact-TVD method for compressible fluid dynamics employing shared and distributed-memory paradigms. (English) Zbl 1430.76010

Summary: A novel multi-block compact-TVD finite difference method for the simulation of compressible flows is presented. The method combines distributed and shared-memory paradigms to take advantage of the configuration of modern supercomputers that host many cores per shared-memory node. In our approach a domain decomposition technique is applied to a compact scheme using explicit flux formulas at block interfaces. This method offers great improvement in performance over earlier parallel compact methods that rely on the parallel solution of a linear system. A test case is presented to assess the accuracy and parallel performance of the new method.

MSC:

76-06 Proceedings, conferences, collections, etc. pertaining to fluid mechanics
76M20 Finite difference methods applied to problems in fluid mechanics
65Y05 Parallel numerical computation
65Y20 Complexity and performance of numerical algorithms
76L05 Shock waves and blast waves in fluid mechanics

Software:

FDL3DI
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Sun XH, Moitra S. A fast parallel tridiagonal algorithm for a class of CFD applications, Technical Paper 3585, NASA; 1996.; Sun XH, Moitra S. A fast parallel tridiagonal algorithm for a class of CFD applications, Technical Paper 3585, NASA; 1996.
[2] Povitsky A. Parallel directional split solver based on reformulation of pipelined Thomas algorithm, Technical Report CR-1998-208733, NASA; 1998.; Povitsky A. Parallel directional split solver based on reformulation of pipelined Thomas algorithm, Technical Report CR-1998-208733, NASA; 1998.
[3] Ladeinde, F.; Cai, X.; Visbal, M.; Gaitonde, D., Int J Comput Fluid Dyn, 17, 2886-2898 (2003)
[4] Gaitonde D, Visbal M. High-order schemes for Navier-Stokes equations: algorithm and implementation into FDL3D, Technical Report AFRL-VA-WP-RT-1998-3060, Air Force Research Laboratory, Write-Patterson Air Force Base; 1998.; Gaitonde D, Visbal M. High-order schemes for Navier-Stokes equations: algorithm and implementation into FDL3D, Technical Report AFRL-VA-WP-RT-1998-3060, Air Force Research Laboratory, Write-Patterson Air Force Base; 1998.
[5] Sengupta, T. K.; Dipankar, A.; Kameswara Rao, A., J Comput Phys, 220, 654-677 (2007)
[6] Laizet, S.; Lamballais, E.; Vassilicos, J., Comput Fluids, 39, 471-484 (2010)
[7] Pirozzoli, S., J Comput Phys, 178, 81-117 (2001)
[8] Chao, J.; Haselbacher, A.; Balachandar, S., J Comput Phys, 228, 7473-7491 (2009)
[9] Tu, G. H.; Yuan, X. J., J Comput Phys, 225, 2083-2097 (2007)
[10] Chou, S. Y.; Baganoff, D., J Comput Phys, 130, 217-230 (1997)
[11] Fico V, Emerson DR, Reese JM. In: Proceedings of 48th AIAA aerospace science meeting, Orlando, FL, US, 2010. AIAA-2010-0875; 2010.; Fico V, Emerson DR, Reese JM. In: Proceedings of 48th AIAA aerospace science meeting, Orlando, FL, US, 2010. AIAA-2010-0875; 2010.
[12] Huang W, Tafti DK. In: Proceedings of parallel CFD 1999, Williamsburg, VA, US; 1999.; Huang W, Tafti DK. In: Proceedings of parallel CFD 1999, Williamsburg, VA, US; 1999.
[13] Gropp, W. D.; Kaushik, D. K.; Keyes, D. E.; Smith, B. F., Parallel Comput, 27, 337-362 (2001) · Zbl 0971.68191
[14] Rabenseifner R, Hager G, Jost G. In: 17th Euromicro international conference on parallel, distributed and network-based processing, Weimar, Germany; 2009.; Rabenseifner R, Hager G, Jost G. In: 17th Euromicro international conference on parallel, distributed and network-based processing, Weimar, Germany; 2009.
[15] Don, W. S.; Quillen, C. B., J Comput Phys, 122, 244-265 (1995)
[16] Nordén, M.; Sverker, H.; Thuné, M., Future Gener Comput Syst, 22, 194-203 (2006)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.