CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 74.
19. lappuse
... graph contains no edges between states from different minimal synchronization intervals . Process P1 R , memory ... graph ing multi process distribution graph MPDGOPC ( t ) for a given operator class OPC , can be calculated as follows ...
... graph contains no edges between states from different minimal synchronization intervals . Process P1 R , memory ... graph ing multi process distribution graph MPDGOPC ( t ) for a given operator class OPC , can be calculated as follows ...
174. lappuse
... graph 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 in T. Similarly , an input node for the basic block is an input node for T if it has at least one successor ...
... graph 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 in T. Similarly , an input node for the basic block is an input node for T if it has at least one successor ...
227. lappuse
... graph model for a micropipeline [ 20 ] ( a ) low level ( b ) abstract level the circuit diagram is modeled as a transition in the marked graph . In the marked graph , a transition is represented by a rectangle , a place by a numbered ...
... graph model for a micropipeline [ 20 ] ( a ) low level ( b ) abstract level the circuit diagram is modeled as a transition in the marked graph . In the marked graph , a transition is represented by a rectangle , a place by a numbered ...
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