CODES+ISSSACM Press, 2004 |
No grāmatas satura
1.–3. rezultāts no 36.
38. lappuse
... edge eo . Our solution is , for a given candidate edge and candidate variables , to perform abstract interpretation once for each condition in ( 2 ) . During each successive instance of abstract interpretation we compute approximations ...
... edge eo . Our solution is , for a given candidate edge and candidate variables , to perform abstract interpretation once for each condition in ( 2 ) . During each successive instance of abstract interpretation we compute approximations ...
106. lappuse
... edge based formulation enables the efficient determination of the optimal points for the spill code in- sertion . We define the following static attributes ( AttribSTATIC ) for every memory object on each edge of the CFG . AttribSTATIC ...
... edge based formulation enables the efficient determination of the optimal points for the spill code in- sertion . We define the following static attributes ( AttribSTATIC ) for every memory object on each edge of the CFG . AttribSTATIC ...
191. lappuse
... edge with the edge weight ( eweight ) . It quantifies each edge with the number of times that the compiler sched- ules accesses to the corresponding data structures in parallel . This number is a side - product of the greedyloopfusion ...
... edge with the edge weight ( eweight ) . It quantifies each edge with the number of times that the compiler sched- ules accesses to the corresponding data structures in parallel . This number is a side - product of the greedyloopfusion ...
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