Project

General

Profile

Actions

Sandbox Concepts and Terminology

Concepts

Directed Acyclic Graph (DAG)

In mathematics and computer science, a Directed Acyclic Graph (DAG), is a directed graph with no directed cycles. DAGs may be used to model several different kinds of structure. By definition a DAG is a directed graph with no path that starts and ends at the same vertex.
This notion is in place in distributed processing flows and used in ESA EO toolboxes such as BEAM and NeST.
The CCBox uses the DAG to describe the science application workflow.

Terminology

Task

To exploit the parallelism offered by the framework, a job may process its input in several tasks. In principle, the framework runs the tasks in parallel within a job.
A job can then have one or more tasks.

Updated by Herve Caumont over 11 years ago · 3 revisions