CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.–3. rezultāts no 90.
15. lappuse
... given type . For an instruction , Ins1 in the instruction set , its Associated Graph Set is denoted by 1 . Definition 4 : Dependency Depth . The depth of a node in a connected graph , g , from the starting nodes . A starting node is not ...
... given type . For an instruction , Ins1 in the instruction set , its Associated Graph Set is denoted by 1 . Definition 4 : Dependency Depth . The depth of a node in a connected graph , g , from the starting nodes . A starting node is not ...
36. lappuse
... Given the expense of solving circuit equivalence , we develop a set of practical approximations based on abstract interpretation . Experiments show that our techniques , while reliably recognizing saturating arith- metic , have small ...
... Given the expense of solving circuit equivalence , we develop a set of practical approximations based on abstract interpretation . Experiments show that our techniques , while reliably recognizing saturating arith- metic , have small ...
125. lappuse
... Given our view of SA as a sequence of moves each of which is blindly accepted , or probabilistically rejected depending upon its degree of suboptimality , we define a cost function on the param- eters that change for a given move , i.e ...
... Given our view of SA as a sequence of moves each of which is blindly accepted , or probabilistically rejected depending upon its degree of suboptimality , we define a cost function on the param- eters that change for a given move , i.e ...
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