|
||||||||||||
|
Dyrect Acyclic Graphs (DAG) JobsA DAG (directed acyclic graph) represents a set of jobs where the input, output, or execution of one or more jobs depends on one or more other jobs. The jobs are nodes (vertices) in the graph and the edges (arcs) identify the dependencies. Although not requiring a great number of new attributes, the structure of the JDL description for a DAG differs significantly from the one for a job and it is more complex. Due to this we start by providing an example of DAG description so that the structure of the JDL in this case is clear from the beginning. The new attributes and the slight differences in the semantic for some of the known ones will be highlighted in the text. It is important to note that upon submission of a DAG, besides the identifier associated with each node, the WMS assigns also to the DAG itself an identifier that has to be used as the handle for monitoring and controlling the whole DAG. |
|||||||||||
|
|
||||||||||||