CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.3. rezultāts no 50.
202. lappuse
... cache ( and not data cache ) . Our technique performs path analysis of both 7 and 7 ' . Furthermore , we compute the possible states of the cache when the lower priority task 7 is preempted and when the higher priority task 7 ' is ...
... cache ( and not data cache ) . Our technique performs path analysis of both 7 and 7 ' . Furthermore , we compute the possible states of the cache when the lower priority task 7 is preempted and when the higher priority task 7 ' is ...
206. lappuse
... cache blocks for low - priority task in sec . = with B = 40 , M = 490 and C = 8 , we only get 68 cache states for LCSB and 69 for RCSB . When we set C 64 , number of cache states in LCSB and RCSB increase to only 425 and 600 ...
... cache blocks for low - priority task in sec . = with B = 40 , M = 490 and C = 8 , we only get 68 cache states for LCSB and 69 for RCSB . When we set C 64 , number of cache states in LCSB and RCSB increase to only 425 and 600 ...
215. lappuse
... cache . DynamicLive Last Used Garbage Overhead pushpuzzle scheduler stmap webviewer Main Memory Cache Figure 3 : Relevant Cache lines of an object objects are not necessarily aligned to the beginning of cache lines , it is possible for ...
... cache . DynamicLive Last Used Garbage Overhead pushpuzzle scheduler stmap webviewer Main Memory Cache Figure 3 : Relevant Cache lines of an object objects are not necessarily aligned to the beginning of cache lines , it is possible for ...
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