Recent Trends and Developments of Crashworthiness Simulation Methodologies and Their Integration into the Industrial Vehicle Design Cycle

Haug, E.; Charlier, H.; Clinckemaillie, J.; Pasquale, E. Di; Fort, O.; Lasry, David; Milcent, G.; Ni, X.; Pickett, A.K.; Hoffmann, Rainer

doi:10.1007/978-3-642-84586-4_7

Cited by 8 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We remark that many applications satisfy these premises: crash analysis [1], particle in cell codes [6], DSMC simulations [5] and fluid-structure problems [3]. The key idea of the empty-bin data structure is to allow for extra storage of items that move in time so as to avoid the scalar rebuild of the linked list.…”

Section: The Empty Bin Conceptmentioning

confidence: 99%

See 1 more Smart Citation

The empty bin: A data structure for spatial search of time‐varying data

Löhner

2006

Commun. Numer. Meth. Engng.

View full text Add to dashboard Cite

SUMMARYAn extension of the classic bin data structure with linked list storage is proposed and tested. This 'emptybin' data structure is particularly well suited for problems where spatial search is required for items that: (a) do not change significantly in numbers; (b) have similar size; and (c) move a fraction of the bin size in every timestep. This 'empty-bin' data structure can be updated and rebalanced efficiently on shared-memory parallel machines. Several examples demonstrate the effectiveness of the proposed data structure.

show abstract

Section: The Empty Bin Conceptmentioning

confidence: 99%

“…Among the most CPU intensive, we mention contact problems in computational structural mechanics [1][2][3][4], particle-particle codes [5,6], vortex methods, overlapping [7] and embedded grids [8] in computational fluid dynamics.…”

Section: Introductionmentioning

confidence: 99%

The empty bin: A data structure for spatial search of time‐varying data

Löhner

2006

Commun. Numer. Meth. Engng.

View full text Add to dashboard Cite

show abstract

“…Many code options that are essential for realistic simulations are not easy to parallelize on this type of machine. Among these, we mention local remeshing 12 , repeated h-refinement such as required for transient problems 13 , contact detection and force evaluation 14 , some preconditioners 15 , applications where particles, flow, and chemistry American Institute of Aeronautics and Astronautics interact, and applications with rapidly varying load imbalances. Even if 99% of all operations required by these codes can be parallelized, the maximum achievable gain will be restricted to 1:100.…”

Section: Introductionmentioning

confidence: 99%

Implementation of unstructured grid GMRES+LU-SGS method on shared-memory, cache-based parallel computers

Sharov

Luo

Baum

et al. 2000

38th Aerospace Sciences Meeting and Exhibit

View full text Add to dashboard Cite

The implementation of an unstructured grid matrix-free GMRES+LU-SGS scheme on shared-memory, cache-based parallel machines is described. A special grid renumbering technique is used for the parallelization rather than the traditional method of partitioning the computational domain. The renumbering technique helps to avoid inter-processor data dependencies, cache-misses, and cache-line overwrite while allowing pipelining. The resulting source code can be used with maximum efficiency and without modifications on traditional (scalar) computers, vector supercomputers, and shared-memory parallel systems. Special attention has been paid to develop an optimally parallelized preconditioner for the GMRES scheme.

show abstract

Some useful renumbering strategies for unstructured grids

Löhner

1993

Numerical Meth Engineering

View full text Add to dashboard Cite

SUMMARYSeveral renumbering strategies for unstructured grids are discussed. They lead to a minimization of cache-misses and an optimal grouping of elements for different computer platforms, from superscalar workstations to multiprocessor register-to-register vector machines. Timings for a typical computational fluid dynamics (CFD) code that employs these renumbering strategies indicate that CPU requirements may he halved by applying them. The renumbering strategies discussed are all of linear time complexity, making them ideally suited for applications requiring frequent mesh changes. Furthermore, these renumbering strategies are not only valid for element-based codes but carry over to edge-based or face-based field solvers.

show abstract

Recent Trends and Developments of Crashworthiness Simulation Methodologies and Their Integration into the Industrial Vehicle Design Cycle

Cited by 8 publications

References 2 publications

The empty bin: A data structure for spatial search of time‐varying data

The empty bin: A data structure for spatial search of time‐varying data

Implementation of unstructured grid GMRES+LU-SGS method on shared-memory, cache-based parallel computers

Some useful renumbering strategies for unstructured grids

Contact Info

Product

Resources

About