d4.05.01 sd_partition data structure

Summary:

This data structure is linked to the parallelism of elementary calculations and assemblies. It is attached to a model and allows you to know which processor should calculate (and assemble) which finite element.

Remarks:

• For a sequential version of the code, this data structure does not exist.

• If PARALLELISME =” CENTRALISE “, this data structure does not exist.

• The « late » finite elements (those for dualized loads or contact loads for the « CONTINUE » method) are all processed by the processor 0 except if PARALLELISME =” GROUP_ELEM “ .

Table of Contents

• 1. Arborescence
• 2. Item Content JEVEUX
  • 2.1. “. PRTI “: S V I long = 1
  • 2.2. “. PRTK “: S V K24 long = 2
  • 2.3. “. NUPROC. MAILLE “: S V I