The Community for Technology Leaders
RSS Icon
Issue No.10 - October (2008 vol.57)
pp: 1331-1345
Sander Stuijk , Eindhoven University of Technology, Eindhoven
Marc Geilen , Eindhoven University of Technology, Eindhoven
Twan Basten , Eindhoven University of Technology, Eindhoven
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute intensive kernels of these applications are often specified as Cyclo-Static or Synchronous Dataflow Graphs. Communication between nodes in these graphs requires storage space which influences throughput. We present an exact technique to chart the Pareto space of throughput and storage trade-offs, which can be used to determine the minimal buffer space needed to execute a graph under a given throughput constraint. The feasibility of the exact technique is demonstrated with experiments on a set of realistic DSP and multimedia applications. To increase scalability of the approach, a fast approximation technique is developed that guarantees both throughput and a, tight, bound on the maximal overestimation of buffer requirements. The approximation technique allows to trade off worst-case overestimation versus run-time.
Special-Purpose and Application-Based Systems, Analysis
Sander Stuijk, Marc Geilen, Twan Basten, "Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs", IEEE Transactions on Computers, vol.57, no. 10, pp. 1331-1345, October 2008, doi:10.1109/TC.2008.58
[1] G. Bilsen, M. Engels, R. Lauwereins, and J. Peperstraete, “Cyclo-Static Dataflow,” IEEE Trans. Signal Processing, vol. 44, no. 2, pp.397-408, Feb. 1996.
[2] E. Lee and D. Messerschmitt, “Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing,” IEEE Trans. Computers, vol. 36, no. 1, pp. 24-35, Jan. 1987.
[3] S. Bhattacharyya, P. Murthy, and E. Lee, “Synthesis of Embedded Software from Synchronous Dataflow Specifications,” J. VLSI Signal Processing Systems, vol. 21, no. 2, pp. 151-166, June 1999.
[4] K. Denolf, A. Chirila-Rus, P. Schumacher, R. Turney, K. Vissers, D. Verkest, and H. Corporaal, “A Systematic Approach to Design Low-Power Video Codec Cores,” EURASIP J. Embedded Systems, vol. 2007, no. 3, pp. 1-14, Mar. 2007.
[5] P. Poplavko, T. Basten, M. Bekooij, J. van Meerbergen, and B. Mesman, “Task-Level Timing Models for Guaranteed Performance in Multiprocessor Networks-on-Chip,” Proc. Sixth Int'l Conf. Compilers, Architecture, and Synthesis for Embedded Systems, pp. 63-72, 2003.
[6] S. Ritz, M. Willems, and H. Meyr, “Scheduling for Optimum Data Memory Compaction in Block Diagramoriented Software Synthesis,” Proc. IEEE Int'l Conf. Acoustics, Speech, and Signal Processing, pp. 2651-2654, 1995.
[7] M. Wiggers, M. Bekooij, and G. Smit, “Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs,” Proc. Design Automation Conf., pp. 658-663, 2007.
[8] A. Ghamarian, M. Geilen, S. Stuijk, T. Basten, A. Moonen, M. Bekooij, B. Theelen, and M. Mousavi, “Throughput Analysis of Synchronous Data Flow Graphs,” Proc. Sixth Int'l Conf. Application of Concurrency to System Design, pp. 25-36, 2006.
[9] S. Stuijk, M. Geilen, and T. Basten, “Exploring Trade-Offs in Buffer Requirements and Throughput Constraints for Synchronous Dataflow Graphs,” Proc. Design Automation Conf., pp. 899-904, 2006.
[10] P. Murthy, “Scheduling Techniques for Synchronous Multidimensional Synchronous Dataflow,” PhD dissertation, Univ. of California, Berkeley, 1996.
[11] M. Adé, R. Lauwereins, and J. Peperstraete, “Data Minimisation for Synchronous Data Flow Graphs Emulated on DSP-FPGA Targets,” Proc. Design Automation Conf., pp. 64-69, 1997.
[12] S. Bhattacharyya, P. Murthy, and E. Lee, Software Synthesis from Dataflow Graphs. Kluwer Academic, 1996.
[13] M. Geilen, T. Basten, and S. Stuijk, “Minimising Buffer Requirements of Synchronous Dataflow Graphs with Model-Checking,” Proc. Design Automation Conf., pp. 819-824, 2005.
[14] R. Govindarajan, G. Gao, and P. Desai, “Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks,” J. VLSI Signal Processing, vol. 31, no. 3, pp. 207-229, July 2002.
[15] C.-T. Hwang, J.-H. Lee, and Y.-C. Hsu, “A Formal Approach to the Scheduling Problem in High-Level Synthesis,” IEEE Trans. Computer-Aided Design, vol. 10, no. 4, pp. 464-475, Apr. 1991.
[16] P. Murthy and S. Bhattacharyy, “Shared Memory Implementations of Synchronous Dataflow Specifications,” Proc. Design, Automation and Test in Europe, pp. 404-410, 2000.
[17] Q. Ning and G. Gao, “A Novel Framework of Register Allocation for Software Pipelining,” Proc. 20th ACM Symp. Principles of Programming Languages, pp. 29-42, 1993.
[18] H. Oh and S. Ha, “Efficient Code Synthesis from Extended Dataflow Graphs,” Proc. Design Automation Conf., pp. 275-280, 2002.
[19] K. Altisen, G. Gößler, and J. Sifakis, “A Methodology for the Construction of Scheduled Systems,” Proc. Int'l Symp. Formal Techniques in Real-Time and Fault-Tolerant Systems, pp. 106-120, 2000.
[20] T. Amnell, E. Fersman, L. Mokrushin, P. Pettersson, and W. Yi, “Times: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems,” Proc. Formal Modeling and Analysis of Timed Systems, pp. 60-72, 2003.
[21] S. Shukla and R. Gupta, “A Model Checking Approach to Evaluating System Level Dynamic Power Management Policies for Embedded Systems,” Proc. Sixth IEEE Int'l High-Level Design Validation and Test Workshop, pp. 53-57, 2001.
[22] A. Ghamarian, M. Geilen, T. Basten, B. Theelen, M. Mousavi, and S. Stuijk, “Liveness and Boundedness of Synchronous Data Flow Graphs,” Proc. Formal Methods in Computer-Aided Design, pp. 68-75, 2006.
[23] S. Sriram and S. Bhattacharyya, Embedded Multi-Processors: Scheduling and Synchronization. Marcel Dekker, 2000.
[24] D. Kim, “System-Level Specification and Cosimulation for Multimedia Embedded Systems,” PhD dissertation, Seoul Nat'l Univ., 2003.
[25] H. Oh and S. Ha, “Fractional Rate Dataflow Model for Efficient Code Synthesis,” J. VLSI Signal Processing, vol. 37, no. 1, pp. 41-51, May 2004.
[26] A. Moonen, M. Bekooij, R. van den Berg, and J. van Meerbergen, “Evaluation of the Throughput Computed with a Dataflow Model—A Case Study,” technical report, TU Eindhoven, Mar. 2007.
[27] S. Gheorghita, S. Stuijk, T. Basten, and H. Corporaal, “Automatic Scenario Detection for Improved WCET Estimation,” Proc. Design Automation Conf., pp. 101-104, 2005.
[28] S. Stuijk, M. Geilen, and T. Basten, “${\rm SDF}^{3}$ : SDF for Free,” Proc. Sixth Int'l Conf. Application of Concurrency to System Design,, 2006.
[29] S. Stuijk, “Predictable Mapping of Streaming Applications on Multiprocessors,” PhD dissertation, TU Eindhoven, 2007.
[30] S. Stuijk, T. Basten, M. Geilen, and H. Corporaal, “Multiprocessor Resource Allocation for Throughput-Constrained Synchronous Dataflow Graphs,” Proc. Design Automation Conf., pp. 777-782, 2007.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool