CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.–3. rezultāts no 46.
121. lappuse
Task Graph 3 Task Graph O Task Graph 2 Task Graph 1 Task Graph 4 Energy consumption ( n ) 350 300- 250 200 150 100 50 400 500 600 700 800 900 1000 1100 1200 Execution time ( US ) Figure 2 : The Pareto curve of task graph 2 . x ! 14.6 ...
Task Graph 3 Task Graph O Task Graph 2 Task Graph 1 Task Graph 4 Energy consumption ( n ) 350 300- 250 200 150 100 50 400 500 600 700 800 900 1000 1100 1200 Execution time ( US ) Figure 2 : The Pareto curve of task graph 2 . x ! 14.6 ...
145. lappuse
... graph . 2.1 Performance Optimizations = Many DSP applications can be modeled as data flow graphs ( DFG ) . Then , optimization problems , such as retiming and unfold- ing , can be regarded as graph transformation problems . A data flow ...
... graph . 2.1 Performance Optimizations = Many DSP applications can be modeled as data flow graphs ( DFG ) . Then , optimization problems , such as retiming and unfold- ing , can be regarded as graph transformation problems . A data flow ...
148. lappuse
... graph . The computation cost of STDu algorithm can be estimated as the summation of unfolding cost ( Cuf ) and scheduling cost ( Csche ) for the unfolded graphs , i.e. , Cuf + Csche Σf , EF fi + Σf , EF filST . = == The search cost of ...
... graph . The computation cost of STDu algorithm can be estimated as the summation of unfolding cost ( Cuf ) and scheduling cost ( Csche ) for the unfolded graphs , i.e. , Cuf + Csche Σf , EF fi + Σf , EF filST . = == The search cost of ...
Saturs
An Efficient Retargetable Framework for InstructionSet Simulation | 13 |
Extending the SystemC Synthesis Subset by ObjectOriented Features | 25 |
Hardware Support for Realtime Operating Systems | 45 |
Autortiesības | |
19 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
abstraction adiabatic circuits algorithm analysis application approach architecture behavior buffer bytecode cache blocks cache line channel chip clock Codesign communication components computation configuration constraints core cycle decoder defined delay design space exploration device device driver DRAM DRAM row dynamic EMAC embedded systems encoder energy error estimation event example execution FIFO flash memory function global hardware IEEE implementation input instruction interface iteration Kahn Process Network latency logic minimization loop M-JPEG mapping methodology module multiple NAND Nash equilibrium Newport Beach node on-chip on-memory cache optimization output overhead packet parallel parameters partitioning performance priority Proc process network processor protocol real-time retiming RTOS model RTPN scheduling Section shown in Figure simulation solution specification speech recognition static step synchronization synthesis system level SystemC Table task graphs TCP/IP technique Technology tion TLMs tool VHDL virtual VLIW wires