Computing maximal register pressure of a DAG

Touati Sid <touati@prism.uvsq.fr>
14 Apr 2006 12:47:02 -0400

          From comp.compilers
Related articles
Computing maximal register pressure of a DAG touati@prism.uvsq.fr (Touati Sid) (2006-04-14)
Is a reducable flow graph necessary? derek@knosof.co.uk (Derek M. Jones) (2006-04-14)
| List of all articles for this month |
From: Touati Sid <touati@prism.uvsq.fr>
Newsgroups: comp.compilers
Date: 14 Apr 2006 12:47:02 -0400
Organization: Universite de Versailles Saint-Quentin-en-Yvelines
Keywords: registers, optimize, available
Posted-Date: 14 Apr 2006 12:47:02 EDT

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),


The software binary (under linux/x86) can be downloaded from :
http://www.prism.uvsq.fr/~touati/sw/DDG/RS


The source files (including documentation and examples) can be retrieved
from :
http://www.prism.uvsq.fr/~touati/sw/DDG




S


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.