Your IP: United States Near: United States

Lookup IP Information

Previous 1 2 3 4 5 6 7 8 

Below is the list of all allocated IP address in - network range, sorted by latency.

Superoptimization is the task of finding the optimal code sequence for a single, loop-free sequence of instructions. While garden-variety compiler optimizations really just improve code (real-world compilers generally cannot produce genuinely optimal code), a superoptimizer's goal is to find the optimal sequence at the outset. The term superoptimization was first coined by Henry Massalin in his 1987 paper and then later developed for integration within the GNU Compiler Collection (GSO 1992). Recent work has further developed and extended this idea: (2001, 2006, 2006). Typically, superoptimization is performed via exhaustive search in the space of valid instruction sequences. While this is an expensive technique, and therefore impractical for general-purpose compilers, it has been shown to be useful in optimizing performance-critical inner loops. Recent work has used superoptimization to automatically generate general-purpose peephole optimizers. External links Publicly available superoptimizers GNU Superoptimizer (GSO) (1992) TOAST Superoptimiser (2006) The Aha! (A Hacker's Assistant) Superoptimizer (and paper about it) (2006) Stanford's Superoptimizer (2006) PIC Microcontroller SuperOptimizer (2007)