CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.–3. rezultāts no 86.
99. lappuse
... possible . In other words , the objective here is to increase TR reuse . However , since we are restructuring the code , the impact of our transformations on other aspects of the code ( e.g. , cache behavior ) should be studied as well ...
... possible . In other words , the objective here is to increase TR reuse . However , since we are restructuring the code , the impact of our transformations on other aspects of the code ( e.g. , cache behavior ) should be studied as well ...
100. lappuse
... possible , we want the execution to move always from Iij to Ikj . That is , we want to stay within the same page region as long as possible . As has been discussed earlier , this helps improve TR reuse and reduce the number of TR ...
... possible , we want the execution to move always from Iij to Ikj . That is , we want to stay within the same page region as long as possible . As has been discussed earlier , this helps improve TR reuse and reduce the number of TR ...
179. lappuse
... possible to derive a minimum width of the wire carrying it , since the design rules of the technology in question gives us the maximum current / width unit . Since the clock skew is proportional to the number of drivers in the clock ...
... possible to derive a minimum width of the wire carrying it , since the design rules of the technology in question gives us the maximum current / width unit . Since the clock skew is proportional to the number of drivers in the clock ...
Saturs
Keynote | 1 |
DualPipeline Heterogeneous ASIP Design | 12 |
Fast CycleAccurate Simulation and Instruction Set Generation | 18 |
Autortiesības | |
28 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
algorithm allocation application approach array assignment benchmarks block buffer cache checksum clock compiler components Computer concurrency constraints cosimulator cost cycles data hazard dataflow deadlock decoder design space dTLB dynamic edge embedded systems energy consumption evaluate example execution exploration flash memory function hardware HW/SW IDCT IEEE implementation input instruction set interface iteration latency leakage power livelock logic loop loop fusion mapping memory objects mesochronous methodology multiprocessor node on-chip operation optimal output overhead packet parameters partitioning path performance phase pipeline platform port power consumption problem Proc processor proposed queue reconfigurable register file request requires resource RTOS scenarios scheduling Section shown in Figure signal SIMD simulation solution specification speech recognition Structured ASIC switch synchronization synthesis system-level SystemC Table technique tion type inference type schemes variables Verilog VHDL VLIW XScale