CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 40.
63. lappuse
... represent this programmability as a Boolean function . From this representation , we extract a subset of on - set minterms that we call minimal minterms . We prove that these minimal minterms represent the set of smallest schedulable ...
... represent this programmability as a Boolean function . From this representation , we extract a subset of on - set minterms that we call minimal minterms . We prove that these minimal minterms represent the set of smallest schedulable ...
66. lappuse
... represent programmability . 3. Representing Programmability Although we have presented and proven a general covering technique , we are most interested in how to use this technique to represent the programmability of a system . The ...
... represent programmability . 3. Representing Programmability Although we have presented and proven a general covering technique , we are most interested in how to use this technique to represent the programmability of a system . The ...
68. lappuse
... represent a function . We generated all functions up to 4 variables and a random sample of functions with 5 to 18 variables . The minimal minterms were extracted using our FMM algorithm , and the prime cube covers were found using ...
... represent a function . We generated all functions up to 4 variables and a random sample of functions with 5 to 18 variables . The minimal minterms were extracted using our FMM algorithm , and the prime cube covers were found using ...
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