SDOF-Based Algorithm for Parallel Generation of P-I Curves

The P-I curve is a crucial tool for assessing structural blast damage and is widely applied in the fields of disaster mitigation, prevention, and weapon effects evaluation. Traditional methods for generating the P-I curve typically require multiple equivalent single-degree-of-freedom (SDOF) calculations. However, serial algorithms struggle to meet the demand for rapid P-I curve generation across multiple building components. To enhance the efficiency of $\mathbf{P}-\mathbf{I}$ curve generation, this paper presents an optimization of the P-I curve algorithm using -O3 compilation flags, followed by further optimization through OpenMP multithreading parallelization. Performance experiments of the parallel P-I curve generation algorithm were conducted on the Tianhe next-generation system, focusing on the parallel performance of the algorithm across varying data sizes. The experimental results indicate that the compilationoptimized serial P-I curve generation algorithm achieves a speedup ratio of 2.2 compared to the original algorithm, with performance improvements being independent of data size. The parallel performance of the P-I curve generation algorithm shows a positive correlation with data size, with 32-thread parallelism demonstrating the highest efficiency. For a dataset of size $10,000 \times 10,000$, the 32-thread parallel efficiency reaches $107.36 \%$ compared to single-thread performance, achieving superlinear parallel performance. These findings suggest that the optimized algorithm can effectively support the parallel generation of P-I curves for building components in real-world applications.

Authors

Institutions

Publication Details

Published
2025-05-23
DOI
https://doi.org/10.1109/eeiss65394.2025.11085748
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SDOF-Based Algorithm for Parallel Generation of P-I Curves

Li‐Dan Kuang, Sheau-Fang Lei, Jie Liu
1 links
Distributed and Parallel Computing Systems
article

SDOF-Based Algorithm for Parallel Generation of P-I Curves

Li‐Dan Kuang, Sheau-Fang Lei, Jie Liu
article en

Abstract

The P-I curve is a crucial tool for assessing structural blast damage and is widely applied in the fields of disaster mitigation, prevention, and weapon effects evaluation. Traditional methods for generating the P-I curve typically require multiple equivalent single-degree-of-freedom (SDOF) calculations. However, serial algorithms struggle to meet the demand for rapid P-I curve generation across multiple building components. To enhance the efficiency of $\mathbf{P}-\mathbf{I}$ curve generation, this paper presents an optimization of the P-I curve algorithm using -O3 compilation flags, followed by further optimization through OpenMP multithreading parallelization. Performance experiments of the parallel P-I curve generation algorithm were conducted on the Tianhe next-generation system, focusing on the parallel performance of the algorithm across varying data sizes. The experimental results indicate that the compilationoptimized serial P-I curve generation algorithm achieves a speedup ratio of 2.2 compared to the original algorithm, with performance improvements being independent of data size. The parallel performance of the P-I curve generation algorithm shows a positive correlation with data size, with 32-thread parallelism demonstrating the highest efficiency. For a dataset of size $10,000 \times 10,000$, the 32-thread parallel efficiency reaches $107.36 \%$ compared to single-thread performance, achieving superlinear parallel performance. These findings suggest that the optimized algorithm can effectively support the parallel generation of P-I curves for building components in real-world applications.

Hunan University (CN), Education Department of Hunan Province (CN), Changsha University of Science and Technology (CN)
Openalex Percentile: Top 80%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.