Newsgroups: | comp.compilers |
From: | Dirk Grunwald <grunwald@foobar.Colorado.EDU> |
Date: | Wed, 20 Jun 90 04:23:51 GMT |
Office: | 6-1 EECR (303) 492-0452 |
Organization: | Compilers Central |
Keywords: | optimize, code |
>>>>> On 14 Jun 90 15:29:39 GMT, larus@primost.cs.wisc.edu (James Larus) said:
JL> applied, programs with bounds checkings ran 0-46% slower than programs
JL> without bounds checking (down from 78-325% slower). That's a pretty
JL> [How does this compare with IBM's results? The papers I've seen on PL.8
JL> suggest that they didn't think bounds checking was very expensive. -John]
JL> --
--
markstein, cocke & markstein report figures of ~2%.
Static insn counts are...
No Check Unopt Checks Opt Checks
Matrix Multiply 2198 2358 2198
Shuttle sort 10382 11826 10583
perhaps the author of the recent paper in SIGPLAN needs to show why
their method doesn't do as well.
Dirk Grunwald -- Univ. of Colorado at Boulder (grunwald@foobar.colorado.edu)
(grunwald@boulder.colorado.edu)
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.