Basic MBF Blocks Properties and Rank 6 Blocks

Instruction Scheduling Beyond Basic Blocks

Instruction scheduling consists of the rearrangement or transformation of program statements, usually at the intermediate language or assembly code level, in order to reduce possible run-time delays between instructions. Such transformations must preserve data dependency and are subject to other constraints. Highly optimizing compilers employing instruction-scheduling techniques have proven to ...

Globalization And Inequality In Different Economic Blocks

Experimental Study of Register Saturation in Basic Blocks and Super-Blocks: Optimality and heuristics

Register saturation (RS) is the exact maximal register need of all valid schedules of a data dependence graph [4]. Its optimal computation is NP-complete. This report proposes two variants of heuristics for computing the acyclic RS of directed acyclic graphs (DAG). The first one improves the previous greedy-k heuristic [4] in terms of approximating the RS with equivalent computation times. The ...

Low energy register allocation beyond basic blocks

An approach of doing register allocation beyond basic blocks for low energy is presented in this paper. With careful analysis of boundary conditions between consecutive blocks, our approach achieves the allocation results benefiting the whole program. By allowing the allocation results to propagate down block by block without backtracking, we avoid excessive computational cost.

Efficient Register Allocation for Large Basic Blocks

We consider the NP{complete problem of generating evaluations for expression DAGs with a minimalnumber of registers. We restrict our attention to contiguous evaluations, because for nearly all of the DAGs derived from real application programs there exists a contiguous evaluation that is optimal w.r. to the register need. We present an algorithm that generates an optimal contiguous evaluation f...