[CSC 435] Playing Fairly in the Queues

[Andrew J. Pounds]

So let's talk about queue etiquette.  While it may be easier for you to 
build a job like this...

#PBS -N JACOBI_TEST
#PBS -m abe
#PBS -j oe
#PBS -l nodes=1:hammer:ppn=42,walltime=10:00:00
#
cd $HOME/jacobirepo
jacobi
jacobi
jacobi
jacobi
jacobi
jacobi
jacobi
jacobi
jacobi
jacobi

to get multiple timings, this could potentially block the queue for, in 
this case, up to 10 hours.   If you know that that your job will run for 
a while, it is generally much more considerate (and often required at 
supercomputing installations) to build each job to handle one 
calculation with a maximum time limit that is not egregiously long.  For 
example I would rewrite the above as

#PBS -N JACOBI_TEST
#PBS -m abe
#PBS -j oe
#PBS -l nodes=1:hammer:ppn=42,walltime=30:00
#
cd $HOME/jacobirepo
jacobi

And then submit ten of them.   Each job should return a log file with 
the output.  If there are multiple users in the queue the "fair share" 
scheduler will then allow the queue to be shared equitably.

Once your tests are complete you can then "cat" the output files and 
"grep" for the times.


-- 
*Andrew J. Pounds, Ph.D.*
/Professor of Chemistry and Computer Science/
/Director of the Computational Science Program/
/Mercer University, Macon, GA, 31207 (478) 301-5627 /
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://theochem.mercer.edu/pipermail/csc435/attachments/20240301/4886f7c6/attachment.html>