CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 60.
41. lappuse
... node . An interference edge is added between nodes that access data in the same activation range ( a temporal run ... node then that node's criticality is set to a value representing the number of simultaneous accesses that must be ...
... node . An interference edge is added between nodes that access data in the same activation range ( a temporal run ... node then that node's criticality is set to a value representing the number of simultaneous accesses that must be ...
174. lappuse
well as the list of successor nodes of nodes in Vin must be known . This information is formally defined as follows ... node is an input node for the template T if it is not contained in T , and it has at least one succes- sor contained ...
well as the list of successor nodes of nodes in Vin must be known . This information is formally defined as follows ... node is an input node for the template T if it is not contained in T , and it has at least one succes- sor contained ...
210. lappuse
... Node Count ( a ) Interaction Centers Figure 3 : Scalability of major components of a time - step for the Rhodopsin system . The data were taken in dual core mode except for the " Real Space ” data which had to be taken in single core ...
... Node Count ( a ) Interaction Centers Figure 3 : Scalability of major components of a time - step for the Rhodopsin system . The data were taken in dual core mode except for the " Real Space ” data which had to be taken in single core ...
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