CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.–3. rezultāts no 45.
87. lappuse
... basic data types such as bool , arrays , structures , or lower - level types such as bits or ieee_std_logic_vector ... Basic Types Type Variables a , B , Y :: = Type Schemes T * :: = | T [ N ] | struct { i : T1 ; ... in : Tn ...
... basic data types such as bool , arrays , structures , or lower - level types such as bits or ieee_std_logic_vector ... Basic Types Type Variables a , B , Y :: = Type Schemes T * :: = | T [ N ] | struct { i : T1 ; ... in : Tn ...
88. lappuse
... Basic C ++ data types correspond to the basic types presented earlier . Template classes ' templatized port interfaces can be characterized using the type schemes presented . Classes can be represented by adding function pointers to the ...
... Basic C ++ data types correspond to the basic types presented earlier . Template classes ' templatized port interfaces can be characterized using the type schemes presented . Classes can be represented by adding function pointers to the ...
89. lappuse
... Basic Algorithm The basic ML - style substitution algorithm works by simplify- ing each term in the constraint , ø , and then eliminating it . As the constraints are simplified , the algorithm will create a new simpler constraint and ...
... Basic Algorithm The basic ML - style substitution algorithm works by simplify- ing each term in the constraint , ø , and then eliminating it . As the constraints are simplified , the algorithm will create a new simpler constraint and ...
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