CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 81.
20. lappuse
... achieve the same latency of 1536 clock cycles . Figure 7 compares the achieved results , in sum- mary . The left bar of every design alternative shows the needed area consumption without applying multiprocess synthesis tech- niques and ...
... achieve the same latency of 1536 clock cycles . Figure 7 compares the achieved results , in sum- mary . The left bar of every design alternative shows the needed area consumption without applying multiprocess synthesis tech- niques and ...
290. lappuse
... achieving a speedup of 6.55 and C - level partitioning achieving a speedup of 6.56 . Binary partitioning was able to achieve a similar speedup compared to C partitioning because decompilation recovered almost all important high - level ...
... achieving a speedup of 6.55 and C - level partitioning achieving a speedup of 6.56 . Binary partitioning was able to achieve a similar speedup compared to C partitioning because decompilation recovered almost all important high - level ...
297. lappuse
... achieved using the custom coprocessor ap- proach , compared to 1.58x for the HLS approach and 1.33x for the customized ... achieve exponential speedup for mi- croprocessors . Such techniques [ 19 ] include caching , pipelining ...
... achieved using the custom coprocessor ap- proach , compared to 1.58x for the HLS approach and 1.33x for the customized ... achieve exponential speedup for mi- croprocessors . Such techniques [ 19 ] include caching , pipelining ...
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