CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 59.
18. lappuse
... loop is cut by a synchronization point , then all involved processes are re- synchronized in each iteration , as for loops L2 and L4 . However for the loops L , and L3 which iterates completely within the synchroni- zation interval ...
... loop is cut by a synchronization point , then all involved processes are re- synchronized in each iteration , as for loops L2 and L4 . However for the loops L , and L3 which iterates completely within the synchroni- zation interval ...
156. lappuse
... loops with se- quential array accesses , like the loop in Figure 3. The anal- ysis can be easily generalized later . For such loops it is convenient to think of memory operations per k loop itera- tions ; where k is the number of ...
... loops with se- quential array accesses , like the loop in Figure 3. The anal- ysis can be easily generalized later . For such loops it is convenient to think of memory operations per k loop itera- tions ; where k is the number of ...
299. lappuse
... loop with respect to the whole program , the percentage of non - memory operations in the loop and the the- oretical maximum improvement which can be obtained . The loop starting at line 643 of jcphuff.c has the highest TMI value and is ...
... loop with respect to the whole program , the percentage of non - memory operations in the loop and the the- oretical maximum improvement which can be obtained . The loop starting at line 643 of jcphuff.c has the highest TMI value and is ...
Saturs
Keynote | 3 |
A Core Flight Software System | 13 |
A CycleAccurate Compilation Algorithm for Custom Pipelined Datapaths | 21 |
Autortiesības | |
31 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
abstraction algorithm allocation analysis application approach architecture benchmarks binary biochips buffer byte cache channel chip circuit clock communication compiler components compression Computer configuration constraints copies coprocessor core CRAMES cycle cycle accurate simulation data block decoder digital microfluidic DVFS dynamic Echo instructions EEMBC efficient embedded systems energy consumption execution FPGA function graph hardware hash IEEE implementation input instruction-set interface iteration latency loop mapping marked graph memory accesses methodology microblaze microfluidic minimal minterms minterms module multiplier multiprocessor node on-chip operations optimal output overhead packet parallel parameters partition performance pipeline platform port power consumption Proc processor proposed reconfigurable reduce resource router runtime samples scheduling SECTAG Section SELinux simulation space specific speedup switch synchronization synthesis SystemC Table target task techniques tion transaction universal hash functions vector VLIW voltage WCET Xilinx