arrow
Return

Large-eddy simulations on distributed shared memory clusters

delete2004-10-01
delete3
PRE
AI
C
Christopher Stone
S
Suresh Menon
DOI:10.1016/j.jpdc.2004.08.001delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The practicality of Large-eddy simulation (LES) of turbulent combustion, as is found in gas turbine engines, on clusters of commodity PC-based symmetric multi-processor (SMP) systems in 2-, 4-, and 8-way configurations has been investigated. Bandwidth demands from both memory and networking in the benchmark LES algorithm are shown to the primary performance inhibitors. Contention in the various SMP architectures tested is shown to compound these two hardware limitations. To investigate the ability of the parallel clustered systems, low-level hardware studies are conducted in conjunction with bench-marking of the LES application. The hardware tests focus on memory and communication contention under loads found in the LES algorithm. For comparison, the benchmarks are also applied to two industry leading high-performance super-computing architectures. It is found that contention in the 4- and 8-way SNIP architecture studied here limits their applicability while the 2-way systems shows competitive performance and speed-up compared to its industry counterparts. It is concluded that design-level combustion LES on clusters of commodity hardware, when equipped with sufficient memory and communication bandwidth. are a viable substitute for more expensive super-computing platforms. (C) 2004 Elsevier Inc. All rights reserved.
Keywords:
computational fluid dynamics (CFD)
distributed memory computing
parallel performance benchmarks
memory bandwidth
network bandwidth
cluster computing
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Journal of Parallel and Distributed Computing cover
Journal of Parallel and Distributed Computing
IF:
4
Papers:
3.8K
Citations:
4.8K

Organization

No organization information available
Cited Papers

Cited Papers

Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
err2016-04-29
err0
PREAI
errJ. Batle; C. H. Raymond Ooi; Ahmed Farouk; M. Abutalib; S. Abdalla
errShare
errSave
Sunlight‐Triggerable Transient Energy Harvester and Sensors Based on Triboelectric Nanogenerator Using Acid‐Sensitive Poly(phthalaldehyde)
err2019-10-01
err0
PREAI
errChangsheng Wu; Jisu Jiang; Hengyu Guo; Xianjie Pu; Lisha Liu; Wenbo Ding; Paul A. Kohl; Zhong Lin Wang
errShare
errSave
STM observation of CDW on cleaved (-201) surface of Rb0.3MoO3
err2005-12-01
err0
PREAI
errC. Brun; J. C. Girard; Z. Z. Wang; J. Dumas; J. Marcus; C. Schlenker
errShare
errSave
The internal structure of oceanic plateaus: inferences from obducted Cretaceous terranes in western Colombia and the Caribbean
err1998-07-01
err0
PREAI
errAndrew C Kerr; John Tarney; Alvaro Nivia; Giselle F Marriner; Andrew D Saunders
errShare
errSave
Quantum Speedup by Quantum Annealing
err2012-07-31
err0
errOAAI
errRolando D. Somma; Daniel Nagaj; Mária Kieferová
errShare
errSave
no more