Software synthesis from dataflow models for G and LabVIEW/sup TM/

@article{Andrade1998SoftwareSF,
  title={Software synthesis from dataflow models for G and LabVIEW/sup TM/},
  author={Hugo A. Andrade and S. N. Kovner},
  journal={Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)},
  year={1998},
  volume={2},
  pages={1705-1709 vol.2}
}
  • H. Andrade, S. Kovner
  • Published 1 November 1998
  • Computer Science
  • Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)
The "G" language (in LabVIEW/sup TM/) allows the user to describe a program with a dataflow representation. Our goal is to apply the techniques and concepts of the current dataflow research towards the adaptation of G and LabVIEW/sup TM/ for embedded software development. G is a homogeneous, multidimensional, dynamic dataflow language. G uses "structured dataflow" semantics to specify high level concepts (e.g. loops). We examine G in the context of other models of computation, such as… Expand
Serialized parallel code generation framework for MPSoC
TLDR
This article extends the previous code serialization techniques to multiprocessor systems and utilize the formal properties of the dataflow model for efficient code generation and uses OpenMP directives to express data parallelism inside a task. Expand
A Rapid Prototyping Tool for Embedded, Real-Time Hierarchical Control Systems
TLDR
This paper describes the development of a state-of-the-art embedded motion control system using LabVIEW as the specification, simulation and implementation tool, using the proposed design principles, and the solution is state- of- the-art in terms of flexibility and control performance. Expand
Specification and Compilation of Real-Time Stream Processing Applications
TLDR
A novel hierarchical programming language and compiler is presented for the specification and compilation of real-time stream processing applications that satisfy the aforementioned requirements and can be used to automatically explore different optimizations opportunities and to make a trade-off between the throughput, latency and memory requirements of applications. Expand
Dataflow Integration and Simulation Techniques for DSP System Design Tools
TLDR
A novel framework that centers around the dataflow interchange format (DIF) for helping DSP system designers to integrate the diversity of dataflow models, techniques, design tools, DSP libraries, and embedded processing platforms is developed. Expand
Node prefetch prediction in dataflow graphs
TLDR
A lightweight call prediction unit with 100% prediction accuracy given a runtime-determined periodic calling schedule is presented and a 33% speedup in a filtering application possible in wireless ad hoc networks is shown. Expand
Adaptive streaming applications : analysis and implementation models
TLDR
The Parameterized Polyhedral Process Network (P3N) MoC has been developed to model adaptive streaming applications with parameter reconfiguration and implementation of the P3N MoC on a MPSoC platform has shown that run-time performance penalty due to parameter reconfigurement is negligible. Expand
Serialized multitasking code generation from dataflow specification
  • Seongnam Kwon, S. Ha
  • Computer Science
  • 2008 IEEE/ACM/IFIP Workshop on Embedded Systems for Real-Time Multimedia
  • 2008
TLDR
A serialized multitasking code generation technique from dataflow specification is proposed to run the multitasking application without OS on any target processor to reduce runtime overhead of task switching. Expand
Hierarchical Programming Language for Modal Multi-rate Real-Time Stream Processing Applications
TLDR
A programming language is proposed by which a sequential specification of the behavior of an application can be nested in a concurrent specification and it is shown that the CTA model can be used despite the presence of control statements and that the composition of black-box components is possible. Expand
Introduction: Modeling, Analysis and Synthesis of Embedded Software and Systems
TLDR
A synthesis path, with the methods and tools to generate a (provably correct) software or hardware implementation of a model is a necessary complement to the use of an analyzable modeling language, to improve efficiency, but to avoid the introduction of unwanted errors when the model is refined into its implementation. Expand
Automatic Configurable Hardware Code Generation for Software-Defined Radios
TLDR
This paper presents a methodology for automated and behavioral integration of dedicated IP cores for rapid prototyping of SDR applications that integrates IP cores using characteristics of the dataflow model of computation (MoC), namely the static dataflow with access patterns (SDF-AP). Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 14 REFERENCES
Dataflow process networks
TLDR
Dataflow process networks are shown to be a special case of Kahn process networks, a model of computation where a number of concurrent processes communicate through unidirectional FIFO channels, where writes to the channel are nonblocking, and reads are blocking. Expand
Dataflow architectures and multithreading
TLDR
Multithreading offers a viable alternative for building hybrid architectures that exploit parallelism and more research is still needed to develop compilers for conventional languages that can produce parallel code comparable to that of parallel functional languages. Expand
Software Synthesis from Dataflow Graphs
TLDR
Software Synthesis from Dataflow Graphs reviews the state-of-the-art in constructing static, memory-optimal schedules for programs expressed as SDF graphs and presents a uniprocessor scheduling framework that provably synthesizes the most compact looping structures, called single appearance schedules, for a certain class of SDF graph. Expand
Cycle-static dataflow
TLDR
The CSDF paradigm is an extension of synchronous dataflow that still allows for static scheduling and, thus, a very efficient implementation of an application and it is indicated that CSDF is essential for modelling prescheduled components, like application-specific integrated circuits. Expand
A comparison of synchronous and cycle-static dataflow
  • T. Parks, J. Pino, E. Lee
  • Computer Science
  • Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers
  • 1995
TLDR
It is shown how higher-order functions can be used to transform a CSDF graph into a SDF graph, simplifying the scheduling problem and making it possible to eliminate unnecessary computations and expose additional parallelism. Expand
The processing graph method tool (PGMT)
  • R. S. Stevens
  • Computer Science
  • Proceedings IEEE International Conference on Application-Specific Systems, Architectures and Processors
  • 1997
TLDR
The PGMT project at NRL is developing a tool set that will facilitate the implementation of PGM on a given distributed architecture at relatively low cost, and the major features PGM are described and discussed. Expand
A Hybrid Scheme for Processing Data Structures in a Dataflow Environment
TLDR
The paper introduces a new model for handling data structures in a dataflow environment that combines constant time access capabilities of vectors as well as the flexibility inherent in the concept of pointers to optimize the storage and processing overhead incurred during the operations on data structures. Expand
Compile-time scheduling of dynamic constructs in dataflow program graphs
TLDR
Decisions on the profiles of dynamic constructs within a macro actor, such as a conditional and a data-dependent iteration, are shown to be optimal under some bold assumptions, and expected to be near-optimal in most cases. Expand
An introduction to the processing graph method
  • David J. Kaplan
  • Computer Science
  • Proceedings International Conference and Workshop on Engineering of Computer-Based Systems
  • 1997
TLDR
This work gives the reader the flavor of this approach to PGM by providing a description of an application; illustrating how that application is represented; showing typical results obtained by running the application; providing a short description of the atoms that are used to build the application'; and provides a short discussion of the technical issues to which PGM must respond. Expand
Elements of the Theory of Computation
TLDR
Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book, each section is followed by problems. Expand
...
1
2
...