Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers (Q1097088): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 01:27, 31 January 2024

scientific article
Language Label Description Also known as
English
Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers
scientific article

    Statements

    Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers (English)
    0 references
    0 references
    1988
    0 references
    This paper discusses a concurrent finite element formulation for linear and nonlinear transient analysis using an explicit time integration scheme. The formulation has been developed for execution on hypercube multiprocessor computers. The formulation includes a new decomposition algorithm which automatically divides an arbitrary finite element mesh into regions and assigns each region to a processor on the hypercube. The algorithm selects the assignment of regions so as to minimize interprocessor communication and to balance the computational load across the processors. The decomposition algorithm is deterministic in nature and relies on a scheme which reduces the bandwidth of the matrix representation of the connectivities in the mesh. The algorithms have been implemeted on a 32 processor Intel hypercube (the iPSC/d5 machine): speedup factors of greater than 31 have been obtained. Performance limitations of the hypercube architecture for finite element analysis are discussed.
    0 references
    concurrent finite element formulation
    0 references
    linear
    0 references
    nonlinear transient analysis
    0 references
    explicit time integration scheme
    0 references
    hypercube multiprocessor computers
    0 references
    decomposition algorithm
    0 references
    minimized interprocessor communication
    0 references
    balance the computational load
    0 references

    Identifiers