Parallel Simulation of Scramjet with Multilevel Hypergraph Partitioning

2013 ◽  
Vol 706-708 ◽  
pp. 1479-1482
Author(s):  
Yao Yuan Zeng ◽  
Wen Tao Zhao ◽  
Zheng Hua Wang
Keyword(s):  
Domain Decomposition Method ◽  
Computation Time ◽  
Parallel Simulation ◽  
Supersonic Combustion ◽  
Flight Vehicle ◽  
Hypergraph Partitioning ◽  
Memory Overhead ◽  
Communication Time ◽  
Partitioning Algorithm ◽  
Supersonic Combustion Ramjet

As one of the most considerable methods to study hypersonic flight vehicle, the numerical simulation of supersonic combustion ramjet (scramjet) has drawn an ever increasing attention at present. Nevertheless, the traditional serial simulation is ungratified for current research requirements because of high calculation precision, avaricious memory overhead and overlong computation time. Meanwhile, the efficiency of parallel simulation using the domain decomposition method is not very satisfactory. In this paper, we study on a general algorithm for scramjet design, and subdivide the computing domain by using a multilevel hypergraph partitioning algorithm. In order to reduce computation while enhancing the degree of parallelism, overlapping communication with computation and non blocking communication is adopted to decrease the communication time when dealing with global communication. Finally, experimental results testing on a China-made supercomputer show the smallest value of parallel efficiency is more than 48% when the number of processors is 256. In conclusion, the result indicates that our parallel algorithm is simple, effective and practical in scramjet simulation.

Hybrid MPI + OpenMP Parallelization of Scramjet Simulation with Hypergraph Partitioning

2013 ◽  
Vol 712-715 ◽  
pp. 1294-1297
Author(s):  
Yao Yuan Zeng ◽  
Wen Tao Zhao ◽  
Zheng Hua Wang
Keyword(s):  
Computation Time ◽  
Single Step ◽  
Supersonic Combustion ◽  
Program Testing ◽  
Hypergraph Partitioning ◽  
Memory Overhead ◽  
Parallel Performance ◽  
Hybrid Program ◽  
Supersonic Combustion Ramjet ◽  
Parallel Strategy

As one of the most significant methods to study hypersonic flight vehicle, the numerical simulation of supersonic combustion ramjet has drawn an ever increasing attention at present. Nevertheless, the traditional serial simulation cannot satisfy the practical needs because of high calculation precision, avaricious memory overhead and overlong computation time. In this paper, we study on a general algorithm for scramjet simulation, and bring about parallelization by using a hypergraph partitioning algorithm and a two level hybrid parallel model. The whole computing domain is decomposed into several sub-domains based on hypergraph partitioning, and each sub-domain is assigned to a MPI process. A single step of computation operates in the inter loop level, where a compiler directive is used to split MPI process into several OpenMP threads. Finally, speedup and parallel efficiency of our hybrid program testing on a China-made supercomputer with 4 to 256 cores is compared with pure MPI program. And, the hybrid program exhibits better parallel performance than the pure MPI program in the main, roughly as expected. The result indicates that our hybrid parallel strategy is effective and practical in scramjet simulation.

Parallel Computing of Laser Propulsion with Hypergraph Partitioning

2013 ◽  
Vol 760-762 ◽  
pp. 311-314
Author(s):  
Yao Yuan Zeng ◽  
Wen Tao Zhao ◽  
Zheng Hua Wang
Keyword(s):  
Numerical Simulation ◽  
Computation Time ◽  
Parallel Method ◽  
Hypergraph Partitioning ◽  
Laser Propulsion ◽  
Memory Overhead ◽  
Parallel Performance ◽  
Communication Time ◽  
Partitioning Algorithm ◽  
Speedup Ratio

As one of the most important methods to study laser propelled rocket, the numerical simulation of laser propulsion has drawn an ever increasing attention at present. Nevertheless, the traditional serial computing cannot satisfy the practical requirements because of high calculation precision, insatiable memory overhead and considerable computation time. In this paper, we study on a general algorithm for laser propulsion, and divide the computing domain by using a multilevel hypergraph partitioning algorithm. Furthermore, MPI allreduce, overlapping communication with computation and non blocking communication are adopted to decrease the communication time when dealing with global communication. Finally, parallel performance about two typical configurations on a China-made supercomputer shows the smallest value of speedup ratio is more than 123 when the number of processors is 256. In conclusion, our parallel method is effective and practical in numerical simulation of laser propulsion.

HEPart: A balanced hypergraph partitioning algorithm for big data applications

2018 ◽  
Vol 83 ◽  
pp. 250-268 ◽  
Author(s):  
Wenyin Yang ◽  
Guojun Wang ◽  
Kim-Kwang Raymond Choo ◽  
Shuhong Chen
Keyword(s):  
Big Data ◽  
Hypergraph Partitioning ◽  
Big Data Applications ◽  
Partitioning Algorithm

Investigation of the Formation of Microbubbly Liquid Fuel

2009 ◽  
Author(s):  
Emine Celik ◽  
Joseph Katz ◽  
David M. Van Wie
Keyword(s):  
Liquid Fuel ◽  
Gas Bubbles ◽  
Supersonic Combustion ◽  
Short Chain ◽  
Experimental Facility ◽  
Second Stage ◽  
Thermal Pyrolysis ◽  
New Type ◽  
Supersonic Combustion Ramjet ◽  
Long Chain

