space vs. speed optimization

Dale Worley <think!compass!>
Mon, 8 Aug 88 12:03:15 EDT

          From comp.compilers

Related articles
space vs. speed optimization think!compass! (Dale Worley) (1988-08-08)
| List of all articles for this month |

Date: Mon, 8 Aug 88 12:03:15 EDT
From: Dale Worley <think!compass!>

There was a paper that suggested dynamically adjusting space vs. time
tradeoffs by assuming a model:

cost = A * space + B * time + C * space * time

then, based on the measured execution frequencies of various parts of
the program, the compiler could choose the least-cost code. This is a
real win relative to the usual strategy, because frequently-called
code was optimized for speed, and infrequently-called code was
optimized for size. And, as the author pointed out, programmers don't
generally know which is the better tradeoff in every case.

[From Dale Worley <think!compass!>]

Post a followup to this message

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