CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.3. rezultāts no 42.
8. lappuse
... depends on i , k unlike A which depends on i , j . The address generator selects the correct loop variables to be used for address expression . Each address generator has a designated partner ALU in the clus- ter with several address ...
... depends on i , k unlike A which depends on i , j . The address generator selects the correct loop variables to be used for address expression . Each address generator has a designated partner ALU in the clus- ter with several address ...
34. lappuse
... depends on the degree of data coherence . A higher degree of data coherence results into a reduced number of idle PEs and a lower value for IPE . In the case of 3D graphics the data coherence is high , at least locally . However ...
... depends on the degree of data coherence . A higher degree of data coherence results into a reduced number of idle PEs and a lower value for IPE . In the case of 3D graphics the data coherence is high , at least locally . However ...
203. lappuse
... depends on the last requester having caused the potential request deadlock ( R - dl ) . Additionally , the request case of Algo- rithm 2 does not consider the importance ( i.e. , priorities ) of processes competing for resources . Thus ...
... depends on the last requester having caused the potential request deadlock ( R - dl ) . Additionally , the request case of Algo- rithm 2 does not consider the importance ( i.e. , priorities ) of processes competing for resources . Thus ...
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