Supporting stateful tasks in a dataflow graph
Tipus de documentText en actes de congrés
EditorAssociation for Computing Machinery (ACM)
Condicions d'accésAccés restringit per política de l'editorial
This paper introduces Atomic Dataflow Model (ADF) - a programming model for shared-memory systems that combines aspects of dataflow programming with the use of explicitly mutable state. The model provides language constructs that allow a programmer to delineate a program into a set of tasks and to explicitly define input data for each task. This information is conveyed to the ADF runtime system which constructs the task dependency graph and builds the necessary infrastructure for dataflow execution. However, the key aspect of the proposed model is that it does not require the programmer to specify all of the task’s dependencies exp licitly, but only those that imply logical ordering between tasks. The ADF model manages the remainder of inter-task dependencies automatically, by executing the body of the task within an implicit memory transaction. This provides an easy- to -program optimistic concurrency substrate and enables a task to safely share data with other concurrent tasks. In this paper, we describe the ADF model and show how it can increase the programmability of shared memory systems.
CitacióGajinov, V. [et al.]. Supporting stateful tasks in a dataflow graph. A: International Conference on Parallel Architectures and Compilation Techniques. "21st International Conference on Parallel Architectures and Compilation Techniques 2012: proceedings: September 19-23, 2012: Minneapolis, MN, USA". Minneapolis: Association for Computing Machinery (ACM), 2012, p. 435-436.
Versió de l'editorhttp://dl.acm.org/citation.cfm?id=2370883
|Supporting Stateful Tasks in a Dataflow Graph.pdf||Supporting Stateful Tasks in a Dataflow Graph||719.1Kb||Accés restringit|