Groups | Search | Server Info | Keyboard shortcuts | Login | Register
Groups > comp.compilers > #2744
| From | gah4 <gah4@u.washington.edu> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Re: Modern compilers for ye olde architectures |
| Date | 2021-10-21 21:53 -0700 |
| Organization | Compilers Central |
| Message-ID | <21-10-037@comp.compilers> (permalink) |
| References | <21-10-007@comp.compilers> <21-10-012@comp.compilers> <21-10-015@comp.compilers> <21-10-024@comp.compilers> <21-10-034@comp.compilers> |
On Thursday, October 21, 2021 at 5:08:46 PM UTC-7, Philipp Klaus Krause wrote: (snip) > On one hand, we have the theoretical bound on the number of assignments, > which is useful for proving that we can be optimal in polynomial time. > On the other hand, getting a provably optimal result when compiling an > individual function is something that is easier to achieve, as the > theoretical bound is a worst case. This is reminding me that early Fortran compilers had a FREQUENCY statement (optionally) telling the compiler the relative probability of branching for IF statements, and the estimated iterations for DO loops. It was removed before the first standard in 1966. The above methods might be fine on a small scale, but for more global optimization you need the relative probabilities. I suspect that everyone assumes equal probabilities for everything. I suspect that there is no interest in bringing FREQUENCY back to Fortran, or any other language, though. [Legend says that in at least one compiler, FREQUENCY was implemented backward and nobody noticed. -John]
Back to comp.compilers | Previous | Next — Previous in thread | Next in thread | Find similar
Modern compilers for ye olde architectures "Luke A. Guest" <laguest@archeia.com> - 2021-10-05 13:22 +0100
Re: Modern compilers for ye olde architectures David Brown <david.brown@hesbynett.no> - 2021-10-05 19:59 +0200
Re: Modern compilers for ye olde architectures Hans-Peter Diettrich <DrDiettrich1@netscape.net> - 2021-10-05 22:12 +0200
Re: Modern compilers for ye olde architectures Derek Jones <derek@NOSPAM-knosof.co.uk> - 2021-10-06 01:26 +0100
Re: Modern compilers for ye olde architectures "Luke A. Guest" <laguest@archeia.com> - 2021-10-06 09:00 +0100
Re: Modern compilers for ye olde architectures anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2021-10-06 07:56 +0000
Re: Modern compilers for ye olde architectures Philipp Klaus Krause <pkk@spth.de> - 2021-10-06 18:20 +0200
Re: Modern compilers for ye olde architectures anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2021-10-15 07:37 +0000
Re: Modern compilers for ye olde architectures Philipp Klaus Krause <pkk@spth.de> - 2021-10-18 08:35 +0200
Re: Modern compilers for ye olde architectures Philipp Klaus Krause <pkk@spth.de> - 2021-10-18 08:56 +0200
Re: Modern compilers for ye olde architectures Philipp Klaus Krause <pkk@spth.de> - 2021-10-18 09:17 +0200
Re: Modern compilers for ye olde architectures gah4 <gah4@u.washington.edu> - 2021-10-21 21:53 -0700
Re: Modern compilers for ye olde architectures Kaz Kylheku <480-992-1380@kylheku.com> - 2021-10-22 17:28 +0000
Re: Modern compilers for ye olde architectures dave_thompson_2@comcast.net - 2021-11-14 15:04 -0500
Re: Modern compilers for ye olde architectures Theo <theom+news@chiark.greenend.org.uk> - 2021-10-06 10:36 +0100
Re: Modern compilers for ye olde architectures "Luke A. Guest" <laguest@archeia.com> - 2021-10-06 16:20 +0100
csiph-web