CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 59.
42. lappuse
... selected . Allocating static cache banks to nodes is more complex , requiring the generation of a metric for each bank to aid selection . All non- critical edges connected to nodes designated for static cache allocation are removed ...
... selected . Allocating static cache banks to nodes is more complex , requiring the generation of a metric for each bank to aid selection . All non- critical edges connected to nodes designated for static cache allocation are removed ...
77. lappuse
... selected for f in Step 2b , the first and last channel implicitly determine what NI s ( ƒ ) and d ( ƒ ) should be ... selected based on communication to already mapped cores . Due to the nature of the least - cost path selection algo ...
... selected for f in Step 2b , the first and last channel implicitly determine what NI s ( ƒ ) and d ( ƒ ) should be ... selected based on communication to already mapped cores . Due to the nature of the least - cost path selection algo ...
170. lappuse
... 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 instances of ...
... 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 instances of ...
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