{"id":767,"date":"2018-11-07T10:58:27","date_gmt":"2018-11-07T10:58:27","guid":{"rendered":"http:\/\/ri.itservices.manchester.ac.uk\/csf3\/?page_id=767"},"modified":"2025-06-19T18:11:43","modified_gmt":"2025-06-19T17:11:43","slug":"ls-dyna","status":"publish","type":"page","link":"https:\/\/ri.itservices.manchester.ac.uk\/csf3\/software\/applications\/ls-dyna\/","title":{"rendered":"LS-DYNA"},"content":{"rendered":"

Overview<\/h2>\n

A general purpose explicit solver from ANSYS<\/a>.<\/p>\n

LS-DYNA is provided as part of the Fluent<\/a> v19.2 & 18.1 installations.<\/p>\n

Restrictions on use<\/h2>\n

Only users who have been added to the fluent<\/code> group can run the application. Owing to licence restrictions, only users from the School of MACE can be added to this group. Please contact us<\/a> to be added to the fluent<\/code> group.<\/p>\n

The majority of users are restricted to serial jobs. Those from a specific research group who have purchased parallel licenses need to be added to the lsdyna<\/code> group.<\/p>\n

Set up procedure<\/h2>\n

Once you have been added to the fluent group, you will be able to access the executables after issuing the appropriate module command:<\/p>\n

\r\n\r\n# These are provided as part of the Fluent install. The version number indicates the fluent version.\r\nmodule load apps\/binapps\/ls-dyna\/19.2        # Provides LS-DYNA R10.1.0 SMP ingle-precision\r\nmodule load apps\/binapps\/ls-dyna\/18.1        # Provides LS-DYNA R8.1.0 SMP single-precision\r\n<\/pre>\n
Running the application<\/h2>\n
Please do not run LS-DYNA on the login nodes. All computational work must be submitted to the batch system.<\/p>\n
Please note that there are a VERY limited number of license tokens for this software. You MUST include a license check in your jobscript to ensure that if licenses are not available when the job tries to start it automatically re-queues (wihtout this your job will fail if there are not enough license tokens). <\/p>\n
Due to the limited number of license tokens queue waiting times may be much longer than for other types of work on the CSF. <\/p>\n
Serial batch job submission<\/h3>\n
\r\n#!\/bin\/bash --login\r\n#SBATCH -p serial      # (or --partition=) Run a serial (1-core) job\r\n#SBATCH -t 4-0         # Wallclock limit (4-0 is 4 days, max permitted is 7-0)               \r\n\r\n# Load the software\r\nmodule purge\r\nmodule load apps\/binapps\/ls-dyna\/18.1\r\n\r\n## Check that enough licenses are available and if not requeue (Rq) the job.\r\n. $LSDYNA_HOME\/lsdyna-liccheck.sh\r\n\r\nlsdyna i=myinputfile<\/pre>\n
replacing myinputfile<\/code> with the name of your input file.<\/p>\n
Then submit the job with the command: qsub scriptname<\/code><\/p>\n
where scriptname<\/code> is the name of your batch script.<\/p>\n
Parallel batch job submission<\/h3>\n
ONLY FOR USERS WHO HAVE PAID FOR PARALLEL LICENSES.<\/p>\n
You must have your own licenses (hosted centrally by IT Services) and then you also need to be added to the lsdyna<\/code> group on the CSF to run parallel work.<\/p>\n
\r\n#!\/bin\/bash --login\r\n#### Chose ONE of the following partitions\r\n#SBATCH -p multicore        # (or --partition=) Run on the 168-core AMD Genoa nodes\r\n### OR ###\r\n#SBATCH -p multicore_small  # (or --partition=) Run on the 32-core Intel nodes\r\n\r\n#SBATCH -n 7                # (or --ntasks=) Number of cores\r\n#SBATCH -t 4-0              # Wallclock limit (4-0 is 4 days, max permitted is 7-0)   \r\n\r\nmodule purge\r\nmodule load apps\/binapps\/ls-dyna\/18.1\r\n\r\n## Check that enough licenses are available and if not requeue (Rq) the job.\r\n\r\n. $LSDYNA_HOME\/lsdyna-liccheck.sh\r\n\r\nlsdyna i=myinputfile<\/em> ncpus=$SLURM_NTASKS\r\n<\/pre>\n
replacing myinputfile<\/em><\/code> with the name of your input file. $SLURM_NTASKS<\/code> will automatically get set to the number you put on the smp.pe<\/code> line.<\/p>\n
Then submit the job with the command: qsub scriptname<\/code><\/p>\n
where scriptname<\/code> is the name of your batch script.<\/p>\n
Important notes about parallel jobs<\/h3>\n