CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 55.
51. lappuse
... automatic code synthesis from synchronous dataflow graphs ( SDF ) . Two previous buffer management methods , linear buffering and modulo ( or circular ) buffering , assume that samples are queued in the ... automatically synthesized code 51.
... automatic code synthesis from synchronous dataflow graphs ( SDF ) . Two previous buffer management methods , linear buffering and modulo ( or circular ) buffering , assume that samples are queued in the ... automatically synthesized code 51.
63. lappuse
... automatically generate the required software development tools and hardware implementation from this representation of programmability . Finally , we show that we can efficiently compute the minimal minterms and apply the generator ...
... automatically generate the required software development tools and hardware implementation from this representation of programmability . Finally , we show that we can efficiently compute the minimal minterms and apply the generator ...
255. lappuse
... automatically generate models and implemen- tations of system communication through refinement from an abstract description of the partitioned system processing architecture . The automatic refinement tools can produce communication ...
... automatically generate models and implemen- tations of system communication through refinement from an abstract description of the partitioned system processing architecture . The automatic refinement tools can produce communication ...
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