PERF: SGE Graph submission was potentially very inefficient

Given an experiment where we have a simple 3 node workflow that we
wish to run independantly on 4 subjects, we would expect the following
dependancies (where dependancies are given in parenthesis:

S1         S2         S3         S4
J1         J1         J1         J1
J2(S1.J1)  J2(S2.J1)  J2(S3.J1)  J2(S4.J1)
J3(S1.J2)  J3(S2.J2)  J3(S3.J2)  J3(S4.J2)

The problem is that the dependancies were created based on the
assumption that job names are unique, and we subsequently rsulted in the following dependances:

S1         S2               S3                     S4
J1         J1               J1                     J1
J2(S1.J1)  J2(S1.J1,S2.J1)  J2(S1.J1,S2.J2,S3.J1)  J2(S1.J1,S2.J2,S3.J1,S4.J1)
J3(S1.J2)  J3(S1.J1,S2.J2)  J3(S1.J2,S2.J2,S3.J2)  J3(S1.J1,S2.J2,S3.J1,S4.J2)

As the number of subjects grew, the interdependancies grew, and it
enforced unnecessary constraints on when subsequent jobs could be run.

In order to overcome this problem, job dependencies are now created based on the
unique jobid's that are during qsub job submission, rather than the a-priori
known (but often duplicated) job name.

The effective changes to the "submit_jobs.sh" file are:

<<<<<<<<
  #!/usr/bin/env bash
- job00000=$(qsub                       -N job00000 /tmp/batch/node1.sh)
- job00001=$(qsub -hold_jid job00000    -N job00001 /tmp/batch/node2.sh)
================
  #!/usr/bin/env bash
+ job00000=$(qsub                       -N job00000 /tmp/batch/node1.sh | awk '{print $3}')
+ job00001=$(qsub -hold_jid ${job00000} -N job00001 /tmp/batch/node2.sh | awk '{print $3}')
>>>>>>>>

NOTE:  In the second case, we can gaurantee uniqueness of tje dependancies no matter
how many subjects are simultaneously run!
Merge pull request #881 from nipy/FixSGEGraphDependancyBug

PERF: SGE Graph submission was potentially very inefficient