Personal tools

Difference between revisions of "Consolidate Domain Decomposition"

From MohidWiki

Jump to: navigation, search
(Topology)
Line 11: Line 11:
 
*any number of workers.
 
*any number of workers.
  
The Parser identifies result files to be consolidated. It keeps 2 lists:
+
The Parser identifies result files to be consolidated. It keeps a list of jobs to be done.
*a list of jobs to be done; and
+
At the end, when all files are merged, a "poison pill" message will be broadcast notifying workers they must terminate.
*a list of workers.
 
The list of workers will be used in the end, when there are no more pending jobs. A message will be send to every worker notifying them that they should terminate.
 
 
The list of jobs works like this:
 
The list of jobs works like this:
 
#a Worker is idle it sends a request to the Parser;
 
#a Worker is idle it sends a request to the Parser;

Revision as of 12:37, 3 February 2015

The program Consolidate Domain Decomposition uses the actor model to parallelize file processing tasks. For instance, suppose there are hydrodynamic and water quality files from 2 sub-domains:

  • hyd_submod_1.hdf and wq_submod_1.hdf; and
  • hyd_submod_2.hdf and wq_submod_2.hdf.

The desired consolidated files are hyd.hdf and wq.hdf, resulting form the concatenation of:

  • hyd_submod_1.hdf and hyd_submod_2.hdf to produce hyd.hdf; and
  • wq_submod_1.hdf and wq_submod_2.hdf for the wq.hdf

Topology

Diagram of the architecture for the consolidation of domain decomposition HDF result files.
There are 2 kinds of MPI processes running:
  • a Parser; and
  • any number of workers.

The Parser identifies result files to be consolidated. It keeps a list of jobs to be done. At the end, when all files are merged, a "poison pill" message will be broadcast notifying workers they must terminate. The list of jobs works like this:

  1. a Worker is idle it sends a request to the Parser;
  2. the Parser sends the first unfinished job to the worker and moves it from the first to the last position of the list;
  3. when a Worker terminates a job sends a processed message to the Parser;
  4. the Parser removes the completed job from the list.

This strategy for the jobs list ensures fault tolerance. Suppose a job is sent to a Worker that, for some reason, does not complete it. That job will eventually be send to another Worker. It may occur that a job is executed twice but the program is idempotent so no harm occurs...