CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 47.
54. lappuse
... samples . Since it requires memory copy overhead to shift each sample , the optimal shift buffering problem is to minimize the number of shifted samples for an iteration of the schedule . It is a rather obvious observation on the shift ...
... samples . Since it requires memory copy overhead to shift each sample , the optimal shift buffering problem is to minimize the number of shifted samples for an iteration of the schedule . It is a rather obvious observation on the shift ...
55. lappuse
5.2 Algorithm for an arc with delay samples When an arc has initial delay samples , we are not sure whether the optimal shift buffering result shifts samples at S. Therefore we assume that we shift samples at sq . By combining f ( k ) ...
5.2 Algorithm for an arc with delay samples When an arc has initial delay samples , we are not sure whether the optimal shift buffering result shifts samples at S. Therefore we assume that we shift samples at sq . By combining f ( k ) ...
56. lappuse
... sampling data ) to DAT format ( 48 KHz ) . Each arc requires 4 , 10 , and 11 size buffers at least to hold the live samples while each functional node has additional buffers since it need to store the previous samples . The repetitions ...
... sampling data ) to DAT format ( 48 KHz ) . Each arc requires 4 , 10 , and 11 size buffers at least to hold the live samples while each functional node has additional buffers since it need to store the previous samples . The repetitions ...
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