CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.3. rezultāts no 73.
202. lappuse
... possible states of the cache when the lower priority task 7 is preempted and when the higher priority task 7 ' is completed . This is more accurate than existing set - based analysis techniques which estimate the cache states by ...
... possible states of the cache when the lower priority task 7 is preempted and when the higher priority task 7 ' is completed . This is more accurate than existing set - based analysis techniques which estimate the cache states by ...
203. lappuse
... possible cache states when 7 is preempted and LCSB captures the possible cache usages when 7 resumes execution . This brings us to the notion of " useful cache blocks " . These are cache blocks con- taining memory blocks at the point B ...
... possible cache states when 7 is preempted and LCSB captures the possible cache usages when 7 resumes execution . This brings us to the notion of " useful cache blocks " . These are cache blocks con- taining memory blocks at the point B ...
206. lappuse
... possible preemption sequences . One possible concern regarding our analysis technique is a blow - up in space consumption . As observed in the previ- ous section , none of our benchmarks suffered from an expo- nential space blow - up ...
... possible preemption sequences . One possible concern regarding our analysis technique is a blow - up in space consumption . As observed in the previ- ous section , none of our benchmarks suffered from an expo- nential space blow - up ...
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