Minimising buffer requirements of synchronous dataflow graphs with model checking

Proceedings - Design Automation Conference

Volumn , Issue , 2005, Pages 819-824

  Geilen, Marc ^a   Basten, Twan ^a   Stuijk, Sander ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Buffering; Model checking; Optimization; Synchronous Dataflow

Indexed keywords

DATA FLOW ANALYSIS; EMBEDDED SYSTEMS; HEURISTIC METHODS; MATHEMATICAL MODELS; MULTIMEDIA SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

BUFFERING; MODEL-CHECKING; SYNCHRONOUS DATAFLOW;

GRAPH THEORY;

EID: 27944434745     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/dac.2005.193928     Document Type: Conference Paper

References (18)

1. M. Adé, R. Lauwereins, and J. A. Peperstraete. Data memory minimisation for synchronous data flow graphs emulated on dsp-fpga targets. In Proc. 34th DAC, pages 64-69, 1997. ACM Press.
2. K. Altisen, G. Gößler, and J. Sifakis. A methodology for the construction of scheduled systems. In Proc. FTRTFT 2000, pages 106-120. Springer, 2000.
3. T. Amnell, E. Fersman, L. Mokrushin, P. Pettersson, and W. Yi. Times: a tool for schedulability analysis and code generation of real-time systems. In Proc. of FORMATS'03, number 2791 in LNCS, pages 60-72. Springer-Verlag, 2004.
4. S.S. Bhattacharyya, P.K. Murthy, and E.A. Lee. Software Synthesis from Dataflow Graphs. Kluwer, 1996.
5. S.S. Bhattacharyya, P.K. Murthy, E.A. Lee. Synthesis of embedded software from synchronous dataflow specifications. VLSI Sig. Proc. Syst., 21(2):151-166, 1999.
6. J.T. Buck. Scheduling Dynamic Dataflow Graphs with Bounded Memory Using the Token Flow Model. PhD thesis, University of California, EECS Dept., Berkeley, CA, 1993.
7. S. Goddard and K. Jeffray. Managing memory requirements in the synthesis of real-time systems from processing graphs. In Proc. 4th IEEE Real-Time Technology and Applications Symp., June 1998, pages 59-70, 1998.
8. R. Govindarajan, G.R. Gao, and P. Desai. Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks. J. of VLSI Sig. Proc., 31:207-229, 2002.
9. G.J. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison Wesley, 2004.
10. E.A. Lee and D.G. Messerschmitt. Synchronous data flow. IEEE Proceedings, 75(9):1235-1245, September 1987.
11. P. K. Murthy. Scheduling Techniques for Synchronous and Multidimensional Synchronous Dataflow. PhD thesis, University of California, Berkeley, December 1996.
12. P. K. Murthy and S. S. Bhattacharyya. Shared memory implementations of synchronous dataflow specifications. In Proc. DATE, March 2000. Paris, France, pages 404-410. IEEE Computer Society Press, 2000.
13. H. Oh and S. Ha. Efficient code synthesis from extended dataflow graphs for multimedia applications. In Proc. 39th DAC, 2002, New Orleans, LA, USA, pages 275-280. IEEE Computer Society, June 2002.
14. P. Poplavko, T. Basten, M. Bekooij, J. van Meerbergen, and B. Mesman. Task-level timing models for guaranteed performance in multiprocessor networks-on-chip. In Proc. of CASES 2003, pages 63 - 72, IEEE CS Press , 2003.
15. A. Roychoudhury, T. Mitra, and S. R. Karri. Formal verification of a system-on-chip bus protocol. In Proc. of DATE 2003, Munich, Germany, IEEE CS Press, 2003.
16. S.K. Shukla and R.K. Gupta. A model checking approach to evaluating system level dynamic power management policies for embedded systems. In Proc. HLDVT'01, pages 53-57. IEEE Comp. Soc., 2001.
17. W. Sung, J. Kim, and S. Ha. Memory efficient software synthesis from dataflow graph. In Proc. ISSS '98, pages 137-144. IEEE Computer Society, 1998.
18. M. Cubrić and P. Panangaden. Minimal memory schedules for dataflow networks. In Proc. CONCUR'93, LNCS Vol. 715, Springer, 1993.