Contemporary compilers are capable of performing a wide variety of optimizations on the code they produce. Quite a bit of effort goes into these optimization passes, with different compiler projects competing to produce the best results for common code patterns. But the nature of current hardware is such that some optimizations can have surprising results; that is doubly true when kernel code is involved, since kernel code is often highly performance-sensitive and provides an upper bound on the performance of the system as a whole. A recent discussion on the best optimization approach for the kernel shows how complicated the situation can be.
-
Discovery is not search
-
Session State Management in Windows Azure Web Roles
-
Is there an Uncanny Valley of Machine Intelligence?
-
How app developers can get their pots of gold
-
Entity Framework Patterns extension and Unit Test in Visual Studio 2012
-
Lions, and Tigers, and OP Codes, OH MY! – Hacking Java Bytecode for Programmers (Part2)
Add your comment
