CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 69.
78. lappuse
... cost 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 ...
... cost 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 ...
151. lappuse
... cost over the time window , and is the sum of the cost incurred at each clock cycle . L M N Ck = Cxa , k + Cyb , k + Σ Cze , k a = 1 b = 1 c = 1 ( 12 ) The cost at kth clock cycle is given by a summation of the costs incurred by all ...
... cost over the time window , and is the sum of the cost incurred at each clock cycle . L M N Ck = Cxa , k + Cyb , k + Σ Cze , k a = 1 b = 1 c = 1 ( 12 ) The cost at kth clock cycle is given by a summation of the costs incurred by all ...
233. lappuse
... cost functions used to eval- uate the performance of a given access tree topology , and then use these results in a heuristic that constructs an application - specific tree . We limit the scope to balanced trees , as they are easier to ...
... cost functions used to eval- uate the performance of a given access tree topology , and then use these results in a heuristic that constructs an application - specific tree . We limit the scope to balanced trees , as they are easier to ...
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