CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.3. rezultāts no 56.
35. lappuse
... complete Partitions allocated into the CTT Figure 4 : Mapping VPN partitions to CTT segments or just complete partition . Consequently , a complete partition is a partition with minimal number of index bits and high utilization of the ...
... complete Partitions allocated into the CTT Figure 4 : Mapping VPN partitions to CTT segments or just complete partition . Consequently , a complete partition is a partition with minimal number of index bits and high utilization of the ...
170. lappuse
... complete selection of patterns , instances , and cor- responding wcet 1 if in.m = M then return in ; 2 Let p E ( P - in.pat ) be the pattern with max profit ; 3 if profit ( p ) = 0 then return in ; 4 Let ins ( p ) be the selected ...
... complete selection of patterns , instances , and cor- responding wcet 1 if in.m = M then return in ; 2 Let p E ( P - in.pat ) be the pattern with max profit ; 3 if profit ( p ) = 0 then return in ; 4 Let ins ( p ) be the selected ...
321. lappuse
... complete execution of program in orders of magnitude less time than perform- ing full cycle accurate simulation , with an average error of 3.2 % . Our approach uses dynamic phase analysis to gener- ate targeted cycle - close simulation ...
... complete execution of program in orders of magnitude less time than perform- ing full cycle accurate simulation , with an average error of 3.2 % . Our approach uses dynamic phase analysis to gener- ate targeted cycle - close simulation ...
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