multimedia architecture
Recently Published Documents


TOTAL DOCUMENTS

21
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)

2017 ◽  
pp. 77-128
Author(s):  
Tung-Chien Chen ◽  
Tzu-Der Chuang ◽  
Liang-Gee Chen


Author(s):  
Erwan Raffin ◽  
Christophe Wolinski ◽  
François Charot ◽  
Emmanuel Casseau ◽  
Antoine Floc’h ◽  
...  

This article presents an integrated environment for application scheduling, binding and routing used for the run-time reconfigurable, operator based, ROMA multimedia architecture. The environment is very flexible and after a minor modification can support other reconfigurable architectures. Currently, it supports the architecture model composed of a bank of single (double) port memories, two communication networks (with different topologies) and a set of run-time functionally reconfigurable non-pipelined and pipelined operators. The main novelty of this work is simultaneous solving of the scheduling, binding and routing tasks. This frequently generates optimal results, which has been shown by extensive experiments using the constraint programming paradigm. In order to show flexibility of our environment, we have used it in this article for optimization of application scheduling, binding and routing (the case of the non-pipelined execution model) and for design space exploration (case of the pipelined execution model).



Author(s):  
Rogier Noldus ◽  
Ulf Olsson ◽  
Catherine Mulligan ◽  
Ioannis Fikouras ◽  
Anders Ryde ◽  
...  








Author(s):  
D. Cheresiz ◽  
B. Juurlink ◽  
S. Vassiliadis ◽  
H.A.G. Wijshoff


2004 ◽  
Vol 13 (06) ◽  
pp. 1165-1181
Author(s):  
YEONG GEOL KIM ◽  
TAG GON KIM

This paper proposes a system-level design methodology for efficient exploration of parameterized multimedia architecture. The purpose is to find a near-optimal configuration, as far as possible, without performing exhaustive analysis of the design space. This is done through synergistic integration of two independent methodologies, first of which is the multi-stage dynamic optimization based on parameters clustering and sparsing, while the second one being a quick performance estimation through sampled-data simulation of target multimedia application. The experimental results with mediabench show speedup ranging from 186.4 to 339.8, while the corresponding error-to-global optimum ranges from 14.8% to 16.4%.



Sign in / Sign up

Export Citation Format

Share Document