Reordering of functions

Tim Frink <>
Mon, 18 Feb 2008 17:22:52 +0100

          From comp.compilers

Related articles
Reordering of functions (Tim Frink) (2008-02-18)
Re: Reordering of functions (Nikolai Kim) (2008-02-18)
Re: Reordering of functions (Joel Yliluoma) (2008-02-19)
Re: Reordering of functions (Chris F Clark) (2008-02-19)
Re: Reordering of functions (glen herrmannsfeldt) (2008-02-20)
Re: Reordering of functions (Tim Frink) (2008-02-21)
Re: Reordering of functions (Tim Frink) (2008-02-21)
[5 later articles]
| List of all articles for this month |

From: Tim Frink <>
Newsgroups: comp.compilers
Date: Mon, 18 Feb 2008 17:22:52 +0100
Organization: CS Department, University of Dortmund, Germany
Keywords: optimize, question
Posted-Date: 18 Feb 2008 13:09:10 EST


I've a question about the influence of compiler optimizations that
reorder functions on the system performance.

Assume a modern processor with all state-of-the art features like
prefetching, branch prediction and a superscalar pipeline. Further
assume that all caches are disabled. Will the program runtime change
when just the order of functions is changed (without any other code

I'm of the opinion that a reordering of function should have little
influence on the program execution, maybe due to some prefetch effects
but thes should be marginal. Of course, with caches this situation
would look different.

How do you see that?


Post a followup to this message

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