There are several obstacles encountered during combustion in Supersonic Combustion Ramjet (SCRAMJET) engines such as mixing, ignition, and flame holding. In order to overcome these difficulties, a new type of fuel is generated with the use of combination of two methods namely an effervescent (barbotage) and thermal pyrolysis of the fuel. In the first step of the process, during effervescent method, small gas bubbles are introduced into liquid fuel to improve the spraying characteristics of the fuel. At the second stage, long-chain hydrocarbons are broken down into short-chain hydrocarbons that burn faster. An experimental facility has been designed and developed to study the underlying physics in each process.

Effects of Chemical Reaction Models on Simulations of Scramjet Nozzle Flow

2014 ◽  
Vol 490-491 ◽  
pp. 931-935
Author(s):  
Xiao Yuan Zhang ◽  
Li Zi Qin ◽  
Yu Liu
Keyword(s):  
Kinetic Models ◽  
Chemical Kinetic ◽  
Numerical Results ◽  
Supersonic Combustion ◽  
Equilibrium Flow ◽  
Reaction Models ◽  
Total Temperature ◽  
Supersonic Combustion Ramjet ◽  
Quantity Of Heat ◽  
Non Equilibrium

The chemical non-equilibrium flow of supersonic combustion ramjet (scramjet) nozzle is numerical simulated with different chemical kinetic models to research the effects on numerical results of the nozzle performance. The numerical results show that total temperature is increased due to the recombination of dissociation compositions and the combustion of the residual fuel. The effect of the combustion of the residual fuel is more obvious in this paper, and the effect to the performance of the nozzle is noticeable. The species of the compositions in the models influence the quantity of heat sending out when it get equilibrium, so the 9-species chemical kinetic models are more suitable in the simulation of the scramjet nozzle chemical non-equilibrium flows.

Finite Rate Chemistry Large-Eddy Simulation of Self-Ignition in Supersonic Combustion Ramjet

AIAA Journal ◽  
2010 ◽  
Vol 48 (3) ◽  
pp. 540-550 ◽  
Author(s):  
M. Berglund ◽  
E. Fedina ◽  
C. Fureby ◽  
J. Tegnér ◽  
V. Sabel'nikov
Keyword(s):  
Large Eddy Simulation ◽  
Supersonic Combustion ◽  
Finite Rate ◽  
Eddy Simulation ◽  
Large Eddy ◽  
Supersonic Combustion Ramjet

scholarly journals Concurrency Preserving Partitioning Algorithm for Parallel Logic Simulation

VLSI Design ◽  
1999 ◽  
Vol 9 (3) ◽  
pp. 253-270 ◽  
Author(s):  
Hong K. Kim ◽  
Jack Jean
Keyword(s):  
Discrete Event ◽  
Parallel Simulation ◽  
Logic Simulation ◽  
Intel Paragon ◽  
Partitioning Algorithm ◽  
Partitioning Algorithms ◽  
Parallel Discrete Event ◽  
High Degree ◽  
Parallel Logic Simulation

A partitioning algorithm for parallel discrete event gate-level logic simulations is proposed in this paper. Unlike most other partitioning algorithms, the proposed algorithm preserves computation concurrency by assigning to processors circuit gates that can be evaluated at about the same time. As a result, the improved concurrency preserving partitioning (iCPP) algorithm can provide better load balancing throughout the period of a parallel simulation. This is especially important when the algorithm is used together with a Time Warp simulation where a high degree of concurrency can lead to fewer rollbacks and better performance. The algorithm consists of three phases and three conflicting goals can be separately considered so to reduce computational complexity.To evaluate the quality of partitioning algorithms in terms of preserving concurrency, a concurrency metric that requires neither sequential nor parallel simulation is proposed. A levelization technique is used in computing the metric so to determine gates which can be evaluated at about the same time. A parallel gate-level logic simulator is implemented on an INTEL Paragon and an IBM SP2 to evaluate the performance of the iCPP algorithm. The results are compared with several other partitioning algorithms to show that the iCPP algorithm does preserve concurrency pretty well and reasonable speedup may be achieved with the algorithm.

A Multilevel Hypergraph Partitioning Algorithm Based on Simulated Annealing

2013 ◽  
Vol 753-755 ◽  
pp. 2908-2911
Author(s):  
Yao Yuan Zeng ◽  
Wen Tao Zhao ◽  
Zheng Hua Wang
Keyword(s):  
Global Optimization ◽  
Simulated Annealing ◽  
Combinatorial Optimization ◽  
Unstructured Meshes ◽  
Running Time ◽  
Hypergraph Partitioning ◽  
Benchmark Suite ◽  
Partitioning Algorithm ◽  
Better Than

Multilevel hypergraph partitioning is a significant and extensively researched problem in combinatorial optimization. In this paper, we present a multilevel hypergraph partitioning algorithm based on simulated annealing approach for global optimization. Experiments on the benchmark suite of several unstructured meshes show that, for 2-, 4-, 8-, 16-and 32-way partitioning, although more running time was demanded, the quality of partition produced by our algorithm are on the average 14% and the maximum 22% better than those produced by partitioning software hMETIS in term of the SOED metric.

Sign in / Sign up

Export Citation Format

Share Document