CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 73.
18. lappuse
... corresponding edge weights denote the iteration count of the corresponding loop . Backward edges of unbounded data - dependent loops are denoted by the symbolic edge weight u . Explicit enumerating representation CCS ( S ,, s , ) = { 1 ...
... corresponding edge weights denote the iteration count of the corresponding loop . Backward edges of unbounded data - dependent loops are denoted by the symbolic edge weight u . Explicit enumerating representation CCS ( S ,, s , ) = { 1 ...
25. lappuse
... corresponding input ports of FU at clock cycle clk . If an operand is a variable or a constant , then this function tries to schedule a read from the corresponding storage . Otherwise , it calls the Schedule Operation function . The ...
... corresponding input ports of FU at clock cycle clk . If an operand is a variable or a constant , then this function tries to schedule a read from the corresponding storage . Otherwise , it calls the Schedule Operation function . The ...
47. lappuse
... corresponding decoders are not used ; otherwise , the original decoder is extended to include the two XCAM bits . Therefore , accesses to corresponding subarrays are reduced . When V2 , V4 , V6 , and V7 are zeros , the corresponding ...
... corresponding decoders are not used ; otherwise , the original decoder is extended to include the two XCAM bits . Therefore , accesses to corresponding subarrays are reduced . When V2 , V4 , V6 , and V7 are zeros , the corresponding ...
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