Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.compilers    |    Compiler construction, theory, etc. (Mod    |    2,753 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 1,228 of 2,753    |
|    Tim Frink to All    |
|    Reordering of functions    |
|    18 Feb 08 17:22:52    |
      From: plfriko@yahoo.de              Hi,              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       transformation)?              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?              Regards,       Tim              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca