CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.–3. rezultāts no 41.
86. lappuse
... partitioning , mapping and bus cycle ) which are more and more favourable to the TT partition . The first step is stopped once a solution with a schedulable TT partition has been reached . If at the end of the first step no such ...
... partitioning , mapping and bus cycle ) which are more and more favourable to the TT partition . The first step is stopped once a solution with a schedulable TT partition has been reached . If at the end of the first step no such ...
87. lappuse
... partition ( tij ) -- Tij is not partitioned else Cost = DSch ; d = domain of tij endif if BestCost > Cost then BestCost Cost ; BestDomain = d ; = BestNode = p ; BestCycle = BusCycle ; endif endfor else BestNode = Node on which tij is ...
... partition ( tij ) -- Tij is not partitioned else Cost = DSch ; d = domain of tij endif if BestCost > Cost then BestCost Cost ; BestDomain = d ; = BestNode = p ; BestCycle = BusCycle ; endif endfor else BestNode = Node on which tij is ...
221. lappuse
... partition ii . Partition + transform data and code iii . Perform address resolution Figure 4 : Overall parallelization algorithm We exploit data parallelism within DSP programs by par- titioning the data and computation across the ...
... partition ii . Partition + transform data and code iii . Perform address resolution Figure 4 : Overall parallelization algorithm We exploit data parallelism within DSP programs by par- titioning the data and computation across the ...
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