Difference between revisions of "Partition"
From PHASTA Wiki
(→Chef) |
|||
| Line 1: | Line 1: | ||
== Chef== | == Chef== | ||
| + | Chef an open source SCOREC code that is this group's primary tool to partition a problem domain to many subdomains. This is done to allow any array of compute nodes to each focus on solving the problem in parallel. That is, to divide the problem domain into subdomains to give to different computational workers. When we perform this step, all that is needed for inputs are the, 1) SCOREC mesh constructed from the output of the conversion and meshing steps, and 2) the number of parts (subdomains) to divide the problem up into. A generic workflow for this step is described below: | ||
=== Basic Directory Structure=== | === Basic Directory Structure=== | ||
| + | |||
=== Partioning from serial via Viz nodes=== | === Partioning from serial via Viz nodes=== | ||
=== Partioning to N processes via Viz nodes=== | === Partioning to N processes via Viz nodes=== | ||
=== Further Partitioning=== | === Further Partitioning=== | ||
Revision as of 16:07, 14 September 2020
Contents
Chef
Chef an open source SCOREC code that is this group's primary tool to partition a problem domain to many subdomains. This is done to allow any array of compute nodes to each focus on solving the problem in parallel. That is, to divide the problem domain into subdomains to give to different computational workers. When we perform this step, all that is needed for inputs are the, 1) SCOREC mesh constructed from the output of the conversion and meshing steps, and 2) the number of parts (subdomains) to divide the problem up into. A generic workflow for this step is described below:
