CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.–3. rezultāts no 67.
34. lappuse
... solution avoids speculative execution of leaves trying to reduce time and power overhead . In this case , leaf processing uses simultaneously all the PE Array resources when the number of found leaves is enough to fill it . All the ...
... solution avoids speculative execution of leaves trying to reduce time and power overhead . In this case , leaf processing uses simultaneously all the PE Array resources when the number of found leaves is enough to fill it . All the ...
90. lappuse
... solution for ( T , ø ) iff S is a solution for ( T ' , O ' ) . = PROOF . We will prove this statement by induction on the struc- ture of the transitions . The transitions presented in Table 1 are al- most identical to those for ...
... solution for ( T , ø ) iff S is a solution for ( T ' , O ' ) . = PROOF . We will prove this statement by induction on the struc- ture of the transitions . The transitions presented in Table 1 are al- most identical to those for ...
168. lappuse
... solutions kept . Each of them becomes a n_n_i partial solution if Tn is assigned to Pn . Now consider the term Bn − 1 , n − 1 ( i − 1 ) which is the number of n − 1_n – 1_i – 1 partial solutions kept . Each of them can become a ...
... solutions kept . Each of them becomes a n_n_i partial solution if Tn is assigned to Pn . Now consider the term Bn − 1 , n − 1 ( i − 1 ) which is the number of n − 1_n – 1_i – 1 partial solutions kept . Each of them can become a ...
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