META-Farm: Difference between revisions

From Alliance Doc
Jump to navigation Jump to search
mNo edit summary
mNo edit summary
 
(160 intermediate revisions by 7 users not shown)
Line 1: Line 1:
{{Draft}}
<languages />
=Overview=
<translate>
META package is a suite of scripts designed in-house to fully automate throughput computing (running a large number of related serial/parallel/GPU jobs - so called "farming"). They will work on all National systems, and other clusters which use the same setup (most importantly, SLURM scheduler). The same set of scripts can be used with little or no modifications to organize almost any type of farming workflow, including


* either "one case per job" mode or "many cases per job" mode, with dynamic workload balancing for the latter (here '''a "case" is one independent computation''', could be serial or parallel or GPU-based);
=Overview= <!--T:133-->
* capturing the exit status of all individual cases;
* the ability to automatically resubmit all the cases which failed or never ran;
* the ability to submit and independently operate multiple serial farms (groups of cases) on the same cluster.


The key points about the package:  
<!--T:134-->
* All "cases" to be computed have to be described as separate lines (one line per case) in the file '''table.dat''' in the farm-specific directory. (One can run multiple farms independently; each farm has to have its own directory.)
META (short for META-Farm) is a suite of scripts designed in SHARCNET to automate high-throughput computing, that is, running a large number of related calculations. This practice is sometimes called <i>farming</i>, <i>serial farming</i>, or <i>task farming</i>. META works on all Alliance national systems, and could also be used on other clusters which use the same setup (most importantly, which use the [https://slurm.schedmd.com/documentation.html Slurm scheduler]).
* In the "many cases per job" mode, the number of actual jobs (so-called "meta-jobs") submitted by the package is usually much smaller than the number of cases to process. Each meta-job can process multiple lines from table.dat (multiple cases), in a random order. Running meta-jobs read lines from table.dat, starting from the first one, in a serialized manner (using the lockfile mechanism to prevent a race condition). This ensures a good dynamic workload balance between meta-jobs, as meta-jobs which happen to handle shorter cases would process more of them.
* Not all meta-jobs need to ever run in the "many cases per job" mode. The first meta-job to run will start processing lines from table.dat; if/when the second job starts, it joins the first one, and so on. If runtime of individual meta-jobs is long enough, it is possible to process all the cases with just a single running meta-job.


This webinar discusses the META package:  https://www.youtube.com/watch?v=49dC4bmBCic
<!--T:135-->
In this article, we use the term <b>case</b> for one independent computation, which may involve the execution of a serial program, a parallel program, or a GPU-using program.<br>
The term <b>job</b> is an invocation of the Slurm job scheduler, which may handle several cases.


=Quick start guide=
<!--T:136-->
If you are impatient to start using the package, just follow the steps listed below. But it is highly recommended to also read the other details on this page.
META has the following features:


* Login to the cluster.
<!--T:137-->
* Use "git" to clone our META repository:
* two modes of operation:
$ git clone https://git.sharcnet.ca/syam/META.git
** SIMPLE mode, which handles one case per job,
* Create directory ~/bin if you don't have one:
** META mode, which handles many cases per job,
$ mkdir ~/bin
* dynamic workload balancing in META mode,
* Copy all the files inside META/bin subdirectory to ~/bin:
* captures the exit status of all individual cases,
$ cp -p META/bin/* ~/bin
* automatically resubmits all the cases which failed or never ran,
* Add ~/bin to your $PATH variable (you can add the line below at the end of your ~/.bashrc file):
* submits and independently operates multiple <i>farms</i> (groups of cases) on the same cluster,
  $ export PATH=/home/$USER/bin:$PATH
* can automatically run a post-processing job once all the cases have been processed successfully.
* Copy your code and initial conditions files to the META directory (optional; you can use full paths instead).
 
* Create table.dat inside the META directory (text file, one case per line; see [[#single_case.sh script]], [[#FORTRAN code example: using standard input]], [[#FORTRAN code example: copying files for each case]], [[#Using all the columns in the cases table explicitly]] for some examples). Each line of this file describes how to run one case (one independent computation).
<!--T:138-->
* Modify “single_case.sh” accordingly (so it will parse all the information the code needs from a specific line in the cases table). In many cases you don't have to do that. See [[#single_case.sh script]], [[#Handling code exit status]], [[#FORTRAN code example: copying files for each case]], [[#Using all the columns in the cases table explicitly]] for more information.
Some technical requirements:
* Modify "job_script.sh" file to suit your needs ([[#job_script.sh script]]). In particular, use a correct account name, and set an appropriate job runtime. (See [[#Estimating the runtime and number of meta-jobs]].)
* For each farm, each case to be computed must be described as a separate line in a table.dat file.
* Inside META directory, execute
* You can run multiple farms independently, but each farm must have its own directory.
 
<!--T:139-->
In META mode, the number of actual jobs (called <i>metajobs</i>) submitted by the package is usually much smaller than the number of cases to process. Each metajob can process multiple lines (multiple cases) from table.dat. A collection of metajobs will read lines from table.dat, starting from the first line, in a serialized manner using the [https://linux.die.net/man/1/lockfile lockfile] mechanism to prevent a race condition. This ensures a good dynamic workload balance between metajobs, as metajobs which handle shorter cases will process more of them.
 
<!--T:140-->
Not all metajobs need to run in META mode. The first metajob to run will start processing lines from table.dat; if and when the second job starts, it joins the first one, and so on. If the runtime of an individual metajob is long enough, all the cases might be processed with just a single metajob.
 
== META vs. GLOST == <!--T:141-->
 
<!--T:142-->
The META package has important advantages over other approaches like [[GLOST]] where farm processing is done by bundling up all the jobs into a large parallel (MPI) job:
* As the scheduler has full flexibility to start individual metajobs when it wants, the queue wait time can be dramatically shorter with the META package than with GLOST. Consider a large farm where 1000 CPU cores need to be used for 3 days;
** with GLOST, with a 1000-way MPI job, queue wait time can be weeks, so it'll be weeks before you see your very first result;
** with META, some metajobs start to run and produce the first results within minutes.
* At the end of the farm computations;
** with GLOST, some MPI ranks will finish earlier and will sit idle until the very last—the slowest—MPI rank ends;
** with META, there is no such waste at the end of the farm: individual metajobs exit earlier if they have no more workload to process.
* GLOST and other similar packages do not support automated resubmission of the cases which failed or never ran. META has this feature, and it is very easy to use.
 
== The META webinar == <!--T:143-->
 
<!--T:144-->
A webinar was recorded on October 6th, 2021 describing the META package.  You can view it [https://youtu.be/GcYbaPClwGE here].
 
=Quick start= <!--T:145-->
 
<!--T:146-->
If you are impatient to start using META, just follow the steps listed below. However, it is highly recommended to also read the rest of the page.
 
<!--T:147-->
* Log into a cluster.
* Load the <code>meta-farm</code> module.
  $ module load meta-farm
* Choose a name for a farm directory, e.g. <code>Farm_name</code>, and create it with the following command
$ farm_init.run  Farm_name
* This will also create a few important files inside the farm directory, some of which you will need to customize.
* Copy your executable and input files to the farm directory. (You may skip this step if you plan to use full paths everywhere.)
* Edit the <code>table.dat</code> file inside the farm directory.  This is a text file describing one case (one independent computation) per line.  For examples, see one or more of
** [[#single_case.sh|single_case.sh]]
** [[META:_Advanced_features_and_troubleshooting#Example:_Numbered_input_files|Example: Numbered input files]] (advanced)
** [[META:_Advanced_features_and_troubleshooting#Example:_Input_file_must_have_the_same_name|Example: Input file must have the same name]] (advanced)
** [[META:_Advanced_features_and_troubleshooting#Using_all_the_columns_in_the_cases_table_explicitly|Using all the columns in the cases table explicitly]] (advanced)
* Modify the <code>single_case.sh</code> script if needed. In many cases you don't have to make any changes. For more information see one or more of
** [[#single_case.sh|single_case.sh]]
** [[#STATUS_and_handling_errors|STATUS and handling errors]]
** [[META:_Advanced_features_and_troubleshooting#Example:_Input_file_must_have_the_same_name|Example: Input file must have the same name]] (advanced)
** [[META:_Advanced_features_and_troubleshooting#Using_all_the_columns_in_the_cases_table_explicitly|Using all the columns in the cases table explicitly]] (advanced)
* Modify the <code>job_script.sh</code> file to suit your needs as described at [[#job_script.sh|job_script.sh]] below. In particular, use a correct account name, and set an appropriate job runtime. For more about runtimes, see [[#Estimating_the_runtime_and_number_of_metajobs|Estimating the runtime and number of metajobs]].
* Inside the farm directory, execute
  $ submit.run -1
  $ submit.run -1
for the one case per job mode, or
for the one case per job (SIMPLE) mode, or
  $ submit.run N
  $ submit.run N
for the many cases per job mode (N is the number of meta-jobs to use; it should be significantly smaller than the total number of cases = number of lines in table.dat file).
for the many cases per job (META) mode, where <i>N</i> is the number of metajobs to use. <i>N</i> should be significantly smaller than the total number of cases.
* To run another farm concurrently with the first one, create another directory - say, META1 - and copy there and customize the files single_case.sh and job_script.sh, and create a new table.dat file there. Also copy the code executable and all the input files as needed. Now you can execute "submit.run N" inside META1 to submit the second farm.
 
* To use any of the provided *.run utilities, one has first to cd to the corresponding farm subdirectory.
<!--T:148-->
To run another farm concurrently with the first one, run <code>farm_init.run</code> again (providing a different farm name) and customize files <code>single_case.sh</code> and <code>job_script.sh</code> inside the new farm directory, then create a new table.dat file there. Also copy the executable and all the input files as needed. Now you can execute the <code>submit.run</code> command inside the second farm directory to submit the second farm.
 
=List of commands= <!--T:149-->
* <b>farm_init.run</b>: Initialize a farm. See [[#Quick start|Quick start]] above.
* <b>submit.run</b>: Submit the farm to the scheduler. See [[#submit.run|submit.run]] below.
* <b>resubmit.run</b>: Resubmit all computations which failed or never ran as a new farm. See [[#Resubmitting_failed_cases|Resubmitting failed cases]].
* <b>list.run</b>: List all the jobs with their current state for the farm.
* <b>query.run</b>: Provide a short summary of the state of the farm, showing the number of queued, running, and completed jobs. More convenient than using <code>list.run</code> when the number of jobs is large. It will also print the progress—that is, the number of processed cases vs. the total number of cases—both for the current run, and globally.
* <b>kill.run</b>: Kill all the running and queued jobs in the farm.
* <b>prune.run</b>: Remove only queued jobs.
* <b>Status.run</b>: (capital "S") List statuses of all processed cases. With the optional <code>-f</code>, the non-zero status lines (if any) will be listed at the end.
* <b>clean.run</b>: Delete all the files in the farm directory (including subdirectories if any present), except for <code>job_script.sh, single_case.sh, final.sh, resubmit_script.sh, config.h,</code> and <code>table.dat</code>. It will also delete all files associated with this farm in the <code>/home/$USER/tmp</code> directory. Be very careful with this script!
 
<!--T:150-->
All of these commands (except for <code>farm_init.run</code> itself) have to be executed inside a farm directory, that is, a directory created by <code>farm_init.run</code>.
 
=Small number of cases (SIMPLE mode)= <!--T:151-->


=Small number of cases=
<!--T:152-->
==Overview==
Recall that a single execution of your code is a <b>case</b> and a <b>job</b> is an invocation of the Slurm scheduler. If:
Let's call a single execution of the code in a serial/parallel farm a “case”. When the total number of cases, N_cases, is fairly small (say, <500) it is convenient to dedicate a separate job to each case. (You should make sure that each case runs for at least 10 minutes. If this is not the case, you should consider the "many cases per job" mode - see below.)
* the total number of cases is fairly small--- say, less than 500, and
* each case runs for at least 20 minutes,
then it is reasonable to dedicate a separate job to each case using the SIMPLE mode.  
Otherwise you should consider using the META mode to handle many cases per job,
for which please see [[#Large number of cases (META mode)|Large number of cases (META mode)]] below.


The three essential scripts are “submit.run”, “single_case.sh”, and "job_script.sh".
<!--T:153-->
The three essential scripts are the command <code>submit.run</code>, and two user-customizable scripts <code>single_case.sh</code> and <code>job_script.sh</code>.


==submit.run script==
==submit.run== <!--T:154-->
“submit.run” has one obligatory command line argument - number of jobs to submit, which when used in the “one case per job” mode should be “-1”, e.g.
<i><b>Note:</b> This section applies to both SIMPLE and META modes.</i><br><br>
The command <code>submit.run</code> has one obligatory argument, the number of jobs to submit, <i>N</i>:


<!--T:155-->
<source lang="bash">
<source lang="bash">
   $ submit.run -1 [optional_arguments]
   $ submit.run N [-auto] [optional_sbatch_arguments]
</source>
</source>


The value of "-1" means "submit as many jobs as there are lines in table.dat".
<!--T:156-->
If <i>N</i>=-1, you are requesting the SIMPLE mode (submit as many jobs as there are lines in table.dat). If <i>N</i> is a positive integer, you are requesting the META mode (multiple cases per job), with <i>N</i> being the number of metajobs requested.  Any other value for <i>N</i> is not valid.
 
<!--T:157-->
If the optional switch <code>-auto</code> is present, the farm will resubmit itself automatically at the end, more than once if necessary, until all the cases from table.dat have been processed. This feature is described at [[META:_Advanced_features_and_troubleshooting#Resubmitting_failed_cases_automatically|Resubmitting failed cases automatically]].
 
<!--T:158-->
If a file named <code>final.sh</code> is present in the farm directory, <code>submit.run</code> will treat it as a job script for a post-processing job and it will be launched automatically once all the cases from table.dat have been successfully processed. See [[META:_Advanced_features_and_troubleshooting#Running_a_post-processing_job_automatically|Running a post-processing job automatically]] for more details.


All optional_arguments (there could more than one) will be passed to the job submitting command, sbatch. They will be used with all meta-jobs submitted for this farm.
<!--T:159-->
If you supply any other arguments, they will be passed on to the Slurm command <code>sbatch</code> used to launch all metajobs for this farm.


==single_case.sh script==
==single_case.sh== <!--T:160-->
Another principal script, “single_case.sh”, is only one of the two scripts (the other one being job_script.sh) which might need customization. Its task is to read the corresponding line from table.dat, parse it, and use these data to launch your code for this particular case. The version of the file provided literally executes one full line from the case table (meaning that the line should start with the path to your code, or with the code binary name if the binary is on your $PATH environment variable) in a separate subdirectory, RUNyyy (yyy being the case number).
<i><b>Note:</b> This section applies to both SIMPLE and META modes.</i><br><br>


“single_case.sh”:
<!--T:161-->
The function of <code>single_case.sh</code> is to read one line from <code>table.dat</code>, parse it, and use the contents of that line to launch your code for one case.
You may wish to customize <code>single_case.sh</code> for your purposes.  


<!--T:162-->
The version of <code>single_case.sh</code> provided by <code>farm_init.run</code> treats each line in <code>table.dat</code> as a literal command and executes it in its own subdirectory <code>RUNyyy</code>, where <i>yyy</i> is the case number.  Here is the relevant section of <code>single_case.sh</code>:
<!--T:232-->
<source lang="bash">
<source lang="bash">
...
...
Line 67: Line 150:
#  $ID contains the case id from the original table (can be used to provide a unique seed to the code etc)
#  $ID contains the case id from the original table (can be used to provide a unique seed to the code etc)
#  $COMM is the line corresponding to the case $ID in the original table, without the ID field
#  $COMM is the line corresponding to the case $ID in the original table, without the ID field
#  $SLURM_JOB_ID is the jobid for the current meta-job (convenient for creating per-job files)
#  $METAJOB_ID is the jobid for the current metajob (convenient for creating per-job files)


<!--T:233-->
mkdir -p RUN$ID
mkdir -p RUN$ID
cd RUN$ID
cd RUN$ID


<!--T:234-->
echo "Case $ID:"
echo "Case $ID:"


<!--T:235-->
# Executing the command (a line from table.dat)
# Executing the command (a line from table.dat)
# It's allowed to use more than one shell command (separated by semicolons) on a single line
# It's allowed to use more than one shell command (separated by semicolons) on a single line
eval "$COMM"
eval "$COMM"


<!--T:236-->
# Exit status of the code:
# Exit status of the code:
STATUS=$?
STATUS=$?


<!--T:237-->
cd ..
cd ..
# +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
# +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Line 86: Line 174:
</source>
</source>


Your table.dat can look like this:


<!--T:163-->
Consequently, if you are using the unmodified <code>single_case.sh</code> then each line of <code>table.dat</code> should contain a complete command.
This may be a compound command, that is, several commands separated by semicolons (;).
<!--T:164-->
Typically <code>table.dat</code> will contain a list of identical commands differentiated only by their arguments, but it need not be so.
Any executable statement can go into <code>table.dat</code>.
Your <code>table.dat</code> could look like this:
</translate>
   /home/user/bin/code1  1.0  10  2.1
   /home/user/bin/code1  1.0  10  2.1
   cp -f /input_dir/input1 .; /code_dir/code  
   cp -f ~/input_dir/input1 .; ~/code_dir/code  
   ./code2 < IC.2
   ./code2 < IC.2
  sleep 10m
<translate>
  ...
 
In other words, any executable statement(s) which can be written on one line can go there. Note: if you have more then one command on a single line, separated by semicolumn(s), you must use the provided format:


<source lang="bash">
<!--T:165-->
eval "$COMM"
If you intend to execute the same command for every case and don't wish to repeat it on every line of <code>table.dat</code>,
</source>
then you can edit <code>single_case.sh</code> to include the common command.
Then edit your <code>table.dat</code> to contain only the arguments and/or redirects for each case.


If there is only one command per line (which can include redirects), it is okay to use the simpler form:
<!--T:166-->
For example, here is a modification of <code>single_case.sh</code> which includes the command
(<code>/path/to/your/code</code>), takes the contents of <code>table.dat</code> as arguments to
that command, and uses the case number <code>$ID</code> as an additional argument:


<!--T:238-->
* single_case.sh
<source lang="bash">
<source lang="bash">
$COMM
...
</source>
 
No explicit binary names are used in the original version of “single_case.sh”. Instead, the explicit binary names (with the path if needed) should listed on each line of table.dat file. If you want, you can edit the single_case.sh file to use there the code path/name explicitly, in which case your table.dat file will only contain command line switch(es) for your code and/or redirects. For example:
 
* single_case.sh:
<source lang="bash">
# ++++++++++++++++++++++  This part can be customized:  ++++++++++++++++++++++++
# ++++++++++++++++++++++  This part can be customized:  ++++++++++++++++++++++++
...
# Here we use $ID (case number) as a unique seed for Monte-Carlo type serial farming:
# Here we use $ID (case number) as a unique seed for Monte-Carlo type serial farming:
/path/to/your/code -par $COMM  -seed $ID
/path/to/your/code -par $COMM  -seed $ID
STATUS=$?
# +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
...
...
# +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
</source>
</source>
* table.dat:
* table.dat
<source lang="bash">
<source lang="bash">
  12.56
  12.56
Line 124: Line 218:
</source>
</source>


Another note: “submit.run” will modify your table.dat once (will add line number at the beginning of each line, if you didn't do it yourself). The file table.dat can be used with submit.run either way (with or without the first case_ID column) - this is handled automatically.
<!--T:167-->
<b>Note 1:</b>  If your code doesn't need to read any arguments from <code>table.dat</code>, you still have to generate <code>table.dat</code>, with the number of lines equal to the number of cases you want to compute. In this case, it doesn't matter what you put inside <code>table.dat</code>—all that matters is the total number of the lines. The key line in the above example might then look like
 
<!--T:168-->
/path/to/your/code -seed $ID
 
<!--T:169-->
<b>Note 2:</b> You do not need to insert line numbers at the beginning of each line of <code>table.dat</code>.  The script <code>submit.run</code> will modify <code>table.dat</code> to add line numbers if it doesn't find them there.  


===Handling code exit status===
===STATUS and handling errors=== <!--T:170-->
What is “$STATUS” for in “single_case.sh”? It is a shell variable which should be set to “0” if your case was computed correctly, and >0 otherwise. It is very important: it is used by “resubmit.run” to figure out which cases failed, so they can be re-computed. In the provided version of “single_case.sh”, $STATUS only reflects the exit code of your program. This likely won't cover all potential problems. (Some codes do not exit with non-zero status even if something went wrong.) You can always change or augment $STATUS derivation in “single_case.sh”. E.g., if your code is supposed to create a new non-empty file (say, “out.dat”) at the very end of each case run, the existence of such a non-empty file can be used to judge if the case failed or not:


<!--T:171-->
What is <code>STATUS</code> for in <code>single_case.sh</code>? It is a variable which should be set to “0” if your case was computed correctly, and some positive value (that is, greater than 0) otherwise. It is very important: It is used by <code>resubmit.run</code> to figure out which cases failed so they can be re-computed. In the provided version of <code>single_case.sh</code>, <code>STATUS</code> is set to the exit code of your program. This may not cover all potential problems, since some programs produce an exit code of zero even if something goes wrong.  You can change how <code>STATUS</code> is set by editing <code>single_case.sh</code>. 
<!--T:172-->
For example if your code is supposed to write a file (say, <code>out.dat</code>) at the end of each case, test whether the file exists and set <code>STATUS</code> appropriately.
In the following code fragment, <code>$STATUS</code> will be positive if either the exit code from the program is positive, or if <code>out.dat</code> doesn't exist or is empty:
</translate>
<source lang="bash">
<source lang="bash">
   STATUS=$?
   STATUS=$?
Line 136: Line 244:
     fi
     fi
</source>
</source>
<translate>


In the above example, $STATUS will be positive if either code exit status is positive, or "out.dat" file doesn't exist or is empty.
==job_script.sh== <!--T:173-->


==job_script.sh script==
<!--T:174-->
The file job_script.sh is the SLURM job script which will be used by all meta-jobs in your serial farm. It can look like this:
<i><b>Note:</b> This section applies to both SIMPLE and META modes.</i><br><br>
The file <code>job_script.sh</code> is the job script which will be submitted to SLURM for all metajobs in your farm.
Here is the default version created for you by <code>farm_init.run</code>:


<!--T:230-->
<source lang="bash">
<source lang="bash">
#!/bin/bash
#!/bin/bash
Line 150: Line 262:
#SBATCH -A Your_account_name
#SBATCH -A Your_account_name


<!--T:231-->
# Don't change this line:
# Don't change this line:
task.run
task.run
</source>
</source>


At the very least you'd have to change the account name (the "-A" switch), and the meta-job runtime ("-t" switch). In the "one case per job" mode, you should request the job's runtime to be somewhat larger than the longest expected individual case run.
<!--T:175-->
At the very least you should change the account name (the <code>-A</code> switch), and the metajob runtime (the <code>-t</code> switch).  
In SIMPLE mode, you should set the runtime to be somewhat longer than the longest expected individual case.


'''Important:''' your job_script.sh file must include the runtime switch (either -t or --time). This cannot be passed to sbatch as an optional argument to submit.run.
<!--T:176-->
'''Important:''' Your <code>job_script.sh</code> ''must'' include the runtime switch (either <code>-t</code> or <code>--time</code>).  
This cannot be passed to <code>sbatch</code> as an optional argument to <code>submit.run</code>.


Sometimes the following problem happens: one of the meta-jobs is allocated on a node which has an issue causing your code to fail instantly (e.g., no GPU is available, and your code needs a GPU; or project file space is not mounted). This is definitely not normal, and issues like this need to be reported to Compute Canada. But if it does happen, then your single bad meta-job can churn quickly through table.dat, so your whole farm fails. As a precaution, one can add a testing routine in job_scrip.sh, before the "task.run" line. For example, the following code will test for the presence of a GPU, and forces the meta-job to exit if none are present - before it started failing your serial farm cases:
<!--T:177-->
Sometimes the following problem happens: A metajob may be allocated to a node which has a defect, thereby causing your program to fail instantly. For example, perhaps your program needs a GPU but the GPU you're assigned is malfunctioning, or perhaps the <code>/project</code> file system is not mounted. (Please report such a defective node to support@tech.alliancecan.ca if you detect one!)  But when it happens, that single bad metajob can quickly churn through <code>table.dat</code>, so your whole farm fails. If you can anticipate such problems, you can add tests to <code>job_script.sh</code> before the <code>task.run</code> line. For example, the following modification will test for the presence of an NVidia GPU, and if none is found it will force the metajob to exit before it starts failing your cases:
</translate>


<source lang="bash">
<source lang="bash">
gpu_test
nvidia-smi >/dev/null
retVal=$?
retVal=$?
if [ $retVal -ne 0 ]; then
if [ $retVal -ne 0 ]; then
     exit 1
     exit 1
fi
fi
task.run
task.run
</source>
</source>
<translate>


You can copy the utility "gpu_test" to your ~/bin directory (only on graham, cedar, and beluga):
<!--T:178-->
There is a utility <code>gpu_test</code> which does a similar job to <code>nvidia_smi</code> in the above example.
On Graham, Cedar, or Beluga you can copy it to your <code>~/bin</code> directory:


  cp ~syam/bin/gpu_test ~/bin
  <!--T:179-->
cp ~syam/bin/gpu_test ~/bin


==Output files==
<!--T:180-->
Once one or more meta-jobs in your farm are running, the following files will be created in the farm directory:
The META package has a built-in mechanism which tries to detect problems of this kind and kill a metajob which churns through the cases too quickly. The two relevant parameters, <code>N_failed_max</code> and <code>dt_failed</code> are set in the file <code>config.h</code>. The protection mechanism is triggered when the first <code>$N_failed_max</code> cases are very short - less than <code>$dt_failed</code> seconds in duration. The default values are 5 and 5, so by default a metajob will stop if the first 5 cases all finish in less than 5 seconds. If you get false triggering of this protective mechanism because some of your normal cases have runtime shorter than <code>$dt_failed</code>, reduce the value of <code>dt_failed</code> in <code>config.h</code>.
* slurm-jobid.out files (one file per meta-job): standard output from jobs;
* status.jobid files (one file per meta-job): files containing the status of processed cases.


In both cases, jobid stands for the jobid of the corresponding meta-job.
==Output files== <!--T:181-->
<i><b>Note:</b> This section applies to both SIMPLE and META modes.</i><br><br>


Also, every "submit.run" script execution will create a unique subdirectory inside "/home/$USER/tmp". Inside that subdirectory, some small scratch files (like files used by "lockfile" command, to serialize certain operations inside the jobs) will be created. These subdirectories have names "NODE.PID", where "NODE" is the name of the current node (typically a login node), and "PID" is the unique process ID for the script. Once the farm execution is done, one can safely erase this subdirectory.
<!--T:182-->
Once one or more metajobs in your farm are running, the following files will be created in the farm directory:
* <code>OUTPUT/slurm-$JOBID.out</code>, one file per metajob containing its standard output,
* <code>STATUSES/status.$JOBID</code>, one file per metajob containing the status of each case that was processed.


Users normally don't need to access these files directly.
<!--T:183-->
In both cases, <code>$JOBID</code> stands for the jobid of the corresponding metajob.


==Auxiliary scripts==
<!--T:184-->
Other auxiliary scripts are also provided for your convenience.
One more directory, <code>MISC</code>, will also be created inside the root farm directory. It contains some auxiliary data.


* '''list.run''' will list all the jobs with their current state for the serial farm (no arguments).
<!--T:185-->
Also, every time <code>submit.run</code> is run, it will create a unique subdirectory inside <code>/home/$USER/tmp</code>.
Inside that subdirectory, some small scratch files will be created, such as files used by <code>lockfile</code> to serialize certain operations inside the jobs.
These subdirectories have names <code>$NODE.$PID</code>, where <code>$NODE</code> is the name of the current node (typically a login node), and <code>$PID</code> is the unique process ID for the script.
Once the farm execution is done, you can safely erase this subdirectory.
This will happen automatically if you run <code>clean.run</code>, but be careful! <code>clean.run</code> also <b>deletes all the results</b> produced by your farm!


* '''query.run''' will provide a one line summary (number of queued / running / done jobs) in the farm, which is more convenient than using “list.run” when the number of jobs is large. It will also “prune” queued jobs if warranted (see below).
==Resubmitting failed cases== <!--T:186-->


* '''kill.run''': will kill all the running/queued jobs in the farm.
<!--T:187-->
<i><b>Note:</b> This section applies to both SIMPLE and META modes.</i><br><br>
The <code>resubmit.run</code> command takes the same arguments as <code>submit.run</code>:


* '''prune.run''': will only kill (remove) queued jobs.
</translate>
<source lang="bash">
  $  resubmit.run N [-auto] [optional_sbatch_arguments]
</source>
<translate>


* '''Status.run''' (capital “S”!) will list statuses of all processed cases. With the optional "-f" switch, the non-zero status lines (if any) will be listed at the end.
<!--T:188-->
<code>resubmit.run</code>:
* analyzes all those <code>status.*</code> files (see [[#Output files|Output files]] above);
* figures out which cases failed and which never ran for whatever reason (e.g. because of the metajobs' runtime limit);
* creates or overwrites a secondary <code>table.dat_</code> file which lists only the cases that still need to be run;
* launches a new farm for those cases.


* '''clean.run''': will delete all the files in the current directory (including subdirectories if any present), except for *.run scripts, job_script.sh, table.dat, and bin subdirectory. Be very careful with this script! Note: the script will not restore *.run scripts to their default state.
<!--T:189-->
You cannot run <code>resubmit.run</code> until all the jobs from the original run are done or killed.  


All of these commands (and also the (re)submit.run commands) have to be executed inside the subdirectory corresponding to this particular farm. If you run more than one farm, each of them has to have its own subdirectory, with its own versions of single_case.sh and job_script.sh files.
<!--T:190-->
If some cases still fail or do not run, you can resubmit the farm as many times as needed. Of course, if certain cases fail repeatedly, there must a be a problem with either the program you are running or its input. In this case you may wish to use the command <code>Status.run</code> (capital S!) which displays the statuses for all computed cases. With the optional argument <code>-f</code>, <code>Status.run</code> will sort the output according to the exit status, showing cases with non-zero status at the bottom to make them easier to spot.


==Resubmitting failed/never-run jobs==
<!--T:191-->
Finally, script “resubmit.run” is run the same way as “submit.run”, e.g.:
Similarly to <code>submit.run</code>, if the optional switch <code>-auto</code> is present, the farm will resubmit itself automatically at the end, more than once if necessary. This advanced feature is described at [[META:_Advanced_features_and_troubleshooting#Resubmitting_failed_cases_automatically|Resubmitting failed cases automatically]].


<source lang="bash">
=Large number of cases (META mode)= <!--T:192-->
  $  resubmit.run -1 [optional_arguments]
The SIMPLE (one case per job) mode works fine when the number of cases is fairly small (<500).  
</source>
When the number of cases is much greater than 500, the following problems may arise:


“resubmit.run”:  
<!--T:193-->
* will analyze all those status.* files ([[#Output files]]);
* Each cluster has a limit on how many jobs a user can have at one time. (e.g. for Graham, it is 1000.)  
* figure out which cases failed and which never ran for whatever reason (e.g. because of the meta-jobs' runtime limit);
* With a very large number of cases, each case computation is typically short. If one case runs for <20 min, CPU cycles may be wasted due to scheduling overheads.
* create a new case table (adding “_” at the end of the original table name), which lists only the cases which still need to be run;
* uses “submit.run” internally to launch a new farm, for the unfinished/failed jobs.


Notes: You won't be able to run “resubmit.run” until all the jobs from the original run are done or killed. If some cases still fail or do not run, one can resubmit the farm as many times as needed, with the same arguments as before.
<!--T:194-->
META mode is the solution to these problems.
Instead of submitting a separate job for each case, a smaller number of <i>metajobs</i> are submitted, each of which processes multiple cases.
To enable META mode the first argument to <code>submit.run</code> should be the desired number of metajobs,
which should be a fairly small number—much smaller than the number of cases to process. e.g.:


Of course, if certain cases persistently fail, then there must a be a problem with either your initial conditions parameters or with your code (a code bug). It is convenient to use here the script "Status.run" (capital S!) to see a sorted list of statuses for all computed cases. With the optional argument "-f", the Status.run command will sort the output according to the exit status, showing non-zero status lines (if any) at the bottom, to make them easier to spot.
</translate>
 
<source lang="bash">
=Large number of cases=
  $  submit.run 32
==Overview==
</source>
The “one case per job” works fine when the number of cases is fairly small (<500). When N_cases >> 500, the following problems arise:
<translate>
 
* Each cluster has a limit on how many jobs a user can submit (for Graham, it is 1000).
* Job submission becomes very slow. (With 1000 jobs and ~4s per job submission, the submission will last one hour).
* With very large number of cases, each case run is typically short. If one case runs for <20 min, you start wasting cpu cycles due to scheduling overheads.
 
The solution: instead of submitting a separate job for each case, one should submit a smaller number of "meta-jobs", each of which would process multiple cases. As cases can take different time to process, it is highly desirable to utilize a dynamic workload balancing scheme here.


This is how it is implemented:
<!--T:195-->
Since each case may take a different amount of time to process, META mode uses a dynamic workload-balancing scheme.
This is how META mode is implemented:


<!--T:196-->
[[File:meta1.png|500px]]
[[File:meta1.png|500px]]


As the above diagram shows, "submit.run" script in the "many cases per job" mode will submit N jobs, with N being a fairly small number (much smaller than the number of cases to process). Each job would execute the same script - "task.run". Inside that script, there is a "while" loop, for different cases. Each iteration of the loop has to go through a serialized (only one job at a time can do that) portion of the code, where it figures out which next case (if any) to process. Then the already familiar script "single_case.sh" (see section [[#single_case.sh script]]) is executed - once per each case, which in turn calls the user code.
<!--T:197-->
As the above diagram shows, each job executes the same script, <code>task.run</code>. Inside that script, there is a <code>while</code> loop for the cases. Each iteration of the loop has to go through a serialized portion of the code (that is, only one <i>job</i> at a time can be in that section of code), where it gets the next case to process from <code>table.dat</code>. Then the script <code>single_case.sh</code> (see [[#single_case.sh|single_case.sh]]) is executed once for each case, which in turn calls the user code.


This approach results in dynamic workload balancing achieved across all the running "meta-jobs" belonging to the same farm. This can be seen more clearly in the diagram below:
<!--T:198-->
This approach results in dynamic workload balancing achieved across all the running <i>metajobs</i> belonging to the same farm. The algorithm is illustrated by the diagram below:


[[File:meta2.png|600px]]
<!--T:199-->
[[File:DWB_META.png|800px]]


The dynamic workload balancing results in all meta-jobs finishing around the same time, regardless of how different the runtimes are for individual cases, regardless of how fast CPUs are on different nodes, and regardless of whether all "meta-jobs" start at the same time (as the above diagram shows), or start at different times (which would normally be the case). In addition, this approach is very robust: not all meta-jobs need to start running for all the cases to be processed; if a meta-job dies (due to a node crash), at most one case will be lost. (The latter can be easily rectified by running the "resubmit.run" script; see [[#Resubmitting failed/never-run jobs]].)
<!--T:200-->
This can be seen more clearly in [https://www.youtube.com/watch?v=GcYbaPClwGE&t=423s this animation] from the META webinar.


To enable the “multiple cases per job” mode (with dynamic workload balancing), the first argument to “submit.run” script should be the desired number of meta-jobs, e.g.:
<!--T:201-->
The dynamic workload balancing results in all metajobs finishing around the same time, regardless of how different the runtimes are for individual cases, regardless of how fast CPUs are on different nodes, and regardless of when individual <i>metajobs</i> start. In addition, not all metajobs need to start running for all the cases to be processed, and if a metajob dies (e.g. due to a node crash), at most one case will be lost. The latter can be easily rectified with <code>resubmit.run</code>; see [[META-Farm#Resubmitting_failed_cases|Resubmitting failed cases]].


<source lang="bash">
<!--T:202-->
  $  submit.run 32
Not all of the requested metajobs will necessarily run, depending on how busy the cluster is. But as described above, in META mode you will eventually get all your results regardless of how many metajobs run, although you might need to use <code>resubmit.run</code> to complete a particularly large farm.
</source>


Not all of the requested meta-jobs will necessarily run (this depends on how busy the cluster is). But as described above, in the "many cases per job" mode you will eventually get all your results regardless of how many meta-jobs will run. (You might need to run "resubmit.run", sometimes more than once, to complete particularly large serial farms).
==Estimating the runtime and number of metajobs== <!--T:203-->


==Estimating the runtime and number of meta-jobs==
<!--T:204-->
How to figure out the optimum number of meta-jobs, and the runtime (to be used in job_script.sh)?  
How should you figure out the optimum number of metajobs, and the runtime to be used in <code>job_script.sh</code>?  


First you need to figure out what is the average runtime for an individual case (a single line in table.dat). One way to do it is to allocate a cpu with salloc command, cd to the farm directory, and execute the single_case.sh script there multiple times, for different cases, measuring the total runtime, and then dividing that by the number of cases to get an estimate of the average case runtime. This can be conveniently achieved with a bash "for" loop:
<!--T:205-->
First you need to figure out the average runtime for an individual case (a single line in table.dat). Supposing your application program is not parallel, allocate a single CPU core with [[Running_jobs#Interactive_jobs|<code>salloc</code>]], then execute <code>single_case.sh</code> there for a few different cases.  Measure the total runtime and divide that by the number of cases you ran to get an estimate of the average case runtime. This can be done with a shell <code>for</code> loop:


</translate>
<source lang="bash">
<source lang="bash">
   $  N=10; time for ((i=1; i<=$N; i++)); do  ./single_case.sh table.dat $i  ; done
   $  N=10; time for ((i=1; i<=$N; i++)); do  ./single_case.sh table.dat $i  ; done
</source>
</source>
<translate>


The "real" time obtained with the above command should be divided by $N (10 in this example) to get the average case runtime estimate. Let's call it dt_case (in seconds).
<!--T:206-->
Divide the "real" time output by the above command by <code>$N</code> to get the average case runtime estimate. Let's call it <i>dt_case</i>.


You can estimate the amount of cpu cycles needed to process the whole farm, by multiplying dt_case by the number of cases (number of lines in table.dat). This will be in cpu-seconds. Dividing that by 3600 gives you the amount of compute resources in cpu-hours. Multiply that by something like 1.1 - 1.3 to have a bit of a safety margin.
<!--T:207-->
Estimate the total CPU time needed to process the whole farm by multiplying <i>dt_case</i> by the number of cases, that is, the number of lines in <code>table.dat</code>.  
If this is in CPU-seconds, dividing that by 3600 gives you the total number of CPU-hours.  
Multiply that by something like 1.1 or 1.3 to have a bit of a safety margin.


Now you can make a sensible choice for the runtime of meta-jobs, and that will also give you the number of meta-jobs needed to finish the whole farm.
<!--T:208-->
Now you can make a sensible choice for the runtime of metajobs, and that will also determine the number of metajobs needed to finish the whole farm.


The runtime you choose should be significantly larger (ideally by a factor of 100 or more) than the average runtime of individual cases. In any case, it should definitely be larger than the expected longest individual case runtime. On the other hand, it should not be too large (say, no more than 3 days) to avoid very long queue wait time (the longer the job's runtime is, the smaller is the number of cluster's nodes available for such jobs). A good choice would be either 12h or 1d. Once you settled on the runtime, you can divide the farm's cpu cycles amount (in cpu-hours) by the meta-job's runtime (in hours) to get the required number of meta-jobs (should be rounded up to the next larger integer number).
<!--T:209-->
The runtime you choose should be significantly larger than the average runtime of an individual case, ideally by a factor of 100 or more.  
It must definitely be larger than the longest runtime you expect for an individual case.  
On the other hand it should not be too large; say, no more than 3 days.
The longer a job's runtime is, the longer it will usually wait to be scheduled.  
On Alliance general-purpose clusters, a good choice would be 12h or 24h due to [[Job_scheduling_policies#Time_limits|scheduling policies]].  
Once you have settled on a runtime, divide the total number of CPU-hours by the runtime you have chosen (in hours) to get the required number of metajobs.
Round up this number to the next integer.


<!--T:210-->
With the above choices, the queue wait time should be fairly small, and the throughput and efficiency of the farm should be fairly high.
With the above choices, the queue wait time should be fairly small, and the throughput and efficiency of the farm should be fairly high.


Let's consider a specific example. You ran the above "for loop" command on a dedicated (obtained via salloc command) CPU-core, and estimated that the average individual case runtime is 95 seconds. The total number of cases to process (number of lines in table.dat) is say 1000. The total amount of resources required to compute all your cases is then 95s x 1000 = 95,000 core-seconds = 26.4 core-hours. You choose a short runtime of 3 hours for your meta-jobs to ensure the shortest possible queue wait time (use it as the "#SBATCH -t " argument in your job_script.sh file). Now you can estimate how many meta-jobs you'll need to process all the cases: N = 26.4 core-hours / 3 hours = 8.8. You multiply that by a factor of 1.2 as a safety measure (10.56), and then round it up to the next larger integer - 11. That means you can process the whole farm by executing a single command "submit.run 11".
<!--T:211-->
Let's consider a specific example. Suppose you ran the above <code>for</code> loop on a dedicated CPU obtained with <code>salloc</code>, and the output said the "real" time was 15m50s, which is 950 seconds. Divide that by the number of sample cases, 10, to find that the average time for an individual case is 95 seconds. Suppose also the total number of cases you have to process (the number of lines in <code>table.dat</code>) is 1000. The total CPU time required to compute all your cases is then<br>
95 x 1000 = 95,000 CPU-seconds = 26.4 CPU-hours<br>
Multiply that by a factor of 1.2 as a safety measure, to yield 31.7 CPU-hours.  A runtime of 3 hours for your metajobs would work here, and should lead to good queue wait times.  Edit the value of the <code>#SBATCH -t</code> in <code>job_script.sh</code> to be <code>3:00:00</code>. Now estimate how many metajobs you'll need to process all the cases.<br>
N = 31.7 core-hours / 3 hours = 10.6<br>
which rounded up to the next integer is 11. Then you can launch the farm by executing a single <code>submit.run 11</code>.


For particularly large farms, if the number of jobs in the above analysis is larger than 1000 (the maximum number of jobs which can be submitted on Graham), the workaround would be to go through the sequence of commands (each command can only be executed after the previous farm has finished running):
<!--T:212-->
If the number of jobs in the above analysis is larger than 1000, you have a particularly large farm. 
The maximum number of jobs which can be submitted on Graham and Beluga is 1000, so you won't be able to run the whole collection with a single command. 
The workaround would be to go through the following sequence of commands.
Remember each command can only be executed after the previous farm has finished running:


</translate>
<source lang="bash">
<source lang="bash">
   $  submit.run 1000
   $  submit.run 1000
Line 278: Line 450:
   ...   
   ...   
</source>
</source>
<translate>


==Runtime problem==
<!--T:213-->
Here is one potential problem when one is running multiple cases per job, utilizing dynamic workload balancing: what if the number of running meta-jobs times the requested runtime per meta-job (say, 3 days) is not enough to process all your cases? E.g., you managed to start the maximum allowed 1000 meta-jobs, each of which has a 3 day runtime limit. That means that your serial farm can only process all the cases in a single run if the average_case_runtime x N_cases < 1000 x 3d = 3000 cpu days. (In less perfect cases, you will be able to run < 1000 meta-jobs, resulting in even smaller number of cpu days your farm can process). Once your meta-jobs start hitting the 3d runtime limit, they will start dying in the middle of processing one of your cases. This will result in up to 1000 interrupted cases calculations. This is not a big deal in terms of accounting (the "resubmit.run" will find all the cases which failed or never ran, and will resubmit them automatically). But this can become a waste of cpu cycles, because many of your cases are dying half-way through. On average, you will be wasting 0.5 x N_jobs x average_case_runtime cpu-days. E.g. if your cases have an average runtime of 1 hour, and you have 1000 meta-jobs running, you will waste ~20 cpu days, which is not acceptable.
If this seems rather tedious, consider using an advanced feature of the META package for such large farms: [[META:_Advanced_features_and_troubleshooting#Resubmitting_failed_cases_automatically|Resubmitting failed cases automatically]]. This will fully automate the farm resubmission steps.
 
Fortunately, the scripts we are providing have some built-in intelligence to mitigate this problem. This is implemented in the "task.run" script as follows:
 
* The script measures runtime of each case, and adds the value as one line in a scratch file "times" created inside /home/$USER/tmp/NODE.PID directory (see [[#Output files]]). This is done by all running meta-jobs.
* Once the first 8 cases were computed, one of the meta-jobs will read the contents of the file "times" and compute the larger 12.5% quantile for the current distribution of case runtimes. This will serve as a conservative estimate of the runtime for your individual cases, dt_cutoff. (The current estimate is stored in dt_cutoff file inside the /home/$USER/tmp/NODE.PID directory.)
* From now on, each meta-job will estimate if it has the time to finish the case it is about to start computing, by ensuring that t_finish - t_now > dt_cutoff. (Here t_finish is the time when the job will die because of the job's runtime limit; t_now is the current time.) If it thinks it doesn't have the time, it will exit early, which will minimize the chance of a case computation aborted half-way due to the job's runtime limit.
* At every subsequent power of two number of computed cases (8, then 16, then 32 and so on) dt_cutoff is recomputed using the above algorithm. This will make the dt_cutoff estimate more and more accurate. Power of two is used to minimize the overheads related to computing dt_cutoff; the algorithm will be equally efficient for both very small (tens) and very large (many thousands) number of cases.
* The above algorithm reduces the amount of cpu cycles wasted due to jobs hitting the runtime limit by a factor of 8.
 
As a useful side effect, every time you run a serial farm, you get individual runtimes for all of your cases (stored in /home/$USER/tmp/NODE.PID/times file). You can analyze that file to fine-tune your serial farming setup, for profiling your code etc.
 
=Additional information=
==Passing additional sbatch arguments==
What if you need to use additional sbatch arguments (like --mem 4G, --gres=gpu:1 etc.)? Simple: just add all those arguments at the end of “submit.run” and “resubmit.run” command line, and they will be passed to sbatch, e.g.:
 
<source lang="bash">
  $  submit.run  -1  --mem 4G
</source>
 
Alternatively, you can supply these arguments as separate "#SBATCH" lines in your job_script.sh file.
 
==Multi-threaded farming==
For “multi-threaded farming” (OpenMP etc.), add "--cpus-per-task=N" and "--mem=XXX" sbatch arguments to “(re)submit.run” (or add the corresponding #SBATCH lines to your job_script.sh file). Here “N” is the number of cpu cores/threads to use. Also, add the following line inside your “job_script.sh” file right before the task.run line:
 
<source lang="bash">
  export OMP_NUM_THREADS=$SLURM_CPUS_PER_TASK
</source>
 
==MPI farming==
For “MPI farming”, use these sbatch arguments with “(re)submit.run” (or add the corresponding #SBATCH lines to your job_script.sh file):
 
<source lang="bash">
  --ntasks=N  --mem-per-cpu=XXX
</source>
 
Also add “srun” before the path to your code inside “single_case.sh”, e.g.:
 
<source lang="bash">
  srun  $COMM
</source>
 
Alternatively, you can prepend “srun” on each line of your table.dat:
 
<source lang="bash">
  srun /path/to/mpi_code arg1 arg2
  srun /path/to/mpi_code arg1 arg2
  ...
  srun /path/to/mpi_code arg1 arg2
</source>
 
==GPU farming==
For GPU farming, you only need to modify your job_script.sh file accordingly. For example, for farming where the code uses one GPU add one extra line:
 
<source lang="bash">
#SBATCH --gres=gpu:1
</source>
 
It is also a good idea to copy my utility ~syam/bin/gpu_test to your ~/bin directory (only on graham, cedar, and beluga), and put the following lines in your job_script.sh file right before the "task.run" line:
 
<source lang="bash">
gpu_test
retVal=$?
if [ $retVal -ne 0 ]; then
    echo "No GPU found - exiting..."
    exit 1
fi
</source>
 
This will catch those quite rare situations when there is a technical issue with the node rendering the GPU being not available. If that happens to one of your meta-jobs, and you don't have the above lines in your script, the rogue meta-job will churn through (and fail) all your cases from table.dat.
 
==FORTRAN code example: using standard input==
You have a FORTRAN (or C/C++) serial code, “fcode”; each case needs to read a separate file from standard input – say “data.xxx” (in /home/user/IC directory), where xxx goes from 1 to N_cases. Place “fcode” on your $PATH (e.g., in ~/bin, make sure /home/$USER/bin is added to $PATH in .bashrc; alternatively, use a full path to your code in the cases table). Create table.dat (inside META directory) like this:
 
  fcode < /home/user/IC/data.1
  fcode < /home/user/IC/data.2
  ...
  fcode < /home/user/IC/data.N_cases
 
The task of creating the table can be greatly simplified if you use a BASH loop command, e.g.:
 
<source lang="bash">
  $  for ((i=1; i<=10; i++)); do echo "fcode < /home/user/IC/data.$i"; done >table.dat
</source>
 
==FORTRAN code example: copying files for each case==
Another typical FORTRAN code situation: you need to copy a file (say, /path/to/data.xxx) to each case subdirectory, before executing the code, and rename it to some standard input file name. Your table.dat can look like this:
 
  /path/to/code
  /path/to/code
  ...
 
Add one line (first line in the example below) to your “single_case.sh”:
 
<source lang="bash">
  \cp /path/to/data.$ID standard_name
  $COMM
  STATUS=$?
</source>
 
==Using all the columns in the cases table explicitly==
The examples shown so far presume that each line in the cases table is an executable statement (except for the first column which is added automatically by the scripts and contains the line #), starting with either the code binary name (when the binary is on your $PATH) or full path to the binary, and then listing the code's command line arguments (if any) particular to that case, or something like " < input.$ID" if your code expects the initial conditions via standard input.


In the most general case, one wants to have the ultimate flexibility in being able to access all the columns in the table individually. That is easy to achieve by slightly modifying the "single_case.sh" script:
=Words of caution= <!--T:223-->


<source lang="bash">
<!--T:224-->
...
Always start with a small test run to make sure everything works before submitting a large production run. You can test individual cases by reserving an interactive node with <code>salloc</code>, changing to the farm directory, and executing commands like <code>./single_case.sh table.dat 1</code>, <code>./single_case.sh table.dat 2</code>, etc.
# ++++++++++++  This part can be customized:  ++++++++++++++++
#  $ID contains the case id from the original table
#  $COMM is the line corresponding to the case $ID in the original table, without the ID field
mkdir RUN$ID
cd RUN$ID


# Converting $COMM to an array:
<!--T:225-->
COMM=( $COMM )
If your farm is particularly large (say >10,000 cases), you should spend extra effort to make sure it runs as efficiently as possible. In particular, minimize the number of files and/or directories created during execution. If possible, instruct your code to append to existing files (one per metajob; <b>do not mix results from different metajobs in a single output file!</b>) instead of creating a separate file for each case. Avoid creating a separate subdirectory for each case.  (Yes, creating a separate subdirectory for each case is the default setup of this package, but that default was chosen for safety, not efficiency!)
# Number of columns in COMM:
Ncol=${#COMM[@]}
# Now one can access the columns individually, as ${COMM[i]} , where i=0...$Ncol-1
# A range of columns can be accessed as ${COMM[@]:i:n} , where i is the first column
# to display, and n is the number of columns to display
# Use the ${COMM[@]:i} syntax to display all the columns starting from the i-th column
# (use for codes with a variable number of command line arguments).


# Call the user code here.
<!--T:226-->
...
The following example is optimized for a very large number of cases. It assumes, for purposes of the example:
 
* that your code accepts the output file name via a command line switch <code>-o</code>,
# Exit status of the code:
* that the application opens the output file in <b>append</b> mode, that is, multiple runs will keep appending to the existing file,  
STATUS=$?
* that each line of <code>table.dat</code> provides the rest of the command line arguments for your code,
cd ..
* that multiple instances of your code can safely run concurrently inside the same directory, so there is no need to create a subdirectory for each case,
# ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
* and that each run will not produce any files besides the output file.  
...
With this setup, even very large farms (hundreds of thousands or even millions of cases) should run efficiently, as there will be very few files created.
</source>
 
For example, you need to provide to your code both an initial conditions file (to be used via standard input), and a variable number of command line arguments. Your cases table will look like this:
 
  /path/to/IC.1 0.1
  /path/to/IC.2 0.2 10
  ...
 
The way to implement this in "single_case.sh" is as follows:


<source lang="bash">
<!--T:227-->
# Call the user code here.
/path/to/code ${COMM[@]:1} < ${COMM[0]}
</source>
 
=Troubleshooting=
Here we explain typical error messages you might get when using this package.
 
==Problems with submit.run==
==="lockfile is not on path; exiting"===
Make sure the utility lockfile is on your $PATH.
 
==="File table.dat doesn't exist. Exiting"===
You forgot to create the table.dat file in the current directory, or perhaps you are running submit.run not inside one of your farm sub-directories.
 
==="Job runtime sbatch argument (-t or --time) is missing in job_script.sh. Exiting"===
Make sure you provide the runtime for all meta-jobs as an #SBATCH argument inside your job_script.sh file. This is a requirement - the runtime sbatch argument is the only one which cannot be passed as an optional argument for submit.run.
 
==="Wrong job runtime in job_script.sh - nnn . Exiting"===
You didn't format properly the runtime argument inside your job_script.sh file.
 
==Problems with resubmit.run==
==="Jobs are still running/queued; cannot resubmit"===
You cannot use resubmit.run until all meta-jobs from this farm finished running. Use list.run or queue.run to check the status of the farm.
 
==="No failed/unfinished jobs; nothing to resubmit"===
Not an error - simply tells you that your farm was 100% processed, and that there are no more (failed or never-ran) cases to compute.
 
==Problems with running jobs==
==="Too many failed (very short) cases - exiting"===
This happens if the first $N_failed_max (5 by default) cases are very short  - less than $dt_failed (5 by default) seconds in duration. The two variables, $N_failed_max and $dt_failed, can be adjusted by editing the task.run script. This is a protection mechanism, in case anything is amiss - a problem with the node (file system not mounted, GPU is missing etc), with the job parameters (not enough of RAM etc), or with the code (the binary is missing or instantly crashing, input files are missing etc.). This protection will prevent the bad meta-job churning through (and failing) all the cases in table.dat.
 
==="lockfile is not on path on node XXX"===
As the error message suggests, somehow the utility lockfile is not on your $PATH - either you forgot to modify your $PATH variable accordingly, to copy lockfile into your ~/bin directory, or perhaps something is wrong on that particular compute node (home file system not mounted). The lockfile utility is critical for this package (it ensures serialized access of meta-jobs to the table.dat file), and it won't work if the utility is not accessible.
 
==="Exiting after processing one case (-1 option)"===
This is actually not an error - it simply tells you that you submitted the farm with via "submit.run -1" (one case per job mode), so each meta-job is exiting after processing a single case.
 
==="Not enough runtime left; exiting."===
This message tells you that the meta-job would likely not have enough time left to process the next case (based on the analysis of runtimes for all the cases processed so far), so it is exiting earlier.
 
==="No cases left; exiting."===
This is not an error message - this is how each meta-job normally finishes, when all cases have already been computed.
 
=Words of caution=
* Always start with a much smaller test farm run, to make sure everything works, before submitting a large production run farm. You can test individual cases by reserving an interactive node with "salloc" command, cd'ing to the farm directory, and executing commands like "./single_case.sh table.dat 1", "./single_case.sh table.dat 2" etc.
* If your farm is particularly large (say > 10,000 cases), extra efforts have to be spent to make sure it runs as efficiently as possible. In particular, you have to minimize number of files and/or directories created during the jobs execution. If possible, instruct your code to add to the existing results files (one per meta-job; '''do not mix results from different meta-jobs in a single output file!'''), instead of creating a separate results file for each case. Definitely avoid creating a separate subdirectory for each case (which is the default setup of this package). The following example (optimized for large number of cases) assumes that your code accepts the output file name via "-o" command line switch, that the output file is used in "append" mode (multiple code runs will keep adding to the existing file), and that each line of table.dat provides the rest of the command line switches for your code. It is also assumed that multiple instances of your code can safely run concurrently inside the same directory (so no need to create subdirectories for each case), and that each code run will not produce any other files (beside the output file). With this setup, even very large farms (hundreds of thousands or even millions of cases) should run fairly efficiently, as there will be very few files generated.
<source lang="bash">
<source lang="bash">
...
...
Line 474: Line 479:
#  $ID contains the case id from the original table (can be used to provide a unique seed to the code etc)
#  $ID contains the case id from the original table (can be used to provide a unique seed to the code etc)
#  $COMM is the line corresponding to the case $ID in the original table, without the ID field
#  $COMM is the line corresponding to the case $ID in the original table, without the ID field
#  $SLURM_JOB_ID is the jobid for the current meta-job (convenient for creating per-job files)
#  $METAJOB_ID is the jobid for the current metajob (convenient for creating per-job files)


<!--T:228-->
# Executing the command (a line from table.dat)
# Executing the command (a line from table.dat)
/path/to/your/code  $COMM  -o output.$SLURM_JOB_ID
/path/to/your/code  $COMM  -o output.$METAJOB_ID


<!--T:229-->
# Exit status of the code:
# Exit status of the code:
STATUS=$?
STATUS=$?
Line 485: Line 492:
</source>
</source>


= If more help is needed =
= If more help is needed = <!--T:219-->
 
<!--T:220-->
See [[META-Farm: Advanced features and troubleshooting]] for more detailed discussion of some features, and for troubleshooting suggestions.
 
<!--T:221-->
If you need more help, contact [[technical support]], mentioning the name of the package (META), and the name of the staff member who wrote the software (Sergey Mashchenko).
 
== Glossary == <!--T:222-->
* '''case''': One independent computation. The file <code>table.dat</code> should list one case per line.
* '''farm / farming''' (verb): Running many jobs on a cluster which carry out independent (but related) computations, of the same kind.
* '''farm''' (noun): The directory and files involved in running one instance of the package.
* '''metajob''': A job which can process multiple cases (independent computations) from <code>table.dat</code>.
* '''META mode''': The mode of operation of the package in which each job can process ''multiple'' cases from <code>table.dat</code>.
* '''SIMPLE mode''': The mode of operation of the package in which each job will process only one case from <code>table.dat</code>.


Submit a ticket to Compute Canada ticketing system (by sending an email to support@computecanada.ca), mentioning the name of the package (META), and the name of the staff who wrote the software (Sergey Mashchenko).


[[Category:Tutorials]]
</translate>

Latest revision as of 20:44, 21 March 2024

Other languages:

Overview[edit]

META (short for META-Farm) is a suite of scripts designed in SHARCNET to automate high-throughput computing, that is, running a large number of related calculations. This practice is sometimes called farming, serial farming, or task farming. META works on all Alliance national systems, and could also be used on other clusters which use the same setup (most importantly, which use the Slurm scheduler).

In this article, we use the term case for one independent computation, which may involve the execution of a serial program, a parallel program, or a GPU-using program.
The term job is an invocation of the Slurm job scheduler, which may handle several cases.

META has the following features:

  • two modes of operation:
    • SIMPLE mode, which handles one case per job,
    • META mode, which handles many cases per job,
  • dynamic workload balancing in META mode,
  • captures the exit status of all individual cases,
  • automatically resubmits all the cases which failed or never ran,
  • submits and independently operates multiple farms (groups of cases) on the same cluster,
  • can automatically run a post-processing job once all the cases have been processed successfully.

Some technical requirements:

  • For each farm, each case to be computed must be described as a separate line in a table.dat file.
  • You can run multiple farms independently, but each farm must have its own directory.

In META mode, the number of actual jobs (called metajobs) submitted by the package is usually much smaller than the number of cases to process. Each metajob can process multiple lines (multiple cases) from table.dat. A collection of metajobs will read lines from table.dat, starting from the first line, in a serialized manner using the lockfile mechanism to prevent a race condition. This ensures a good dynamic workload balance between metajobs, as metajobs which handle shorter cases will process more of them.

Not all metajobs need to run in META mode. The first metajob to run will start processing lines from table.dat; if and when the second job starts, it joins the first one, and so on. If the runtime of an individual metajob is long enough, all the cases might be processed with just a single metajob.

META vs. GLOST[edit]

The META package has important advantages over other approaches like GLOST where farm processing is done by bundling up all the jobs into a large parallel (MPI) job:

  • As the scheduler has full flexibility to start individual metajobs when it wants, the queue wait time can be dramatically shorter with the META package than with GLOST. Consider a large farm where 1000 CPU cores need to be used for 3 days;
    • with GLOST, with a 1000-way MPI job, queue wait time can be weeks, so it'll be weeks before you see your very first result;
    • with META, some metajobs start to run and produce the first results within minutes.
  • At the end of the farm computations;
    • with GLOST, some MPI ranks will finish earlier and will sit idle until the very last—the slowest—MPI rank ends;
    • with META, there is no such waste at the end of the farm: individual metajobs exit earlier if they have no more workload to process.
  • GLOST and other similar packages do not support automated resubmission of the cases which failed or never ran. META has this feature, and it is very easy to use.

The META webinar[edit]

A webinar was recorded on October 6th, 2021 describing the META package. You can view it here.

Quick start[edit]

If you are impatient to start using META, just follow the steps listed below. However, it is highly recommended to also read the rest of the page.

  • Log into a cluster.
  • Load the meta-farm module.
$ module load meta-farm
  • Choose a name for a farm directory, e.g. Farm_name, and create it with the following command
$ farm_init.run  Farm_name
$ submit.run -1

for the one case per job (SIMPLE) mode, or

$ submit.run N

for the many cases per job (META) mode, where N is the number of metajobs to use. N should be significantly smaller than the total number of cases.

To run another farm concurrently with the first one, run farm_init.run again (providing a different farm name) and customize files single_case.sh and job_script.sh inside the new farm directory, then create a new table.dat file there. Also copy the executable and all the input files as needed. Now you can execute the submit.run command inside the second farm directory to submit the second farm.

List of commands[edit]

  • farm_init.run: Initialize a farm. See Quick start above.
  • submit.run: Submit the farm to the scheduler. See submit.run below.
  • resubmit.run: Resubmit all computations which failed or never ran as a new farm. See Resubmitting failed cases.
  • list.run: List all the jobs with their current state for the farm.
  • query.run: Provide a short summary of the state of the farm, showing the number of queued, running, and completed jobs. More convenient than using list.run when the number of jobs is large. It will also print the progress—that is, the number of processed cases vs. the total number of cases—both for the current run, and globally.
  • kill.run: Kill all the running and queued jobs in the farm.
  • prune.run: Remove only queued jobs.
  • Status.run: (capital "S") List statuses of all processed cases. With the optional -f, the non-zero status lines (if any) will be listed at the end.
  • clean.run: Delete all the files in the farm directory (including subdirectories if any present), except for job_script.sh, single_case.sh, final.sh, resubmit_script.sh, config.h, and table.dat. It will also delete all files associated with this farm in the /home/$USER/tmp directory. Be very careful with this script!

All of these commands (except for farm_init.run itself) have to be executed inside a farm directory, that is, a directory created by farm_init.run.

Small number of cases (SIMPLE mode)[edit]

Recall that a single execution of your code is a case and a job is an invocation of the Slurm scheduler. If:

  • the total number of cases is fairly small--- say, less than 500, and
  • each case runs for at least 20 minutes,

then it is reasonable to dedicate a separate job to each case using the SIMPLE mode. Otherwise you should consider using the META mode to handle many cases per job, for which please see Large number of cases (META mode) below.

The three essential scripts are the command submit.run, and two user-customizable scripts single_case.sh and job_script.sh.

submit.run[edit]

Note: This section applies to both SIMPLE and META modes.

The command submit.run has one obligatory argument, the number of jobs to submit, N:

   $ submit.run N [-auto] [optional_sbatch_arguments]

If N=-1, you are requesting the SIMPLE mode (submit as many jobs as there are lines in table.dat). If N is a positive integer, you are requesting the META mode (multiple cases per job), with N being the number of metajobs requested. Any other value for N is not valid.

If the optional switch -auto is present, the farm will resubmit itself automatically at the end, more than once if necessary, until all the cases from table.dat have been processed. This feature is described at Resubmitting failed cases automatically.

If a file named final.sh is present in the farm directory, submit.run will treat it as a job script for a post-processing job and it will be launched automatically once all the cases from table.dat have been successfully processed. See Running a post-processing job automatically for more details.

If you supply any other arguments, they will be passed on to the Slurm command sbatch used to launch all metajobs for this farm.

single_case.sh[edit]

Note: This section applies to both SIMPLE and META modes.

The function of single_case.sh is to read one line from table.dat, parse it, and use the contents of that line to launch your code for one case. You may wish to customize single_case.sh for your purposes.

The version of single_case.sh provided by farm_init.run treats each line in table.dat as a literal command and executes it in its own subdirectory RUNyyy, where yyy is the case number. Here is the relevant section of single_case.sh:

...
# ++++++++++++++++++++++  This part can be customized:  ++++++++++++++++++++++++
#  Here:
#  $ID contains the case id from the original table (can be used to provide a unique seed to the code etc)
#  $COMM is the line corresponding to the case $ID in the original table, without the ID field
#  $METAJOB_ID is the jobid for the current metajob (convenient for creating per-job files)

mkdir -p RUN$ID
cd RUN$ID

echo "Case $ID:"

# Executing the command (a line from table.dat)
# It's allowed to use more than one shell command (separated by semicolons) on a single line
eval "$COMM"

# Exit status of the code:
STATUS=$?

cd ..
# +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
...


Consequently, if you are using the unmodified single_case.sh then each line of table.dat should contain a complete command. This may be a compound command, that is, several commands separated by semicolons (;).

Typically table.dat will contain a list of identical commands differentiated only by their arguments, but it need not be so. Any executable statement can go into table.dat. Your table.dat could look like this:

 /home/user/bin/code1  1.0  10  2.1
 cp -f ~/input_dir/input1 .; ~/code_dir/code 
 ./code2 < IC.2

If you intend to execute the same command for every case and don't wish to repeat it on every line of table.dat, then you can edit single_case.sh to include the common command. Then edit your table.dat to contain only the arguments and/or redirects for each case.

For example, here is a modification of single_case.sh which includes the command (/path/to/your/code), takes the contents of table.dat as arguments to that command, and uses the case number $ID as an additional argument:

  • single_case.sh
...
# ++++++++++++++++++++++  This part can be customized:  ++++++++++++++++++++++++
# Here we use $ID (case number) as a unique seed for Monte-Carlo type serial farming:
/path/to/your/code -par $COMM  -seed $ID
STATUS=$?
# +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
...
  • table.dat
 12.56
 21.35
 ...

Note 1: If your code doesn't need to read any arguments from table.dat, you still have to generate table.dat, with the number of lines equal to the number of cases you want to compute. In this case, it doesn't matter what you put inside table.dat—all that matters is the total number of the lines. The key line in the above example might then look like

/path/to/your/code -seed $ID

Note 2: You do not need to insert line numbers at the beginning of each line of table.dat. The script submit.run will modify table.dat to add line numbers if it doesn't find them there.

STATUS and handling errors[edit]

What is STATUS for in single_case.sh? It is a variable which should be set to “0” if your case was computed correctly, and some positive value (that is, greater than 0) otherwise. It is very important: It is used by resubmit.run to figure out which cases failed so they can be re-computed. In the provided version of single_case.sh, STATUS is set to the exit code of your program. This may not cover all potential problems, since some programs produce an exit code of zero even if something goes wrong. You can change how STATUS is set by editing single_case.sh.

For example if your code is supposed to write a file (say, out.dat) at the end of each case, test whether the file exists and set STATUS appropriately. In the following code fragment, $STATUS will be positive if either the exit code from the program is positive, or if out.dat doesn't exist or is empty:

  STATUS=$?
  if test ! -s out.dat
     then
     STATUS=1
     fi

job_script.sh[edit]

Note: This section applies to both SIMPLE and META modes.

The file job_script.sh is the job script which will be submitted to SLURM for all metajobs in your farm. Here is the default version created for you by farm_init.run:

#!/bin/bash
# Here you should provide the sbatch arguments to be used in all jobs in this serial farm
# It has to contain the runtime switch (either -t or --time):
#SBATCH -t 0-00:10
#SBATCH --mem=4G
#SBATCH -A Your_account_name

# Don't change this line:
task.run

At the very least you should change the account name (the -A switch), and the metajob runtime (the -t switch). In SIMPLE mode, you should set the runtime to be somewhat longer than the longest expected individual case.

Important: Your job_script.sh must include the runtime switch (either -t or --time). This cannot be passed to sbatch as an optional argument to submit.run.

Sometimes the following problem happens: A metajob may be allocated to a node which has a defect, thereby causing your program to fail instantly. For example, perhaps your program needs a GPU but the GPU you're assigned is malfunctioning, or perhaps the /project file system is not mounted. (Please report such a defective node to support@tech.alliancecan.ca if you detect one!) But when it happens, that single bad metajob can quickly churn through table.dat, so your whole farm fails. If you can anticipate such problems, you can add tests to job_script.sh before the task.run line. For example, the following modification will test for the presence of an NVidia GPU, and if none is found it will force the metajob to exit before it starts failing your cases:

nvidia-smi >/dev/null
retVal=$?
if [ $retVal -ne 0 ]; then
    exit 1
fi
task.run

There is a utility gpu_test which does a similar job to nvidia_smi in the above example. On Graham, Cedar, or Beluga you can copy it to your ~/bin directory:

cp ~syam/bin/gpu_test ~/bin

The META package has a built-in mechanism which tries to detect problems of this kind and kill a metajob which churns through the cases too quickly. The two relevant parameters, N_failed_max and dt_failed are set in the file config.h. The protection mechanism is triggered when the first $N_failed_max cases are very short - less than $dt_failed seconds in duration. The default values are 5 and 5, so by default a metajob will stop if the first 5 cases all finish in less than 5 seconds. If you get false triggering of this protective mechanism because some of your normal cases have runtime shorter than $dt_failed, reduce the value of dt_failed in config.h.

Output files[edit]

Note: This section applies to both SIMPLE and META modes.

Once one or more metajobs in your farm are running, the following files will be created in the farm directory:

  • OUTPUT/slurm-$JOBID.out, one file per metajob containing its standard output,
  • STATUSES/status.$JOBID, one file per metajob containing the status of each case that was processed.

In both cases, $JOBID stands for the jobid of the corresponding metajob.

One more directory, MISC, will also be created inside the root farm directory. It contains some auxiliary data.

Also, every time submit.run is run, it will create a unique subdirectory inside /home/$USER/tmp. Inside that subdirectory, some small scratch files will be created, such as files used by lockfile to serialize certain operations inside the jobs. These subdirectories have names $NODE.$PID, where $NODE is the name of the current node (typically a login node), and $PID is the unique process ID for the script. Once the farm execution is done, you can safely erase this subdirectory. This will happen automatically if you run clean.run, but be careful! clean.run also deletes all the results produced by your farm!

Resubmitting failed cases[edit]

Note: This section applies to both SIMPLE and META modes.

The resubmit.run command takes the same arguments as submit.run:

   $  resubmit.run N [-auto] [optional_sbatch_arguments]

resubmit.run:

  • analyzes all those status.* files (see Output files above);
  • figures out which cases failed and which never ran for whatever reason (e.g. because of the metajobs' runtime limit);
  • creates or overwrites a secondary table.dat_ file which lists only the cases that still need to be run;
  • launches a new farm for those cases.

You cannot run resubmit.run until all the jobs from the original run are done or killed.

If some cases still fail or do not run, you can resubmit the farm as many times as needed. Of course, if certain cases fail repeatedly, there must a be a problem with either the program you are running or its input. In this case you may wish to use the command Status.run (capital S!) which displays the statuses for all computed cases. With the optional argument -f, Status.run will sort the output according to the exit status, showing cases with non-zero status at the bottom to make them easier to spot.

Similarly to submit.run, if the optional switch -auto is present, the farm will resubmit itself automatically at the end, more than once if necessary. This advanced feature is described at Resubmitting failed cases automatically.

Large number of cases (META mode)[edit]

The SIMPLE (one case per job) mode works fine when the number of cases is fairly small (<500). When the number of cases is much greater than 500, the following problems may arise:

  • Each cluster has a limit on how many jobs a user can have at one time. (e.g. for Graham, it is 1000.)
  • With a very large number of cases, each case computation is typically short. If one case runs for <20 min, CPU cycles may be wasted due to scheduling overheads.

META mode is the solution to these problems. Instead of submitting a separate job for each case, a smaller number of metajobs are submitted, each of which processes multiple cases. To enable META mode the first argument to submit.run should be the desired number of metajobs, which should be a fairly small number—much smaller than the number of cases to process. e.g.:

   $  submit.run  32

Since each case may take a different amount of time to process, META mode uses a dynamic workload-balancing scheme. This is how META mode is implemented:

Meta1.png

As the above diagram shows, each job executes the same script, task.run. Inside that script, there is a while loop for the cases. Each iteration of the loop has to go through a serialized portion of the code (that is, only one job at a time can be in that section of code), where it gets the next case to process from table.dat. Then the script single_case.sh (see single_case.sh) is executed once for each case, which in turn calls the user code.

This approach results in dynamic workload balancing achieved across all the running metajobs belonging to the same farm. The algorithm is illustrated by the diagram below:

DWB META.png

This can be seen more clearly in this animation from the META webinar.

The dynamic workload balancing results in all metajobs finishing around the same time, regardless of how different the runtimes are for individual cases, regardless of how fast CPUs are on different nodes, and regardless of when individual metajobs start. In addition, not all metajobs need to start running for all the cases to be processed, and if a metajob dies (e.g. due to a node crash), at most one case will be lost. The latter can be easily rectified with resubmit.run; see Resubmitting failed cases.

Not all of the requested metajobs will necessarily run, depending on how busy the cluster is. But as described above, in META mode you will eventually get all your results regardless of how many metajobs run, although you might need to use resubmit.run to complete a particularly large farm.

Estimating the runtime and number of metajobs[edit]

How should you figure out the optimum number of metajobs, and the runtime to be used in job_script.sh?

First you need to figure out the average runtime for an individual case (a single line in table.dat). Supposing your application program is not parallel, allocate a single CPU core with salloc, then execute single_case.sh there for a few different cases. Measure the total runtime and divide that by the number of cases you ran to get an estimate of the average case runtime. This can be done with a shell for loop:

   $  N=10; time for ((i=1; i<=$N; i++)); do  ./single_case.sh table.dat $i  ; done

Divide the "real" time output by the above command by $N to get the average case runtime estimate. Let's call it dt_case.

Estimate the total CPU time needed to process the whole farm by multiplying dt_case by the number of cases, that is, the number of lines in table.dat. If this is in CPU-seconds, dividing that by 3600 gives you the total number of CPU-hours. Multiply that by something like 1.1 or 1.3 to have a bit of a safety margin.

Now you can make a sensible choice for the runtime of metajobs, and that will also determine the number of metajobs needed to finish the whole farm.

The runtime you choose should be significantly larger than the average runtime of an individual case, ideally by a factor of 100 or more. It must definitely be larger than the longest runtime you expect for an individual case. On the other hand it should not be too large; say, no more than 3 days. The longer a job's runtime is, the longer it will usually wait to be scheduled. On Alliance general-purpose clusters, a good choice would be 12h or 24h due to scheduling policies. Once you have settled on a runtime, divide the total number of CPU-hours by the runtime you have chosen (in hours) to get the required number of metajobs. Round up this number to the next integer.

With the above choices, the queue wait time should be fairly small, and the throughput and efficiency of the farm should be fairly high.

Let's consider a specific example. Suppose you ran the above for loop on a dedicated CPU obtained with salloc, and the output said the "real" time was 15m50s, which is 950 seconds. Divide that by the number of sample cases, 10, to find that the average time for an individual case is 95 seconds. Suppose also the total number of cases you have to process (the number of lines in table.dat) is 1000. The total CPU time required to compute all your cases is then
95 x 1000 = 95,000 CPU-seconds = 26.4 CPU-hours
Multiply that by a factor of 1.2 as a safety measure, to yield 31.7 CPU-hours. A runtime of 3 hours for your metajobs would work here, and should lead to good queue wait times. Edit the value of the #SBATCH -t in job_script.sh to be 3:00:00. Now estimate how many metajobs you'll need to process all the cases.
N = 31.7 core-hours / 3 hours = 10.6
which rounded up to the next integer is 11. Then you can launch the farm by executing a single submit.run 11.

If the number of jobs in the above analysis is larger than 1000, you have a particularly large farm. The maximum number of jobs which can be submitted on Graham and Beluga is 1000, so you won't be able to run the whole collection with a single command. The workaround would be to go through the following sequence of commands. Remember each command can only be executed after the previous farm has finished running:

   $  submit.run 1000
   $  resubmit.run 1000
   $  resubmit.run 1000
   ...

If this seems rather tedious, consider using an advanced feature of the META package for such large farms: Resubmitting failed cases automatically. This will fully automate the farm resubmission steps.

Words of caution[edit]

Always start with a small test run to make sure everything works before submitting a large production run. You can test individual cases by reserving an interactive node with salloc, changing to the farm directory, and executing commands like ./single_case.sh table.dat 1, ./single_case.sh table.dat 2, etc.

If your farm is particularly large (say >10,000 cases), you should spend extra effort to make sure it runs as efficiently as possible. In particular, minimize the number of files and/or directories created during execution. If possible, instruct your code to append to existing files (one per metajob; do not mix results from different metajobs in a single output file!) instead of creating a separate file for each case. Avoid creating a separate subdirectory for each case. (Yes, creating a separate subdirectory for each case is the default setup of this package, but that default was chosen for safety, not efficiency!)

The following example is optimized for a very large number of cases. It assumes, for purposes of the example:

  • that your code accepts the output file name via a command line switch -o,
  • that the application opens the output file in append mode, that is, multiple runs will keep appending to the existing file,
  • that each line of table.dat provides the rest of the command line arguments for your code,
  • that multiple instances of your code can safely run concurrently inside the same directory, so there is no need to create a subdirectory for each case,
  • and that each run will not produce any files besides the output file.

With this setup, even very large farms (hundreds of thousands or even millions of cases) should run efficiently, as there will be very few files created.

...
# ++++++++++++++++++++++  This part can be customized:  ++++++++++++++++++++++++
#  Here:
#  $ID contains the case id from the original table (can be used to provide a unique seed to the code etc)
#  $COMM is the line corresponding to the case $ID in the original table, without the ID field
#  $METAJOB_ID is the jobid for the current metajob (convenient for creating per-job files)

# Executing the command (a line from table.dat)
/path/to/your/code  $COMM  -o output.$METAJOB_ID

# Exit status of the code:
STATUS=$?
# +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
...

If more help is needed[edit]

See META-Farm: Advanced features and troubleshooting for more detailed discussion of some features, and for troubleshooting suggestions.

If you need more help, contact technical support, mentioning the name of the package (META), and the name of the staff member who wrote the software (Sergey Mashchenko).

Glossary[edit]

  • case: One independent computation. The file table.dat should list one case per line.
  • farm / farming (verb): Running many jobs on a cluster which carry out independent (but related) computations, of the same kind.
  • farm (noun): The directory and files involved in running one instance of the package.
  • metajob: A job which can process multiple cases (independent computations) from table.dat.
  • META mode: The mode of operation of the package in which each job can process multiple cases from table.dat.
  • SIMPLE mode: The mode of operation of the package in which each job will process only one case from table.dat.