Parametric throughput analysis of synchronous data flow graphs

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2008, Pages 116-121

  Ghamarian, A H ^a   Geilen, M C W ^a   Basten, T ^a   Stuijk, S ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS AND SYNTHESIS; DESIGN SPACE EXPLORATION; DIVIDE-AND-CONQUER ALGORITHMS; EXECUTION TIMES; MULTI-PROCESSOR PLATFORMS; MULTIMEDIA APPLICATIONS; PERFORMANCE CONSTRAINTS; REAL-TIME APPLICATIONS; RUN-TIME RECONFIGURATION; SPECIFIC PARAMETER VALUES; STATE-SPACE ANALYSIS; SYNCHRONOUS DATA FLOW GRAPHS; THROUGHPUT ANALYSIS;

GRAPH THEORY; INDUSTRIAL ENGINEERING; PARAMETER ESTIMATION; RESPONSE TIME (COMPUTER SYSTEMS); SPACE RESEARCH; STANDARDS; STATE SPACE METHODS; TESTING; THROUGHPUT; TREES (MATHEMATICS);

DATA FLOW ANALYSIS;

EID: 49749144878     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2008.4484672     Document Type: Conference Paper

References (19)

1. M. Berkelaar, K. Eikland, and P. Notebaert. lpsolve. C library, http://www.geocities.com/lpsolve/.
2. A. Dasdan. Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM ToDAES, 9(4):385-418, 2004.
3. H. Edelsbrunner et al. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete & Computational Geometry, 4:311-336, 1989.
4. K. Fukuda. cddlib. C++ library, Swiss Federal Institute of Technology, http://www.ifor.math.ethz. ch/∼fukuda/cdd_home/cdd.html.
5. S. Garg et al. System-level process variation driven throughput analysis for single and multiple voltage-frequency island designs. In DATE, p. 403-408, 2007.
6. A. H. Ghamarian et al. Liveness and boundedness of synchronous data flow graphs. In FMCAD'06, p. 68-75. IEEE, 2006.
7. A. H. Ghamarian et al. Throughput analysis of synchronous data flow graphs. In ACSD'06, p. 25-36. IEEE, 2006.
8. A. H. Ghamarian et al. Parametric throughput analysis of synchronous data flow graphs. Tech. report ESR-2007-08, TU Eindhoven, http://www.es.ele.tue.nl/esreports/, 2007.
9. D. B. Johnson. Finding all the elementary circuits of a directed graph. SIAM J. on Computing, 4(1):77-84, 1975.
10. E. Lee et al. Synchronous dataflow. Proc. of the IEEE, 75(9):1235-1245, September 1987.
11. R. M. Karp et al. Properties of a model for a parallel computations: Determinacy, termination, queueing. SIAM J. on Applied Mathematics, 14(6):1390-1411, 1966.
12. H. Oh et al. Fractional rate dataflow model for efficient code synthesis. J. of VLSI Signal Processing, 37(1):41-51, 2004.
13. J. Pino et al. A hierarchical multiprocessor scheduling system for DSP applications. In Conf. on Signals, Systems and Computers, p. 122-126. IEEE, 1995.
14. P. Poplavko et al. Task-level timing models for guaranteed performance in multiprocessor networks-on-chip. In CASES'03, p. 63-72. ACM, 2003.
15. P. Poplavko et al. Execution-time prediction for dynamic streaming applications with task-level parallelism. In DSD'07, p. 228-235. IEEE, 2007.
16. S. Sriram et al. Embedded Multiprocessors: Scheduling and Synchronization. Marcel Dekker, Inc, NY, 2000.
17. S. Stuijk. Predictable Mapping of Streaming Applications on Multiprocessors. Phd thesis, TU Eindhoven, 2007.
18. S. Stuijk et al. Multiprocessor resource allocation for throughput-constrained synchronous dataflow graphs. In DAC'07, p. 777-782. ACM, 2007.
19. M. Wiggers et al. Efficient computation of buffer capacities for cyclo-static dataflow graphs. In DAC 07, p. 658-663. ACM, 2007.