Quick Links Architectural Digest Scratch Space Checkpoint Files Memory Batch Jobs Swarm Jobs Command Line Utilities GaussView Optimization Forced 32-bit Version Testrun Benchmarks Multiprocessor Jobs Interpreting Errors Using Firebolt Using Linda

Gaussian03 is the latest in the Gaussian series of electronic structure programs. Designed to model a broad range of molecular systems under a variety of conditions, it performs its computations starting from the basic laws of quantum mechanics. Gaussian can predict energies, molecular structures, vibrational frequencies-along with the numerous molecular properties that are dervied from these three basic computation types-for systems in the gas phase and in solution, and it can model them in both their ground state and excited states. Chemists apply these fundamental results to their own investigations, using Gaussian to explore chemical phenomena like substituent effects, reaction mechanisms, and electronic transitions. Gaussian is a connected system of programs for performing semiempirical and ab initio molecular orbital calculations including: Calculation of one- and two-electron integrals over s, p, d, and f contracted gaussian functions Evaluation of various one-electron properties of the Hartree-Fock wavefunction, including Mulliken population analysis, multipole moments, and electrostatic fields Correlation energy calculations using configuration interaction using either all double excitations or all single and double excitations The Gaussian executables are limited by the node hardware (see below). The advantage of using Gaussian on Biowulf would be to run many Gaussian jobs simultaneously as a swarm of single- or dual-threaded jobs. Gaussian input and output can be graphically displayed using GaussView.

The default version of Gaussian03 is revision E.01. (NOTE: Due to licensing restrictions, users are required to belong to the group 'gaussian' on Helix computers in order to run version B.4 and higher. Please contact Helix Systems (staff@helix.nih.gov) to be added to the 'gaussian' group on Biowulf.)

Revision D.01 can be used by adding the option "-D01" to the commandline.

Revision C.02 can be used by adding the option "-C02" to the commandline.

• Type man gaussian at the Biowulf prompt for a brief overview of Gaussian
• Type man gutils at the Biowulf prompt for information on other Gaussian commands: c8603,  chkchk,  chkmove,  cubegen, cubman, formchk, freqmem, gauopt,  ghelp,  newzmat, testrt, and unfchk
• Gaussian has online help. Typing ghelp at the Biowulf prompt will bring up Gaussian information
• Gaussian links and resources at www.gaussian.com
• Gaussian 03 Help at www.gaussian.com
• GaussView 4 Help

There are three platforms on which Gaussian will run within the cluster:

32-bit Xeon nodes (p2800):

• Jobs can not use more than 2.0 GB of memory, due to an inherent limitation in address space (2**31-1 locations possible).
• All have 2 CPU per node.
• Slowest nodes, but most readily available.

64-bit Opteron nodes (o2000, o2200, o2600, o2800, and Helix):

• Memory available from 2GB to 8GB.
• Both single-core (2 CPU per node) and dual-core (4 CPU per node) available.
• Largest block of nodes available.

Firebolt (altix):

• 96GB memory, 32 CPU (although each user is limited to 4 CPU per job)
• 2TB scratch disk.

On all nodes, including Firebolt, the wrapper script /usr/local/bin/g03 will set all environment variables and ensure the proper executables and scratch directory are used. See below for more info on running Gaussian.

Gaussian uses several scratch files in the course of its computation. These include the checkpoint file (*.chk), the read-write file (*.rwf), the two-electron integral file (*.int), and the two-electron integral derivative file (*.d2e). These files can become extremely large, and because the program is accessing them constantly, I/O speed is a factor in performance.

Choosing a scratch directory can be very critical. This is done by defining the environmental variable $GAUSS_SCRDIR either immediately prior to execution or in the shell executing the program.

The default directory for scratch files on the Biowulf cluster is /gaussian (on individual nodes). Diskspace depends on the node, and varies from 20 GB to 60 GB. Because /gaussian is local to the node, this provides the fastest I/O speed for the Gaussian execution.

Scratch files will remain after completing Gaussian execution. There is no automatic mechanism to remove files from /gaussian on the nodes, and so unless the files are required for future runs, users are encouraged to include the Link0 command %NoSave at the end of input files.

When the L0 command '%chk=<filename>' is given in a Gaussian command script, and the stated checkpoint file already exists, Gaussian attempts to import the checkpoint file and begin running with data from the file. However, if the checkpoint file was generated on an architecture different than the current one (e.g., running Gaussian on a 64-bit node with a 32-bit generated checkpoint file), Gaussian execution stops abruptly with no discernable error message.

