CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 46.
42. lappuse
... connected to nodes designated for static cache allocation are removed . This allows banks to be assigned to nodes that were connected by non - critical edges and is permitted because the metric generated for each bank contains ...
... connected to nodes designated for static cache allocation are removed . This allows banks to be assigned to nodes that were connected by non - critical edges and is permitted because the metric generated for each bank contains ...
61. lappuse
... connected ports and as soon as the second port is connected to a channel , a connection between the two port data structures is made by setting up remote pointers between them . A task may not be started before all active ports are ...
... connected ports and as soon as the second port is connected to a channel , a connection between the two port data structures is made by setting up remote pointers between them . A task may not be started before all active ports are ...
227. lappuse
... connected graph there exists a live , safe marking . THEOREM 3. Let M be a live marking of a strongly - connected marked graph , then for any firing sequence that leads back to the initial marking M , all i transitions have been fired ...
... connected graph there exists a live , safe marking . THEOREM 3. Let M be a live marking of a strongly - connected marked graph , then for any firing sequence that leads back to the initial marking M , all i transitions have been fired ...
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