|Release of RSlib 1.1 SidTouati@inria.fr (Sid Touati) (2009-11-30)|
|From:||Sid Touati <SidTouati@inria.fr>|
|Date:||Mon, 30 Nov 2009 16:28:11 +0100|
|Organization:||INRIA - CR Paris-Rocquencourt|
|Posted-Date:||30 Nov 2009 23:53:12 EST|
Register saturation (RS) is the exact maximal register need of all
valid schedules of a data dependence graph. Its optimal computation is
NP-complete. This report proposes two variants of heuristics for
computing the acyclic RS of directed acyclic graphs (DAG of basic
blocks and super-blocks). The first one improves the previous greedy-k
heuristic in terms of approximating the RS with equivalent computation
times. The second heuristic is faster, has better RS approximation
than greedy-k, but scarifies the computation of saturating values.
Our RS computation methods are distributed as a C independent library
(RSlib) under LGPL licence.
Working software (free sources), experimental data and full report
Return to the
Search the comp.compilers archives again.