Benchmarking of a distributed-memory, high-order discontinuous finite element flow solver on a shared-memory parallel architecture
Source abstract
Abstract
High-order numerical schemes implemented on high-performance parallel computers are of special interest for contemporary numerical simulations, especially in computational fluid dynamics. In this study, first, a high-order parallel flow solver is presented for some test cases of aerodynamic simulations. The flow solver is based on a discontinuous Galerkin finite element method on arbitrary grids with different orders of polynomial approximation for solving the compressible flow model. Second, the distributed-memory parallel implementation of the flow solver is benchmarked on a shared-memory multicore system. A distributed-memory parallel application can be executed on shared-memory architectures by assuming that each of the parallel processes assumes separate memory address space, although all are present in a common memory bank. This approach can offer an effective measure to address several issues related to limited resources, especially for uninterrupted electric supply. The scalability of the parallel application is analyzed by varying the problem workload per process for the test cases. For some test cases in the present study, over 90% parallel efficiency per process is also observed. The performance of the distributed-memory program on the shared-memory architecture establishes suitability and robustness of the approach for small to medium scale problems, at least.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Advanced Numerical Methods in Computational Mathematics · Computational Fluid Dynamics and Aerodynamics · Numerical methods for differential equations
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University 1 , Multan, Pakistan
Department of Mechanical Engineering, École de Technologie Supérieure ÉTS 2 , 1100 Notre-Dame W, Montreal, Québec H3C 1K3, Canada
References (68)
Show source-provided references
1. Int. J. Numer. Methods Fluids · 2013 · 72 · 81110.1002/fld.3767 ↗
2. 2013 · 87
3. A. Ali, “An efficient implementation of discontinuous Galerkin method on commodity parallel systems,” Ph.D. thesis, Centre for Advanced Studies in Pure and Applied Mathematics (CASPAM); Bahauddin Zakariya University (BZU), Multan, Pakistan, 2013.
4. J. Comput. Phys. · 2008 · 227 · 887510.1016/j.jcp.2008.06.035 ↗
5. J. Eng. Appl. Sci. · 2010 · 29 · 59
6. Shock Waves · 1994 · 4 · 2510.1007/bf01414629 ↗
7. J. Comput. Phys. · 1997 · 137 · 3810.1006/jcph.1997.5793 ↗
8. 1973
9. J. Comput. Phys. · 1997 · 131 · 26710.1006/jcph.1996.5572 ↗
10. J. Comput. Phys. · 1998 · 141 · 19910.1006/jcph.1998.5892 ↗
11. Cockburn · 2000 · 510.1007/978-3-642-59721-3 ↗
12. SIAM J. Numer. Anal. · 2002 · 39 · 174910.1137/s0036142901384162 ↗
13. J. Comput. Phys. · 2001 · 172 · 71810.1006/jcph.2001.6853 ↗
14. 2007
15. J. Comput. Phys. · 2008 · 227 · 820910.1016/j.jcp.2008.05.025 ↗
16. Commun. Comput. Phys. · 2017 · 21 · 123110.4208/cicp.oa-2016-0090 ↗
17. Comput. Fluids · 2008 · 37 · 42710.1016/j.compfluid.2007.02.009 ↗
18. Comput. Mech. · 1996 · 18 · 39710.1007/s004660050158 ↗
19. J. M. Acosta, “Numerical algorithms for three dimensional computational fluid dynamic problems,” Ph.D. thesis, Polytechnic University of Catalunia, Spain, 2001.
20. Philos. Trans. R. Soc. London, Ser. A · 2002 · 360 · 121110.1098/rsta.2002.0990 ↗
21. Komatsu Tech. Rep. · 2005 · 51 · 8
22. Komatsu Tech. Rep. · 2007 · 53 · 6
23. Schröder · 2010 · 15310.1007/978-3-642-04088-7 ↗
24. Tromeur-Dervout · 2010 · 34710.1007/978-3-642-14438-7 ↗
25. 2019
26. 2019
27. 2003
28. Int. J. Numer. Methods Eng. · 2008 · 73 · 59710.1002/nme.2081 ↗
29. J. Comput. Phys. · 2006 · 211 · 49210.1016/j.jcp.2005.05.029 ↗
30. J. Sci. Comput. · 2001 · 16 · 17310.1023/a:1012873910884 ↗
31. Keyes · 1999 · 233
32. 2011
33. 2010
34. Parallel Comput. · 2000 · 26 · 151910.1016/s0167-8191(00)00048-x ↗
35. Dongarra · 2003 · 491
36. Magoules · 2008
37. Rajasekaran · 2008 · 44-1
38. Concurr. Comput.: Pract. Exp. · 2001 · 13 · 32710.1002/cpe.569 ↗
39. 2005 · 7
40. 2011
41. Parallel Comput. · 2001 · 27 · 33710.1016/s0167-8191(00)00075-2 ↗
42. SIAM J. Sci. Comput. · 1998 · 20 · 35910.1137/s1064827595287997 ↗
43. K. J. Fidkowski, M.S. thesis, Massachusetts Institute of Technology, 2004, available at https://dspace.mit.edu/handle/1721.1/16657.
44. 2007
45. M. Yano, “Massively parallel solver for the high-order Galerkin least-squares method,” Ph.D. thesis, Massachusetts Institute of Technology, USA, 2009.10.2514/6.2009-4135 ↗
46. 1999
47. 2003
48. Ropo · 2009 · 2010.1007/978-3-642-03770-2 ↗
49. S. Moreaud, “Mouvement de données et placement des tâches pour les communications haute performance sur machines hiérarchiques,” Ph.D. thesis, Université Bordeaux I, 2011.
50. 2011 · 532
51. 2009 · 462
52. Lastovetsky · 2008 · 13010.1007/978-3-540-87475-1 ↗
53. 2000
54. 2002 · 681
55. 2003
56. 2003 · 118
57. Ropo · 2009 · 17410.1007/978-3-642-03770-2 ↗
58. 1999 · 71
59. 2010 · 331
60. 2010 · 182
61. J. Parallel Distrib. Comput. · 2005 · 65 · 41410.1016/j.jpdc.2004.11.010 ↗
62. 2009
63. Chapman · 2011 · 1210.1007/978-3-642-21487-5 ↗
64. Bock · 2005 · 40910.1007/b138710 ↗
65. Mohr · 2006 · 1110.1007/11846802 ↗
66. Zima · 2006 · 485
67. 2009 · 427
68. 2013 · 239