Types and programming languages
Types and programming languages
Scientific workflow management and the Kepler system: Research Articles
Concurrency and Computation: Practice & Experience - Workflow in Grid Systems
Pegasus: A framework for mapping complex scientific workflows onto distributed systems
Scientific Programming
Dryad: distributed data-parallel programs from sequential building blocks
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Taverna Workflows: Syntax and Semantics
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
Pig latin: a not-so-foreign language for data processing
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Workflows and e-Science: An overview of workflow system features and capabilities
Future Generation Computer Systems
A formal semantics for the Taverna 2 workflow model
Journal of Computer and System Sciences
Workflows to open provenance graphs, round-trip
Future Generation Computer Systems
Provenance collection support in the kepler scientific workflow system
IPAW'06 Proceedings of the 2006 international conference on Provenance and Annotation of Data
Hadoop: The Definitive Guide
Swift: A language for distributed parallel scripting
Parallel Computing
Hierarchical models of provenance
TaPP'12 Proceedings of the 4th USENIX conference on Theory and Practice of Provenance
Data-intensive architecture for scientific knowledge discovery
Distributed and Parallel Databases
Provenance for seismological processing pipelines in a distributed streaming workflow
Proceedings of the Joint EDBT/ICDT 2013 Workshops
The Data Bonanza: Improving Knowledge Discovery in Science, Engineering, and Business
The Data Bonanza: Improving Knowledge Discovery in Science, Engineering, and Business
Hi-index | 0.00 |
Dispel is a scripting language for constructing workflow graph which can then be executed by some other computational infrastructure. It facilitates construction of abstract components (called Processing Elements, or PEs) that can be instantiated in different ways to produce a concrete, executable workflow. In this paper, we present a formal semantics for Dispel that explains its key features, particularly definition and use of composite PEs. We also develop an alternative semantics of Dispel programs that constructs a workflow enriched with PEs that can record provenance for the original workflow. The semantics is work in progress that will inform future development of Dispel and of provenance management techniques for Dispel.