Difference between revisions of "Gaussian"

From UFRC
Jump to navigation Jump to search
Line 54: Line 54:
 
<!--Run-->
 
<!--Run-->
 
{{#if: {{#var: exe}}|==Additional Information==
 
{{#if: {{#var: exe}}|==Additional Information==
WRITE_ADDITIONAL_INSTRUCTIONS_ON_RUNNING_THE_SOFTWARE_IF_NECESSARY
+
On HPC systems, Gaussian can be run in two ways:
 +
* Using Galaxy framework
 +
Please refer to [[Galaxy]] for more information on the usage.
 +
 
 +
* Using job scheduler to submit PBS jobs
 
|}}
 
|}}
 
<!--PBS scripts-->
 
<!--PBS scripts-->

Revision as of 16:27, 19 September 2012

Description

gaussian website  
Gaussian 09 is the latest in the Gaussian series of electronic structure programs. Gaussian 09 is used by chemists, chemical engineers, biochemists, physicists and others for research in established and emerging areas of chemical interest. Starting from the basic laws of quantum mechanics, Gaussian predicts the energies, molecular structures, and vibrational frequencies of molecular systems, along with numerous molecular properties derived from these basic computation types. It can be used to study molecules and reactions under a wide range of conditions, including both stable species and compounds which are difficult or impossible to observe experimentally such as short-lived intermediates and transition structures. This article introduces several of its new and enhanced features.

Gaussian License

Please note that Gaussian is restricted software. Users who intend to use it must sign the Gaussian Confidentiality Agreement. This form is available in NPB 2238. You may come by during office hours and sign the agreement. Once the form is signed, you will be added to the "gaussian" user group and will have access to the software. See Gaussian License.

Required Modules for g09 and gview (GaussView)

modules documentation

Serial

  • gaussian

Parallel (Shared memory with OpenMP)

  • gaussian

System Variables

  • HPC_{{#uppercase:gaussian}}_DIR
  • GV_DIR
  • g09root


Additional Information

On HPC systems, Gaussian can be run in two ways:

  • Using Galaxy framework

Please refer to Galaxy for more information on the usage.

  • Using job scheduler to submit PBS jobs

PBS Script Examples

Please note that our version of Gaussian only supports shared-memory parallelism. This means that if you want to use more than one processor for a Gaussian job, you are limited to the number of processors in a single machine. You cannot run Gaussian 09 across multiple machines on the HPC Center cluster.

This forces you to a resource request of the form

#PBS -l nodes=1:ppn=<N>  

where N is the number of processors and is constrained as follows:

PhaseII:  N<=4
PhaseIII: N<=8
PhaseIV:  N<=12
PhaseV:   N<=16

PhaseII through PhaseV refer to the set of machines we purchased during certain time period. 
The larger N you request, the more restricted your job will be in terms of resource availability.

See the Gaussian_PBS page for gaussian PBS script examples.


Citation

If you publish research that uses gaussian you have to cite it as follows:

Gaussian 09, Revision A.1, M. J. Frisch, G. W. Trucks, H. B. Schlegel, G. E. Scuseria, M. A. Robb, J. R. Cheeseman, G. Scalmani, V. Barone, B. Mennucci, G. A. Petersson, H. Nakatsuji, M. Caricato, X. Li, H. P. Hratchian, A. F. Izmaylov, J. Bloino, G. Zheng, J. L. Sonnenberg, M. Hada, M. Ehara, K. Toyota, R. Fukuda, J. Hasegawa, M. Ishida, T. Nakajima, Y. Honda, O. Kitao, H. Nakai, T. Vreven, J. A. Montgomery, Jr., J. E. Peralta, F. Ogliaro, M. Bearpark, J. J. Heyd, E. Brothers, K. N. Kudin, V. N. Staroverov, R. Kobayashi, J. Normand, K. Raghavachari, A. Rendell, J. C. Burant, S. S. Iyengar, J. Tomasi, M. Cossi, N. Rega, J. M. Millam, M. Klene, J. E. Knox, J. B. Cross, V. Bakken, C. Adamo, J. Jaramillo, R. Gomperts, R. E. Stratmann, O. Yazyev, A. J. Austin, R. Cammi, C. Pomelli, J. W. Ochterski, R. L. Martin, K. Morokuma, V. G. Zakrzewski, G. A. Voth, P. Salvador, J. J. Dannenberg, S. Dapprich, A. D. Daniels, Ö. Farkas, J. B. Foresman, J. V. Ortiz, J. Cioslowski, and D. J. Fox, Gaussian, Inc., Wallingford CT, 2009.