CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.–3. rezultāts no 8.
111. lappuse
... utility ; ( 2 ) provide assurances on system - level timeliness behavior including lower bound on the sum of activities ' attained utilities ; ( 3 ) maximize the sum of activities ' attained utilities ; and ( 4 ) maximize system - level ...
... utility ; ( 2 ) provide assurances on system - level timeliness behavior including lower bound on the sum of activities ' attained utilities ; ( 3 ) maximize the sum of activities ' attained utilities ; and ( 4 ) maximize system - level ...
114. lappuse
... utility . THEOREM 5. Under conditions ( 1 ) and ( 2 ) , if a task T's TUF has a height h , then the system - level utility ratio , defined as the utility accrued by EUA with respect to the system's maximum pos- - Pihi sible utility , is ...
... utility . THEOREM 5. Under conditions ( 1 ) and ( 2 ) , if a task T's TUF has a height h , then the system - level utility ratio , defined as the utility accrued by EUA with respect to the system's maximum pos- - Pihi sible utility , is ...
115. lappuse
... Utility vs. Load Figure 4 : Normalized Energy and Utility under E3 We speculate that , the UER gap between EUA and the other schemes is because EUA saves more energy during under - loads , and accrues higher utility during overloads ...
... Utility vs. Load Figure 4 : Normalized Energy and Utility under E3 We speculate that , the UER gap between EUA and the other schemes is because EUA saves more energy during under - loads , and accrues higher utility during overloads ...
Saturs
Keynote | 1 |
DualPipeline Heterogeneous ASIP Design | 12 |
Fast CycleAccurate Simulation and Instruction Set Generation | 18 |
Autortiesības | |
28 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Bieži izmantoti vārdi un frāzes
algorithm allocation application approach array assignment benchmarks block buffer cache checksum clock compiler components Computer concurrency constraints cosimulator cost cycles data hazard dataflow deadlock decoder design space dTLB dynamic edge embedded systems energy consumption evaluate example execution exploration flash memory function hardware HW/SW IDCT IEEE implementation input instruction set interface iteration latency leakage power livelock logic loop loop fusion mapping memory objects mesochronous methodology multiprocessor node on-chip operation optimal output overhead packet parameters partitioning path performance phase pipeline platform port power consumption problem Proc processor proposed queue reconfigurable register file request requires resource RTOS scenarios scheduling Section shown in Figure signal SIMD simulation solution specification speech recognition Structured ASIC switch synchronization synthesis system-level SystemC Table technique tion type inference type schemes variables Verilog VHDL VLIW XScale