Search results
Appearance
There is a page named "Talk:Loop nest optimization" on Wikipedia
- instance of Loop nest optimization but are all the described techniques instances of cache blocking? So far as I know, all cache blocking optimizations performed...6 KB (904 words) - 14:15, 5 February 2024
- I would suggest this titled "loop transformation" and let "loop optimization" as an alias to "loop nest optimization". — Preceding unsigned comment added...705 bytes (57 words) - 14:16, 5 February 2024
- all largely about the same thing: "Locality of Reference" "Loop tiling" "Loop nest optimization" You would not guess this from what each says about the others...12 KB (1,786 words) - 13:12, 5 February 2024
- 2008 (UTC) Shouldn't modern compilers already have some kind of loop unrolling optimization like this already? I don't see any advantage of using this device...37 KB (5,387 words) - 02:48, 13 October 2023
- Normally there's a "hasswapped" boolean value and a do-while loop... Not nested for loops with no breaks. 203.59.50.44 05:39, 21 February 2007 (UTC) The...52 KB (7,979 words) - 08:09, 6 April 2024
- Constant folding is the optimization done by compilers in early stage of the compilation of a program. In C it is the optimization that makes it possible...30 KB (4,554 words) - 23:27, 30 January 2024
- LAPACK with a highly optimized BLAS library can be an order of magnitude faster (or more) than textbook-style triply nested-loop linear-algebra routines...20 KB (3,189 words) - 02:59, 9 March 2024
- replaced with "tail calls optimization" here, as trampolining is about dealing with function calls when you have no (tail-call optimized) function call mechanism...13 KB (1,862 words) - 23:46, 30 January 2024
- Compilers provide extensive optimization techniques such as automatic inlining which remove part of the burden of optimization from the programmer, with...35 KB (4,881 words) - 06:35, 20 September 2010
- my defense is that the previous ones contained no arithmetic and no nested loops, and I thought both should be demonstrated. -Daniel. For what it's worth...40 KB (6,433 words) - 10:07, 7 April 2023
- say that JIT results across small domains of code, such as individual nested loops, can often be better than a similarly written program which is statically...33 KB (5,127 words) - 13:26, 27 December 2023
- belongs in an article about code/compiler optimization techniques (which is exactly what Tail call optimization is about). Merging it here is akin to merging...32 KB (4,480 words) - 02:11, 21 May 2019
- this algorithm is of complexity Big-O(N^2) or simply N^2, as they are nested loops. However, the sieve logic predetermines what the computer will or will...82 KB (12,548 words) - 16:31, 13 August 2021
- relies on a stack machine model for passing parameters" That implies all nested block structure languages are stack oriented languages and doesn't distinguish...11 KB (1,441 words) - 16:50, 9 February 2024
- org/wiki/Mandelbrot_set#Python, "Another Numpy version using masks to avoid (explicit) nested loops. Runs about 16x faster for the same resolution"). However, the actual...80 KB (11,786 words) - 00:19, 18 November 2022
- use in an article on optimization (though hopefully clarified somewhat). - Eyrian 05:30, 22 Apr 2005 (UTC) In all optimization problems, the objective...60 KB (8,407 words) - 19:12, 3 June 2024
- or more match not ; match any character. A loop matching any character except ;. Once a ; is matched the loop ends.Steamerandy (talk) 23:34, 1 February...140 KB (22,359 words) - 20:55, 7 August 2019
- running time of the Floyd-Warshall algorithm is determined by the triply nested for loops of lines 3-6. Each execution of line 6 takes O(1) time. The algorithm...43 KB (6,835 words) - 14:24, 24 January 2024
- type constraints. Specializations can be quite highly optimized, and some of this optimization is only available at runtime, not during a static compilation...39 KB (6,229 words) - 14:07, 22 December 2007
- impression of a fast process creation loop while it just demonstrates the performance of an otherwise empty echo loop. ksh93 is faster with this kind of...55 KB (8,114 words) - 01:26, 3 February 2024
- too closely on low-level optimization ( See http://c2.com/cgi/wiki?ProfileBeforeOptimizing http://c2.com/cgi/wiki?OptimizeLater ). It seems to tell people