Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!mit-eddie!snorkelwacker!spdcc!esegue!compilers-sender
From: gateley@m2.ti.com (John Gateley)
Newsgroups: comp.compilers
Subject: "Probabilistic" optimizations
Message-ID: <1990Feb28.052033.5517@esegue.segue.boston.ma.us>
Date: 28 Feb 90 05:20:33 GMT
Sender: compilers-sender@esegue.segue.boston.ma.us
Reply-To: gateley@m2.ti.com (John Gateley)
Organization: TI Computer Science Center, Dallas
Lines: 16
Approved: compilers@esegue.segue.boston.ma.us

I am looking for references on compiler optimizations based on
the frequency of IF/CASE branches. Please email and I will post a summary.

Thanks,

John
gateley@m2.csc.ti.com
[The original Fortran compiler had a FREQUENCY statement that let you
tell it the relative likelihood that each of the three branches of an IF
would be taken or the typical number of times that a DO loop would run.  It
turned out to be so useless that it disappeared by the time they came up
with Fortran II.  I haven't looked for more recent references,  -John]
-- 
Send compilers articles to compilers@esegue.segue.boston.ma.us
{spdcc | ima | lotus}!esegue.  Meta-mail to compilers-request@esegue.
Please send responses to the author of the message, not the poster.