To fix this, the command gaussian_chkarch will determine the architecture on which a checkpoint file was generated. This must be run independently of the g03 command. The incompatible checkpoint file can be reformatted by using the Gaussian utilities formchk and unfchk.

Currently, this architecture check is only done on the Biowulf cluster nodes, and is limited to 32-bit to 64-bit files.

The memory requirements for a Gaussian job is dependent on the job type, the number of basis functions, and the algorithms used for integrals. In general, it is best to use as much memory as is available, but not more. Allocating more memory using the %Mem command than is available will cause the node to swap data back and forth from disk to memory, badly degrading the CPU performance.

Because the memory is shared among the all CPUs during multiprocessor jobs, each processor has access to a fraction (either 1/2 on single-core or 1/4 on dual-core) of the amount of memory when run on a single processor. Thus, the amount of memory allocated will need to be increased up to N-fold, with N equal to the number of processors available. For more information on how to calculate the amount of needed memory, see http://www.gaussian.com/g_ur/m_eff.htm.

Depending on the node, either the 32- or 64-bit version of Gaussian is run using the g03 command. However, there may be cases when checkpoint files require a single version. Because the 32-bit version of Gaussian will run on both the 32- and 64-bit nodes (although there are limitations to the 32-bit version, see above), giving the flag '-32' with the g03 command will force the 32-bit version of Gaussian to run.

Create a batch input file, e.g. 'g03run', which uses the input file 'test000.com'. for example:

Submit this job using the PBS 'qsub' command. Example:

See here for more information about PBS.

The swarm program is designed to submit a group of commands to the Biowulf cluster as batch jobs. Each command is represented by a single line in the swarm command file that you create, and runs as a separate batch job.

Create a swarm command file with each line containing a single gaussian command. For example, the file 'cmdfile' would have a single gaussian command per line:

Submit this swarm command file to the batch system with the command:

NOTE: Swarm will attempt to run one command per processor. If the gaussian job is to be run on multiple processors using the %NProcShared command, this will overload the node and cause the job to run much slower than possible. You will need to include the -n option to swarm. For example, using %NProcShared=2, you need to include -n 1 on a single-core (2CPU) node:

In this case, swarm will run one command per node. See the Swarm documentation for more information.

If you log in to Biowulf and type a command, your command will run on the main Biowulf login node. This is not recommended, for obvious reasons. If you really want to run interactively, either use one of the interactive nodes (see the user guide for more information) or allocate a node for interactive use. Once the node is allocated, you can type commands directly on the command line. Example:

To run an older version of Gaussian (e.g. D.01), include the option -D01 or -C02 in the commandline.

There are a number of utility programs available. These programs can be run both on the login node and on the cluster.

For more information, type ghelp at the prompt.

GaussView is an X11-dependent GUI for reading, writing, and submitting gaussian jobs. See here for more information about X11 on Helix Systems.

GaussView can be started by typing the command gaussview at the prompt. Please note that GaussView is not allowed on the Biowulf login node, but can be run on Helix or interactively on any of the nodes.

There are two versions of Gaussian installed for use by the cluster, the 32-bit version and the 64-bit version. The choice of executables is made automatically when using the command /usr/local/bin/g03. A job submitted to PBS on the cluster will try to find the highest performance node available, going through the hierarchy o2800 > o2200/o2600 > o2000 > p2800 > p1800. There is no automatic accounting for the job requirements of memory, diskspace, or processor speed. A job can be directed to go to specific nodes using the expanded PBS options . For example, to send the job 'g03run' to a 64-bit 2.2 GHz node with 4 GB of memory, use the command

The nodes availabe can be seen by typing the command 'freen'. Click here for more information about directing and monitoring jobs on the cluster.

While diskspace and memory is not restricted for the 64-bit version of Gaussian, they are still limited by the cluster hardware. Using the Link0 command %Mem and the MaxDisk option in the Gaussian command file may be required to prevent memory swapping or running out of diskspace. Click here for more information about memory and diskspace requirements for Gaussian.

Running the command /usr/local/bin/g03 will give, in addition to the Gaussian output, three additional pieces of information regarding the Gaussian job:

The first line tells what node the Gaussian process is running on. The second line shows whether the 32-bit or 64-bit version is being run (whether the node has the x86-64 property or not). The third and fourth lines show how much scratch space is available for the node (in this case 66GB). This information is important in deciphering any problems the job may have encountered.

