Dataflow Programming Concept , Languages and Applications
@inproceedings{Sousa2012DataflowPC, title={Dataflow Programming Concept , Languages and Applications}, author={Tiago Boldt Sousa}, year={2012} }
Dataflow Programming (DFP) has been a research topic of Software Engineering since the ‘70s. The paradigm models computer programs as a direct graph, promoting the application of dataflow diagram principles to computation, opposing the more linear and classical Von Neumann model. DFP is the core to most visual programming languages, which claim to be able to provide end-user programming: with it’s visual interface, it allows non-technical users to extend or create applications without…
36 Citations
Rewriting and Code Generation for Dataflow Programs
- Computer ScienceGvD
- 2016
The focus of this paper lies on stream processing platforms and, therefore, the associated challenges, especially for two exemplary engines, are described and the internal procedure for rewriting dataflow graphs is introduced.
Dataflow Programming Using AGAPIA
- Computer Science2014 IEEE 13th International Symposium on Parallel and Distributed Computing
- 2014
This paper shows why AGAPIA language is suitable for dataflow programming, capable of expressing massive parallelism in a manageable way for programmers, allowing building dynamic nodes and links in the data flow graph at runtime.
From dataflow-based video coding tools to dedicated embedded multi-core platforms. (Depuis des outils de codage vidéo basés sur la programmation flux de données vers des plates-formes multi-coeur embarquées et dédiées)
- Computer Science
- 2013
This thesis describes a complete development environment for dataflow programming that eases multimedia development for embedded multi-core platforms and develops a set of runtime actors mapping/scheduling algorithms that enable the execution of dynamic dataflow programs over multi- core platforms with scalable performance.
Aggregate Update Problem for Multi-clocked Dataflow Languages
- Computer Science2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)
- 2022
This paper presents a novel algorithm to this so called Aggregate Update Problem for multi-clocked dataflow languages, i.e. those that allow streams to have events at disjoint timestamps via Scala code generation which combines persistent data structures and mutable data structures for those data values which allow in-place editing.
Improving reuse by means of asymmetrical model migrations: An application to the Orcc case study
- Computer Science2015 ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems (MODELS)
- 2015
A co-evolution approach is investigated to avoid this update by making the call context meet the a legacy tool definition domain by co-Evolution into data conforming to the definition domain.
Testing Environment Emulation - A Model-based Approach
- Computer ScienceMODELSWARD
- 2017
This approach allows domain experts to use a suite of domain-specific visual modeling languages to model key interface layers of applications at a high level of abstraction and is transformed into a testing runtime environment for application integration testing.
A domain-specific visual modeling language for testing environment emulation
- Computer Science2016 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)
- 2016
This paper presents a suite of domain-specific visual modeling languages to describe emulated testing enviroements at a high abstraction level and shows that these visual languages are easy to use, yet with sufficient expressive power to model complex testing applications.
TeeVML: Tool support for semi-automatic integration testing environment emulation
- Computer Science2016 31st IEEE/ACM International Conference on Automated Software Engineering (ASE)
- 2016
A novel domain-specific modeling tool to generate complex testing environments for modeling emulation environment at a high level of abstraction and is automatically transformed to runtime environment for application integration testing, boosting development productivity and ease of use.
The implementation and use of a generic dataflow behaviour in Erlang
- Computer ScienceErlang Workshop
- 2015
A new "generic" abstraction for Erlang/OTP is proposed that aids in the implementation of dataflow programming languages and models on the Erlang VM by providing a simple callback interface in the style of the gen_server and gen_fsm abstractions.
An Observational Study on the Maintainability Characteristics of the Procedural and Object-Oriented Programming Paradigms
- Business, Computer Science2020 IEEE 32nd Conference on Software Engineering Education and Training (CSEE&T)
- 2020
The observational study compares developers' effectiveness and speed performing pre-determined maintenance tasks on two equivalent variations of a web-based application: one based on Procedural Programming and one based upon Object-Oriented Programming.
References
SHOWING 1-10 OF 34 REFERENCES
A generalized scheduling approach for dynamic dataflow applications
- Computer Science2009 Design, Automation & Test in Europe Conference & Exhibition
- 2009
By decomposing a dynamic dataflow graph as directed by its modes, this work can derive a set of static dataflow graphs that interact dynamically that enables designers to readily experiment with existing dataflow model specific scheduling techniques to all or some parts of the application while applying custom schedulers to others.
The VAL Language: Description and Analysis
- Computer ScienceTOPL
- 1982
Analysis of the language shows that VAL meets the critical needs for a data flow environment, and encourages programmers to think in terms of general concurrency, enhances readability, and possesses a structure amenable to verification techniques.
ACTORS - a model of concurrent computation in distributed systems
- Computer ScienceMIT Press series in artificial intelligence
- 1985
A foundational model of concurrency is developed and issues in the design of parallel systems and why the actor model is suitable for exploiting large-scale parallelism are addressed.
The Semantics of a Simple Language for Parallel Programming
- Computer ScienceIFIP Congress
- 1974
A simple language for parallel programming is described and its mathematical properties are studied to make a case for more formal languages for systems programming and the design of operating systems.
Exploring the Concurrency of an MPEG RVC Decoder Based on Dataflow Program Analysis
- Computer ScienceIEEE Transactions on Circuits and Systems for Video Technology
- 2009
An in-depth case study on dataflow-based analysis and exploitation of parallelism in the design and implementation of a MPEG reconfigurable video coding decoder and the systematic exploitation of concurrency in CAL networks that are targeted to multicore platforms is presented.
The synchronous data flow programming language LUSTRE
- Computer Science
- 1991
The authors describe LUSTRE, a data flow synchronous language designed for programming reactive systems-such as automatic control and monitoring systems-as well as for describing hardware. The data…
Heterogeneous visual languages-integrating visual and textual programming
- Computer ScienceProceedings of Symposium on Visual Languages
- 1995
In addition to a basic framework for heterogeneous languages, this work outlines the design of a development system that allows rapid prototyping of implementations of heterogeneous Languages from the domains of logical, functional and procedural languages.
Executable UML - A Foundation for Model-Driven Architecture
- Computer ScienceAddison Wesley object technology series
- 2002
This book focuses on one aspect of MDA that the author believes to be critical: the ability to model whole subject matters completely and turn these models into systems, which relies on being able to execute models.
Constant Rate Dataflow Model with Intermediate Ports for Efficient Code Synthesis with Top-Down Design and Dynamic Behavior
- Computer ScienceISQED 2008
- 2008
It is proved that deadlock detection and buffer size computation can be performed at compile in CRDF-IP model and top-down design can be achieved by extracting a sub-actor from the top actor.