CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 86.
23. lappuse
... operation and its successor depends on both the binding of operations to functional units ( FU ) and the delay of the path between corresponding FUs . For example , suppose we want to map DFG of Figure 4 on datapath of Figure 5. Operation ...
... operation and its successor depends on both the binding of operations to functional units ( FU ) and the delay of the path between corresponding FUs . For example , suppose we want to map DFG of Figure 4 on datapath of Figure 5. Operation ...
24. lappuse
... operation at the end of block is scheduled . If the controller is pipelined , then the branch delay of the jump operation must be filled by other operations in the block . Our algorithm schedules operations backward , i.e. from last ...
... operation at the end of block is scheduled . If the controller is pipelined , then the branch delay of the jump operation must be filled by other operations in the block . Our algorithm schedules operations backward , i.e. from last ...
66. lappuse
... operations , we apply FMM to our programmability constraint . To determine conflicts between operations , we apply max to the operations and then test if the resulting minterm programmability constraint . satisfies the Definition 5 An ...
... operations , we apply FMM to our programmability constraint . To determine conflicts between operations , we apply max to the operations and then test if the resulting minterm programmability constraint . satisfies the Definition 5 An ...
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