Digital Signal Processing Reference
In-Depth Information
several models of computation, which are able to integrate static dataflow with
a dynamic dataflow environment while still preserving the analyzability of the
static parts of the dataflow graph. The usage of
finite state machines
has proven
invaluable for the coordination between the static and the dynamic parts within
dataflow graphs. As an example for such a coordination, we presented quasi-static
scheduling, which reduces the scheduling overhead for one processor of an MPSoC
while still accommodating a worst-case environment of the cluster.
References
1. Baird, M. (ed.): IEEE Standard 1666-2005 SystemC Language Reference Manual. IEEE
Standards Association, New Jersey, USA (2005)
2. Balarin, F., Giusto, P., Jurecska, A., Passerone, C., Sentovich, E., Tabbara, B., Chiodo, M.,
Hsieh, H., Lavagno, L., Sangiovanni-Vincentelli, A., Suzuki, K.: Hardware-Software Co-
Design of Embedded Systems: The POLIS Approach. Kluwer Academic Publishers (1997)
3. Bhattacharya, B., Bhattacharyya, S.: Parameterized dataflow modeling for DSP systems. Signal
Processing, IEEE Transactions on
49
(10), 2408-2421 (2001)
4. Bhattacharyya, S., Brebner, G., Eker, J., Mattavelli, M., Raulet, M.: OpenDF - A dataflow
toolset for reconfigurable hardware and multicore systems (2008). First Swedish Workshop on
Multi-Core Computing, MCC, Ronneby, Sweden, November 27-28, 2008
5. Bhattacharyya, S.S., Buck, J.T., Ha, S., Lee, E.A.: Generating compact code from dataflow
specifications of multirate signal processing algorithms. IEEE Transactions on Circuits and
Systems I: Fundamental Theory and Applications
42
(3), 138-150 (1995)
6. Bhattacharyya, S.S., Deprettere, E.F., Theelen, B.: Dynamic dataflow graphs. In: S.S. Bhat-
tacharyya, E.F. Deprettere, R. Leupers, J. Takala (eds.) Handbook of Signal Processing
Systems, second edn. Springer (2013)
7. Bilsen, G., Engels, M., Lauwereins, R., Peperstraete, J.: Cyclo-static dataflow. IEEE Transac-
tion on Signal Processing
44
(2), 397-408 (1996)
8. Buck, J., Ha, S., Lee, E.A., Messerschmitt, D.G.: Ptolemy: A framework for simulating
and prototyping heterogenous systems. International Journal in Computer Simulation
4
(2),
155-182 (1994)
9. Buck, J.T.: Scheduling dynamic dataflow graphs with bounded memory using the token flow
model. Ph.D. thesis, Dept. of EECS, UC Berkeley, Berkeley, CA 94720, U.S.A. (1993)
10. Dennis, J.B.: First version of a data flow procedure language. In: Programming Symposium,
Proceedings Colloque sur la Programmation, pp. 362-376. Springer-Verlag, London, UK
(1974)
11. Eker, J., Janneck, J.W.: CAL language report - language version 1.0. Tech. rep., University of
California at Berkeley (2003)
12. Eker, J., Janneck, J.W., Lee, E.A., Liu, J., Liu, X., Ludvig, J., Neuendorffer, S., Sachs, S.,
Xiong, Y.: Taming heterogeneity - the Ptolemy approach. Proceedings of the IEEE
91
(1),
127-144 (2003)
13. Falk, J., Haubelt, C., Teich, J.: Efficient representation and simulation of model-based designs
in SystemC. In: Proc. FDL'06, Forum on Design Languages 2006, pp. 129-134. Darmstadt,
Germany (2006)
14. Falk, J., Keinert, J., Haubelt, C., Teich, J., Bhattacharyya, S.: A generalized static data flow
clustering algorithm for MPSoC scheduling of multimedia applications. In: EMSOFT'08:
Proceedings of the 8th ACM international conference on Embedded software (2008)