Gaussian comes with a large set of test input scripts (/usr/local/gaussian03/g03/tests/com). All input scripts were run as both single- and dual-threaded jobs on 32-bit (p2800, Xeon) and 64-bit (o2200, Opteron) nodes, and the following table summarizes the output. The values in the upper right corner shows the average relative speedup (or slowdown if the value is negative) on going from one job type (the first column) to another job type. The value in the lower left corner shows the number of test runs compared. The results were partitioned into all test runs, those which ran for more than 60 seconds, more than 600 seconds, and more than 6000 seconds.

All test runs:

> 60 sec.

> 600 sec.

> 6000 sec.

Overall, the speedup efficiency on going from a single-threaded job to a dual-threaded job on a 32-bit system was between 75% and 80%. For the 64-bit system, it was between 82% and 87%.

Several of the test runs failed for all systems (test284, test421, test598, test602, and test605). These test run input files were considered incorrectly written.

A number of test runs failed with stack overflow errors when run as dual-threaded jobs on 32-bit nodes (see text files below). This may be due to the limitations of memory by the executables (see above).

Many test runs ran slower as dual-threaded jobs than as single-threaded jobs (for example test410 and test559), with the greatest slowdown being 15% (64-bit, test559).

The full results of the test runs can be downloaded as text files:

• 32-bit, single-threaded
• 32-bit, dual-threaded
• 64-bit, single-threaded
• 64-bit, dual-threaded

Gaussian is a natively multithreaded application and in general can scale from 2-4 CPU. The default version of Gaussian (E.01) is compiled with TCP Linda, which allows Gaussian to run across multiple nodes. A small number of Links (L502, L703, L914, L1002, L1110) will scale up to 32 CPU using TCP Linda.

However, not all calculation types parallelize well or at all. In fact, most run best as single-threaded processes.

The following table shows the best use of Gaussian with respect to the number of processors:

Only HF, DFT, CCSD(T), CIS, and MP2/MP4 jobs will benefit from running with a %NProcShared=4 on dual core nodes. All others should be run with %NProcShared=2 (or 1).

Gaussian errors are not always straightforward to interpret. Something as simple as a "file not found" can seem baffling and cryptic. Here is a collection of errors and their translations:

Firebolt is an SGI Altix 350 with 32 Itanium 2 processors and 96GB of memory, using an SGI NUMAlink interconnect and runs under RedHat Enterprise Linux 3. It is managed as a "fat node" of the NIH Biowulf Cluster. Gaussian jobs which require > 4GB of memory should be run on Firebolt. All other jobs should be run on the cluster.

The default scratch space for Gaussian on Firebolt is /gaussian, a local 2.2TB filesystem. Gaussian jobs must be submitted to the altix in a unique fashion, where the machine type (altix), number of processors (ncpus), and memory (4GB) must be explicitly defined:

All other PBS commands are identical to those used for managing cluster jobs. In addition, the wrapper script /usr/local/bin/g03 is equivalent as well.

Firebolt is roughly equivalent to the fastest nodes on the cluster, and in general Gaussian jobs scale well to about 4 cpus. As with all Gaussian jobs, an increase in allocated memory will accelerate performance. Here is a plot of 2-cpu (%nproc=2) benchmark jobs as compared to Firebolt:

Gaussian03 version E.01 (64-bit only) on Biowulf is compiled using TCP Linda. This allows a small subset of job types to be distributed across multiple nodes on the cluster:

• SCF and DFT energy, derivatives, and 2nd derivatives
• MP2 energy, derivatives, 2nd derivatives
• CI-Singles energy, derivatives, and 2nd derivatives
• MC-SCF energy, derivatives, and 2nd derivatives
• MP4, CCSD, CCSD(T) energy, and possibly gradient
• 1-electron properties
• Some 2nd order properties, e.g. NMR

To use TCP Linda, you need to include the L0 command %NProcLinda=#, where # is the number of nodes on which to distribute the job. You must also include the %NProcShared=# command, where # is the number of CPUs per node (%NProc and %NProcShared are synonyms). Finally, you need to specify the number of nodes needed for the Gaussian job. For example, to distribute a Gaussian run onto 16 CPUs across 8 o2800 (single-core, 2 CPU/node) nodes, the Gaussian input file would look like

and would be submitted like

See above for details about submitting to the batch system.

Keep in mind that only the processor load is distributed. The master (mother superior) node in a multi-node Linda job must have the required amount of RAM, while the worker nodes can have less. Thus, in the case of the Gaussian input

the master node must have at least 8GB of RAM. See here for a discussion of memory issues.