CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 82.
67. lappuse
... constraints ( dpc ) constitute the programmability constraint . The extracted operations ( op ) and conflict table ( ct ) represent the programmability . A more detailed examination of the multiple views , the tools they create and ...
... constraints ( dpc ) constitute the programmability constraint . The extracted operations ( op ) and conflict table ( ct ) represent the programmability . A more detailed examination of the multiple views , the tools they create and ...
76. lappuse
... constraints on bandwidth and latency are met . The proposed solution is fundamentally different from [ 7 , 11 , 12 , 17 , 18 , 19 ] in that mapping is no longer done prior to routing but instead during it . However , we compare UMARS ...
... constraints on bandwidth and latency are met . The proposed solution is fundamentally different from [ 7 , 11 , 12 , 17 , 18 , 19 ] in that mapping is no longer done prior to routing but instead during it . However , we compare UMARS ...
276. lappuse
... Constraint ( f ) checks that all execu- tion times are within the makespan . The problem objective is to minimize makespan . There are alternative ways of formulating the above con- straints . Constraints ( b ) , ( c ) and ( d ) could ...
... Constraint ( f ) checks that all execu- tion times are within the makespan . The problem objective is to minimize makespan . There are alternative ways of formulating the above con- straints . Constraints ( b ) , ( c ) and ( d ) could ...
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