Interactive co-design of high throughput embedded multimedia

Proceedings-Design Automation Conference

Volumn , Issue , 2000, Pages 328-331

  Omnès, Thierry J F ^a   Franzetti, Thierry ^a   Catthoor, Francky ^a  

^a IMEC   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; DECODING; GRAPH THEORY; MULTIMEDIA SYSTEMS; NETWORK PROTOCOLS; REAL TIME SYSTEMS;

EMBEDDED MULTIMEDIA SYSTEM; FORCE DIRECTED SCHEDULING ALGORITHM; LIST SCHEDULING TECHNIQUE;

EMBEDDED SYSTEMS;

EID: 0033698643     PISSN: 0738100X     EISSN: None     Source Type: Journal    
DOI: 10.1109/DAC.2000.855330     Document Type: Article

References (15)

1. R. L. Graham Bounds on multiprocessor timing anomalies SIAM J. Appl. Math. 17 2 416 429 1969
2. B. W. Kernighan S. Lin An Effective Heuristic Procedure For Partitioning Graphs The Bell System Technical Journal 291 308 February 1970
3. P. G. Paulin J. P. Knight Algorithms for High-Level Synthesis IEEE Design and Test of Computers 18 31 December 1989
4. Y. Therasse VLSI architecture of a SMDS/ATM router An. Télécoms 48 3-4 166 180 1993
5. L. Nachtergaele Optimization of memory organisation and partitioning for decreased size and power in video and image processing systems IEEE Intl Workshop on Memory Technology 82 87 IEEE Intl Workshop on Memory Technology 1995-August
6. W. F. J. Verhaegh Improved Force-Directed Scheduling (IFDS) in high-throughput digital signal processing IEEE Trans. CAD 14 945 960 1995
7. A. Gerasoulis A multistage approach to scheduling task graphs DIMACS Series Discrete Math Th. Comp. Sc. 22 81 103 1995
8. A. Gupta Fast and effective algorithms for graph partitioning and sparse-matrix ordering IBM Journal of R&D 41 1/2 1997
9. Z. Liu Worst-case analysis of scheduling heuristics of parallel systems Parallel Computing 24 5-6 863 891 June 1998
10. F. Catthoor Custom Memory Management Methodology-Exploration of Memory Organisation for Embedded Multimedia System Design 1998 Kluwer Academic Publishers
11. D. Eppstein CRC Handbook of Algorithms and Theory of Computation 1999 Dynamic graph algorithms
12. A. Vandecappelle Global Multimedia System Design Exploration using Accurate Memory Organization Feedback Proc. DAC 327 332 Proc. DAC 1999
13. S. Wuytack Minimizing the Required Memory Bandwidth in VLSI System Realizations Transactions on VLSI Systems 7 4 433 441 December 1999
14. T.J-F. Omnès Techniques de parallélisation automatique 1999 TSI, Éditions Hermès Dynamic algorithms for minimizing memory bandwidth in high throughput telecom and multimedia
15. E. Brockmeyer Low power storage cycle budget distribution for hierarchical graphs Proc. DATE Proc. DATE 2000-March