CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 63.
52. lappuse
Since the code for buffer access is simple and independent of the buffer size in linear buffering , a library block is usually written assuming linear buffering . If a library code is provided by a function prototype and is not liable ...
Since the code for buffer access is simple and independent of the buffer size in linear buffering , a library block is usually written assuming linear buffering . If a library code is provided by a function prototype and is not liable ...
116. lappuse
... buffer size [ macroblocks ] ( b ) 1500 2000 2000 4000 6000 adaptation inteval [ us ] 8000 10000 ( c ) ( a ) Figure 4 : Experimental results . In ( b ) our scheme is denoted as DVS and DVS iDPM . ing on and off of PE2 was assumed to ...
... buffer size [ macroblocks ] ( b ) 1500 2000 2000 4000 6000 adaptation inteval [ us ] 8000 10000 ( c ) ( a ) Figure 4 : Experimental results . In ( b ) our scheme is denoted as DVS and DVS iDPM . ing on and off of PE2 was assumed to ...
253. lappuse
... buffer is defined the implementation is working on . This function allocates a new buffer with one entry per burst item . behavior = [ buffer [ current ] .reqTrf.reqMode = reqUntilUnreq ; buffer [ current ] . addrTrf.type ...
... buffer is defined the implementation is working on . This function allocates a new buffer with one entry per burst item . behavior = [ buffer [ current ] .reqTrf.reqMode = reqUntilUnreq ; buffer [ current ] . addrTrf.type ...
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