CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.–3. rezultāts no 29.
122. lappuse
... optimal 1068 956 823 705 34 % 41 % 49 % 56 % Table 2 : Energy consumption of the motivation ex- ample with different schedulers . is denoted as PC - 2 . For comparison , we also list the energy number for an " optimal " scheduler which ...
... optimal 1068 956 823 705 34 % 41 % 49 % 56 % Table 2 : Energy consumption of the motivation ex- ample with different schedulers . is denoted as PC - 2 . For comparison , we also list the energy number for an " optimal " scheduler which ...
124. lappuse
... optimal algorithm [ 14 ] is used in this step to check the speed and quality of our heuristic . We have generated three task sets with TGFF , containing 5 , 10 , and 20 task graphs respectively . For every task graph , we have extracted ...
... optimal algorithm [ 14 ] is used in this step to check the speed and quality of our heuristic . We have generated three task sets with TGFF , containing 5 , 10 , and 20 task graphs respectively . For every task graph , we have extracted ...
187. lappuse
... optimal set obtained by the exploration algo- rithm is afterwards compared to the actual Pareto - optimal set using a distance function for fitness calculations . In the Sesame framework , we do not target at the problem of system ...
... optimal set obtained by the exploration algo- rithm is afterwards compared to the actual Pareto - optimal set using a distance function for fitness calculations . In the Sesame framework , we do not target at the problem of system ...
Saturs
An Efficient Retargetable Framework for InstructionSet Simulation | 13 |
Extending the SystemC Synthesis Subset by ObjectOriented Features | 25 |
Hardware Support for Realtime Operating Systems | 45 |
Autortiesības | |
19 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
abstraction adiabatic circuits algorithm analysis application approach architecture behavior buffer bytecode cache blocks cache line channel chip clock Codesign communication components computation configuration constraints core cycle decoder defined delay design space exploration device device driver DRAM DRAM row dynamic EMAC embedded systems encoder energy error estimation event example execution FIFO flash memory function global hardware IEEE implementation input instruction interface iteration Kahn Process Network latency logic minimization loop M-JPEG mapping methodology module multiple NAND Nash equilibrium Newport Beach node on-chip on-memory cache optimization output overhead packet parallel parameters partitioning performance priority Proc process network processor protocol real-time retiming RTOS model RTPN scheduling Section shown in Figure simulation solution specification speech recognition static step synchronization synthesis system level SystemC Table task graphs TCP/IP technique Technology tion TLMs tool VHDL virtual VLIW wires