CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 73.
78. lappuse
... path from map ( [ s ( f ) ] ) to the router nR NR with lowest cost . Arity is used to distinguish between routers with equal cost . ( a ) Refine mapi + 1 = map ; → { [ s ( ƒ ) ] H d ( head ) } ( b ) Reserve egress bandwidth for all ...
... path from map ( [ s ( f ) ] ) to the router nR NR with lowest cost . Arity is used to distinguish between routers with equal cost . ( a ) Refine mapi + 1 = map ; → { [ s ( ƒ ) ] H d ( head ) } ( b ) Reserve egress bandwidth for all ...
222. lappuse
... path of the LCH data path shown in Figure 1 is de- termined by the multiplier . Overall , the dynamic power consumption of a w - bit LCH data path decreases as : O ( w1 ) if the critical path delays remain unchanged , so using small size ...
... path of the LCH data path shown in Figure 1 is de- termined by the multiplier . Overall , the dynamic power consumption of a w - bit LCH data path decreases as : O ( w1 ) if the critical path delays remain unchanged , so using small size ...
223. lappuse
... paths calcu- late the first and second term inside the bracket of equation ( 9 ) respectively ) for k cycles and then performs the modu lar reduction step . This divide - and - concatenate LCH data path using four w / 2 - bit data paths ...
... paths calcu- late the first and second term inside the bracket of equation ( 9 ) respectively ) for k cycles and then performs the modu lar reduction step . This divide - and - concatenate LCH data path using four w / 2 - bit data paths ...
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