#Coin tick version 2.17 code#

Peperstraete, Data memory minimisation for synchronous data flow graphs emulated on DSP-FPGA targets, in Proceedings of Design Automation Conference (DAC’97), Anaheim, June 1997 Bhattacharyya, Shared buffer implementations of signal processing systems using lifetime analysis techniques.

#Coin tick version 2.17 code#

Bjorklund, Efficient code synthesis from synchronous dataflow graphs, in Proceedings of Formal Methods and Models for Co-Design (MEMOCODE’04), June 2004 Basten, Minimising buffer requirements of synchronous dataflow graphs with model checking, in Proceedings of Design Automation Conference (DAC’05), New York, June 2005ĭ. Basten, Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs, in Proceedings of Design Automation Conference (DAC ’06), San Francisco, July 2006 Ha, Memory optimal single appearance schedule with dynamic loop count for synchronous dataflow graphs, in Proceedings of Asia and South Pacific Design Automation Conference (ASP-DAC’06), Yokohama City, Jan 2006 Ha, Extended synchronous dataflow for efficient DSP system prototyping, in Proceedings on Workshop in Rapid System Prototyping, Clearwater, June 1999 Lee, Multidimensional synchronous dataflow. Bhattacharyya, Parameterized dataflow modeling for DSP systems.

dissertation, Technical Report UCB/ERL 93/69, Department of EECS, University of California, Berkeley 1993ī. Buck, Scheduling dynamic dataflow graphs with bounded memory using the token flow model. Messerschmitt, Static scheduling of synchronous data flow programs for digital signal processing. MacQueen, Coroutines and networks of parallel processes, in Proceedings of the IFIP Congress 1977, North-Holland, Aug 1977, pp. dissertation, Technical Report UCB/ERL 95/105, Department of EECS, University of California, Berkeley, 1995 Parks, Bounded scheduling of process networks. Priestley, Introduction to Lattices and Order (Cambridge University Press, Cambridge, 1990) Kahn, The semantics of a simple language for parallel programming, in Proceedings of IFIP Congress 1974, Stockholm, Aug 1974, pp. Remond, Argos: an automaton-based synchronous language. Harel, Statecharts: a visual formalism for complex systems. Eker et al., Taming heterogeneity – the ptolemy approach.

Le Maire, Programming real-time applications with SIGNAL. Pilaud, The synchronous data flow programming language LUSTRE. Gonthier, The Esterel synchronous programming language: design, semantics, implementation. Milner, Communication and Concurrency (Prentice-Hall, Englewood Cliffs, 1989) Hoare, Communicating sequential processes. Murata, Petri nets: properties, analysis, and applications. Berry, The synchronous approach to reactive and real-time systems. Cassandras, Introduction to Discrete Event Systems (Kluwer, Dordrecht/Boston, 1999)Į.A. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley Publishing Company, Reading, 1979)Ĭ.G. Neuendorffer, Concurrent models of computation for embedded software. This process is experimental and the keywords may be updated as the learning algorithm improves.Į.A. These keywords were added by machine and not by the authors. But as soon as it is expressed with a simple graphical syntax consisting of a network of blocks connected with arrows, it is not incorrect to call it a language. For example, synchronous dataflow (SDF) is usually thought of as a model of computation. However, when a model of computation is expressed with a simple syntax, it can also be called a language. A model of computation is commonly used for defining the semantics of a language. Thus, the topics in this section are not divided strictly to either models of computation or languages. We do not attempt to draw sharp distinctions between models and languages. This chapter looks at several important models of computation and languages for embedded systems design.