CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.3. rezultāts no 66.
89. lappuse
... Step 2 fails + 200 40 tasks 10 unmapped tasks 1400 600 400 200 Time ( s ) 150 100 60 % avg . processor utilization Step 3 succeeded Step 3 failed + 50 20 10 15 No. of Unpartitioned Task Graphs Figure 12. Runtime of step 2 function of 14 ...
... Step 2 fails + 200 40 tasks 10 unmapped tasks 1400 600 400 200 Time ( s ) 150 100 60 % avg . processor utilization Step 3 succeeded Step 3 failed + 50 20 10 15 No. of Unpartitioned Task Graphs Figure 12. Runtime of step 2 function of 14 ...
129. lappuse
... step , the problem is to find the minimum of all CO's ( COmin ) , = COmin mini , k = 1,2,31 k [ Co ( mi , 1 ) + co ... step i architecture number of operations of type j in the architecture set of all modules of type j in control step i ...
... step , the problem is to find the minimum of all CO's ( COmin ) , = COmin mini , k = 1,2,31 k [ Co ( mi , 1 ) + co ... step i architecture number of operations of type j in the architecture set of all modules of type j in control step i ...
148. lappuse
... Step 1. Compute the upper bound on unfolding factor fmax [ M / | V | J . 3 B 1 D 1 = C E Step 2. For each ƒ { F : 1 ≤ ƒ ≤ fmax } in increasing order , compute the unfolded graph Gƒ .. Step 3. Compute the upper bound of functional ...
... Step 1. Compute the upper bound on unfolding factor fmax [ M / | V | J . 3 B 1 D 1 = C E Step 2. For each ƒ { F : 1 ≤ ƒ ≤ fmax } in increasing order , compute the unfolded graph Gƒ .. Step 3. Compute the upper bound of functional ...
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