CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.–3. rezultāts no 70.
37. lappuse
... assume that int is 32 bits wide and short is 16 bits wide . Two's complement arith- metic is assumed for all relevant operations . We assume arithmetic right shift operator " >> " ) . To test the practicality of this idea , we ...
... assume that int is 32 bits wide and short is 16 bits wide . Two's complement arith- metic is assumed for all relevant operations . We assume arithmetic right shift operator " >> " ) . To test the practicality of this idea , we ...
123. lappuse
... assume a sim- ple target architecture that contains one SW processor and one HW unit connected by a system bus , as shown in Figure 1. We assume mutually exclusive operation of the two units , i.e , the two units may not be computing ...
... assume a sim- ple target architecture that contains one SW processor and one HW unit connected by a system bus , as shown in Figure 1. We assume mutually exclusive operation of the two units , i.e , the two units may not be computing ...
142. lappuse
... assumed to be 25 % of ac- tive power , tracking XScale idle dissipation and data found in other works [ 6 ] . We assume a lower power idle NOP for the XScale ( as opposed to the standard ' MOV ' approach ) , as it performs relatively ...
... assumed to be 25 % of ac- tive power , tracking XScale idle dissipation and data found in other works [ 6 ] . We assume a lower power idle NOP for the XScale ( as opposed to the standard ' MOV ' approach ) , as it performs relatively ...
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