Mailing List Archives
Authenticated access
|
|
|
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Condor-users] inspiration for DAGMan syntax
- Date: Thu, 01 Apr 2010 10:42:17 -0400
- From: Ian Stokes-Rees <ijstokes@xxxxxxxxxxxxxxxxxxx>
- Subject: [Condor-users] inspiration for DAGMan syntax
I have a DAG with 10k almost identical entries
JOB 3cb5-00933 ../.dag/3cb5.ca
VARS 3cb5-00933 varJobName="3cb5-00933" \
varArgs="-t 5400 -W
http://abitibi.sbgrid.org/~webportal/osg/3cb5.mtz -n 3cb5 -O
3cb5-00933.output.zip -O 3cb5-00933.results.dat -O
3cb5-00933.summary.html -t 21680 -n 3cb5-00933 -r 3cb5-00933"
\ varTimeout="21680" \
varOutput="3cb5-00933.out" \
varError="3cb5-00933.err" \
varInFiles="3cb5-00933" \
varOutFiles="3cb5-00933.output.zip,3cb5-00933.results.dat,3cb5-00933.summary.html"
RETRY 3cb5-00933 7
SCRIPT POST 3cb5-00933 ./process_output 3cb5-00933 $JOBID
I could reduce my DAG file by 20k lines (well, 20k - 2) if it were
possible to do:
RETRY * 7
SCRIPT POST * ./process_output $JOB $JOBID
and DAGMan would notice that the node name contained a regular
expression and then apply the statement to all DAG nodes it matched.
There would, of course, be some subtle implementation details to work
out (ordering/precedence of statements, interaction with other RE or
non-RE statements, etc.), but I could imagine that something basic could
be achieved without a huge amount of work.
Ian
begin:vcard
fn:Ian Stokes-Rees, PhD
n:Stokes-Rees;Ian
org:Harvard Medical School;Biological Chemistry and Molecular Pharmacology
adr;dom:;;250 Longwood Ave;Boston;MA;02115
email;internet:ijstokes@xxxxxxxxxxxxxxxxxxx
title:Research Associate, Sliz Lab
tel;work:+1 617 432-5608 x75
tel;fax:+1 617 432-5600
tel;cell:+1 617 331-5993
url:http://hkl.hms.harvard.edu
version:2.1
end:vcard