Managing parameter access in a task managing system
A number of tasks are defined according to a dependency graph. Multiple parameter contexts are maintained, each associated with a different scope of the tasks. A parameter used in a first of the tasks is bound to a value. This binding includes identifying a first of the contexts according to the dependency graph and retrieving the value for the parameter from the identified context.
1. A computer-implemented method for checking parameter access including:
accepting, by a computer system, a specification of an ordering constraint for a plurality of tasks, in which at least some of the tasks are not ordered relative to one another;
for each of one or more parameters, identifying, by the computer system, the tasks that access those parameters; and
checking, by the computer system, for potential conflict in the access to the parameters by the identified tasks according to the specification of the ordering constraint, including determining scopes of instances of one of the parameters, determining whether a plurality of the scopes include a task that references the parameter, and identifying the referenced parameter as an ambiguous parameter if a plurality of the scopes include the task that references the parameter.
2. The method of claim 1 wherein accepting the specification of the ordering constraint includes accepting a specification of a dependency graph.
3. The method of claim 1 wherein identifying the tasks that access a parameter includes processing declarations for the tasks.
4. Software stored on a non-transitory medium including instructions for causing a computer system to:
accept a specification of an ordering constraint for a plurality of tasks, in which at least some of the tasks are not ordered relative to one another;
for each of one or more parameters, identify the tasks that access those parameters; and
check for potential conflict in the access to the parameters by the identified tasks according to the specification of the ordering constraint, including determining scopes of instances of one of the parameters, determining whether a plurality of the scopes include a task that references the parameter, and identifying the referenced parameter as an ambiguous parameter if a plurality of the scopes include the task that references the parameter.
5. The software of claim 4 wherein accepting the specification of the ordering constraint includes accepting a specification of a dependency graph.
6. The software of claim 4 wherein identifying the tasks that access a parameter includes processing declarations for the tasks.
7. A task managing system including:
at least one storage system;
at least one input device or port configured to accept into the storage system a specification of an ordering constraint for a plurality of tasks, in which at least some of the tasks are not ordered relative to one another; and
a task manager static checking module including at least one processor, having access to the specification, configured to
for each of one or more parameters, identify the tasks that access those parameters; and
check for potential conflict in the access to the parameters by the identified tasks according to the specification of the ordering constraint, including determining scopes of instances of one of the parameters, determining whether a plurality of the scopes include a task that references the parameter, and identifying the referenced parameter as an ambiguous parameter if a plurality of the scopes include the task that references the parameter.
8. The system of claim 7 wherein accepting the specification of the ordering constraint includes accepting a specification of a dependency graph.
9. The system of claim 7 wherein identifying the tasks that access a parameter includes processing declarations for the tasks.