CODES+ISSSACM Press, 2003 |
No grāmatas satura
1.–3. rezultāts no 29.
87. lappuse
... tasks in a task graph belong to the same domain ) . The order in which task graphs are moved is based on a priority function that captures the mobility of tasks in the graph : 1 RelAvgMob ( ) = Σ ni j = 1 D - ASAP ij ij Cij where n ; is ...
... tasks in a task graph belong to the same domain ) . The order in which task graphs are moved is based on a priority function that captures the mobility of tasks in the graph : 1 RelAvgMob ( ) = Σ ni j = 1 D - ASAP ij ij Cij where n ; is ...
89. lappuse
Time ( s ) 1200 1000 800 1800 120 tasks , 24 task graphs Step 2 succeeds → 1600 6 nodes ( 60 % avg . utilization ) Step 2 fails + 200 40 tasks 10 unmapped tasks 1400 600 400 200 Time ( s ) 150 100 60 % avg . processor utilization Step ...
Time ( s ) 1200 1000 800 1800 120 tasks , 24 task graphs Step 2 succeeds → 1600 6 nodes ( 60 % avg . utilization ) Step 2 fails + 200 40 tasks 10 unmapped tasks 1400 600 400 200 Time ( s ) 150 100 60 % avg . processor utilization Step ...
121. lappuse
Task Graph 3 Task Graph O Task Graph 2 Task Graph 1 Task Graph 4 Energy consumption ( n ) 350 300- 250 200 150 100 ... graphs , denoted from 0 to 4. The details of those task graphs can be found in Tab . 1 , in which the first TGO TG1 ...
Task Graph 3 Task Graph O Task Graph 2 Task Graph 1 Task Graph 4 Energy consumption ( n ) 350 300- 250 200 150 100 ... graphs , denoted from 0 to 4. The details of those task graphs can be found in Tab . 1 , in which the first TGO TG1 ...
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