CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 44.
42. lappuse
... static cache banks to nodes is more complex , requiring the generation of a metric for each bank to aid selection . All non- critical edges connected to nodes designated for static cache allocation are removed . This allows banks to be ...
... static cache banks to nodes is more complex , requiring the generation of a metric for each bank to aid selection . All non- critical edges connected to nodes designated for static cache allocation are removed . This allows banks to be ...
113. lappuse
... static bounds and dynamic bounds ( see Figure 2 ) . The static bounds are obtained at the design time using an offline analysis and are then used by the scheduler at runtime . In this sense they are similar to conventional workload ...
... static bounds and dynamic bounds ( see Figure 2 ) . The static bounds are obtained at the design time using an offline analysis and are then used by the scheduler at runtime . In this sense they are similar to conventional workload ...
232. lappuse
... static scheduling in memory - intensive applications [ 5 , 28 , 9 , 20 , 18 ] . Most of these efforts start with a control - data flow graph like specification , where memory references are explicitly marked ( i.e. statically disam ...
... static scheduling in memory - intensive applications [ 5 , 28 , 9 , 20 , 18 ] . Most of these efforts start with a control - data flow graph like specification , where memory references are explicitly marked ( i.e. statically disam ...
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