We are pleased to inform the release of a software computing the acyclic
register saturation. Given a directed acyclic graph (DAG) representing
data dependences, the released software computes the exact maximal
register pressure (called register saturation) for any instruction
schedule independently of hardware architectural properties.
That is to say, for a given DAG with a computed register saturation
equal to RS, we can guarantee that there is always a schedule for any
processor requiring RS registers (sequential schedule at extreme case),