Before you start#
A job array repeats a job for several inputs. Its range gives the total number
of tasks; the number after % is the concurrency cap, limiting how many can
run together. Each running
task requests its own CPUs and system memory. Your other jobs count too.
A distinct log name identifies each task and keeps its output separate.
Plan the proposal at the calculation step, then answer the three questions. You can use paper or a calculator.
The guided file repair and the planning example are separate. Keep the practice file at its required cap of one; do not put the proposed caps into it or submit an array to Euler.
A reminder for the calculation
Count simultaneous array tasks first, then work out their CPU and memory requests. Add the resources held by every other job. Compare CPU and memory separately with the budget; fitting one limit is not enough.
--mem-per-cpu requests memory for each allocated CPU. --mem requests memory
per node. In this example each array task uses one node and one Slurm task.
Do not use both memory options in the same script.
A planning cap is not the required cap-one file repair. Keep them separate.