Search Results - "Baev, I.D."

Scheduling superblocks with bound-based branch trade-offs by Meleis, W.M., Eichenberger, A.E., Baev, I.D.

Get full text

Scheduling superblocks with bound-based branch trade-offs by Meleis, W.M., Eichenberger, A.E., Baev, I.D.

“…Since instruction level parallelism in basic blocks is often limited, compilers increase performance by creating superblocks that allow operations to be issued…”
Get full text

Techniques for Region-Based Register Allocation by Baev, Ivan D.

“…Register allocation is an important component of every compiler and numerous studies have investigated ways to improve allocation quality or reduce allocation…”
Get full text

Efficient backtracking instruction schedulers by Abraham, S.G., Meleis, W.M., Baev, I.D.

“…Current schedulers for acyclic regions schedule operations in dependence order and never undo a scheduling decision. In contrast, backtracking schedulers may…”
Get full text

Lower bounds on precedence-constrained scheduling for parallel processors by Baev, I.D., Meleis, W.M., Eichenberger, A.

“…We consider two general precedence-constrained scheduling problems that have wide applicability in the areas of parallel processing, high performance…”
Get full text