Whole-program optimization is a compilation technique in which optimizations operate over the entire program. This allows the compiler many optimization opportunities that are not available when analyzing modules separately (as with separate compilation). Most of MLton's optimizations are whole-program optimizations. Because MLton compiles the whole program at once, it can perform optimization across module boundaries. As a consequence, MLton often reduces or eliminates the run-time penalty that arises with separate compilation of SML features such as functors, modules, polymorphism, and higher-order functions. MLton takes advantage of having the entire program to perform transformations such as: defunctorization, monomorphisation, higher-order control-flow analysis, inlining, unboxing, argument flattening, redundant-argument removal, constant folding, and representation selection. Whole-program compilation is an integral part of the design of MLton and is not likely to change.
I am sure that all web hosts would like to lower the CPU load of their servers, shorten page load times, and boost overall performance. Whether it be to increase profit margin by packing in more customers or to get a Celeron 1.7Ghz handle a popular forum,
The world's fastest file manager for OS X. The world's most reliable file manager for OS X. The world's only 'Unix' file manager for OS X. Find yourself lost and frustrated with Finder? Find the alternatives too dated and too slow? Try Xfile - and take co
A. Alroomi, F. Albasri, und J. H.Talaq. International Journal on Soft Computing, Artificial Intelligence and Applications (IJSCAI), 2 (6):
20(Dezember 2013)
J. Ha, M. Arnold, S. Blackburn, und K. McKinley. Proceedings of the 24th ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications, Seite 155--174. ACM, (2009)