Related articles |
---|
Interprocedural optimization and code reuse ssr@stokes.princeton.edu (1991-06-25) |
Re: Interprocedural optimization and code reuse pardo@smelt.cs.washington.edu (1991-07-02) |
Re: Interprocedural optimization and code reuse rfrench@neon.Stanford.EDU (1991-07-02) |
Re: Interprocedural optimization and code reuse tseng@rice.edu (1991-07-03) |
Re: Interprocedural optimization and code reuse rbe@yrloc.ipsa.reuter.COM (1991-07-03) |
Re: Interprocedural optimization and code reuse pardo@sturgeon.cs.washington.edu (1991-07-03) |
Newsgroups: | comp.compilers |
From: | pardo@sturgeon.cs.washington.edu (David Keppel) |
Keywords: | optimize, design |
Organization: | Computer Science & Engineering, U. of Washington, Seattle |
References: | 91-07-007 91-07-013 |
Date: | Wed, 3 Jul 91 20:12:14 GMT |
I wrote:
>[Machine-dependent optimizations.]
Preston Briggs points out that traditionally `machine-dependent' has
meant *architecture*-dependent, but these days it really means both
architecture and implementation.
Examples include: cache organization, whether non-predicted branches
are implicitly predicted as taken or not taken, operation latencies,
etc.
The SPARC manual encourages programmers to make architecture-dependent
optimizations but not implementation-dependent optimizations. Consider
that optimizations for one implementation may be pessimizations for
another and that a single binary from e.g., a file server may be shared
among many machine types.
;-D on ( The Opti Miser ) Pardo
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.