CODES+ISSSACM Press, 2005 |
No grāmatas satura
1.–3. rezultāts no 82.
70. lappuse
... given a particular application characterized by G = G ( C , A ) or G ' = G ' ( T , D ) ( definitions 1 and 2 ) . This design problem can be divided into four separate subproblems ( P1 - P4 ) which are addressed next . 3.1 P1 : The ...
... given a particular application characterized by G = G ( C , A ) or G ' = G ' ( T , D ) ( definitions 1 and 2 ) . This design problem can be divided into four separate subproblems ( P1 - P4 ) which are addressed next . 3.1 P1 : The ...
234. lappuse
... given k , there exists some upper- bound Nk , such that the optimal tree has k or fewer levels if the number of concurrent accesses is Nk . As a corollary , for a given N ' , we can also find an upper - bound k ' for the search space ...
... given k , there exists some upper- bound Nk , such that the optimal tree has k or fewer levels if the number of concurrent accesses is Nk . As a corollary , for a given N ' , we can also find an upper - bound k ' for the search space ...
275. lappuse
... given application graph , we can restate the throughput maximization objective as minimizing the makespan of the system . The makespan of a schedule is the latest completion time for any task in it . Given a valid configuration ...
... given application graph , we can restate the throughput maximization objective as minimizing the makespan of the system . The makespan of a schedule is the latest completion time for any task in it . Given a valid configuration ...
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