Questions tagged [program-optimization]
Questions about how to optimise a program's performance, both manually and automatically, e.g. in compilers.
81
questions
0
votes
0
answers
16
views
What is the difference between sparse conditional constant propagation and constant propagation?
Reading the Wikipedia pages on these topics, it seems that sparse conditional constant propagation (SCCP) is a more powerful form of constant propagation (CP)? E.g all optimizations available in CP ...
- 959
1
vote
1
answer
21
views
Encoding Turing machine-like behavior using families of sequences of vector spaces and modules. P=NP related
Let $F$ be a field. Suppose we have a machine $T$ that works with words that are elements of $F$, for exmaple $F = \Bbb{Z}/2, \Bbb{Q}$ (using arbitrary precision arithmetic), or $\Bbb{Z}/p$ for a ...
0
votes
0
answers
22
views
How to write code for levy flight in cuckoo search
I want to write levy flight random number distribution code for cuckoo search optimization. So how to select randomly two instances from set of instances by levy flight.
1
vote
0
answers
23
views
How is a homeomorphic embedding a homeomorphism?
How is a homeomorphic embedding (in the sense of term algebra) a homeomorphism?
Definition of homeomorphic embedding:
Alt text:
...
- 276
0
votes
1
answer
39
views
Why do the following algorithms for Quadratic Primes perform so differently?
I'm trying to solve for https://projecteuler.net/problem=27, and I have to optimize one part of the implementation from slow() to fast(). Why do they perform so differently? I'm guessing branch ...
- 1
0
votes
1
answer
36
views
SVMs - Fat (Margin) Boundary: Why is $\max\frac1{||\theta||}=\min \frac{ ||\theta||^2}{2}$?
I am trying to understand SVMs in depth watching lectures from MIT.
The professor to reduces the classification problem into an optimization problem. To do that, he first defines the decision and ...
0
votes
1
answer
300
views
What is the difference between speculative execution & branch prediction?
In computer architecture I'm confused between speculative execution & branch prediction. Are the same or different?
- 101
10
votes
1
answer
1k
views
What is the name of this type of program optimization where two loops operating over common data are combined into a single loop?
On an imperative programming language, let us consider the following program:
...
- 123
1
vote
1
answer
57
views
optimizing the calculation of $\sum^n_{k=2} p(\Omega(k))\Omega(k)$
I want to optimize an algoritm for calculating $g(n)=\sum^n_{k=2} p(\Omega(k))\Omega(k)$
where $$ p(n) =
\begin{cases}
1 &\text{if $n$ is odd} \\
-1 &\text{if $n$ is even}
\end{cases}$$
and $...
- 113
6
votes
2
answers
192
views
Does strong typing contribute to better performance optimization by compiler?
Do guarantees provided by the type systems enable better performance optimizations by the modern compilers? I found a 20+ year article suggesting that it would. Also, intuitively speaking, knowing ...
- 231
3
votes
1
answer
104
views
Algorithm to find the minimum (additional) popular votes to win the electoral college
So I'm thinking of a simple election prediction program to keep track of the minimum ballots the candidates must gain from the uncounted votes in order to win the election.
Assuming we are considering ...
- 31
0
votes
1
answer
82
views
Is there a way to combine linear equation and inequalities into same equation in order to optimise software calculations?
I’m programming web application which has some tricky calculations and I would need some help with mathematical calculations.
What I'm trying to calculate:
I have number of items. Lets call items a1, ...
0
votes
1
answer
98
views
Minimizing series of XORs
Suppose you receive a list of $n$ instructions on $k$ boolean variables where each instruction has the form
$$x_i \leftarrow x_i \oplus x_j,$$
(where $\oplus$ is the binary XOR) can we efficiently ...
- 12.3k
3
votes
1
answer
51
views
How to best calculate the best possible path with weights
Given a set of nodes, with connections in certain directions (see image), what is the most coins you can collect between the first and last given node. Not all rooms have coins, and we want to output ...
- 33
1
vote
0
answers
82
views
Is this a valid heuristic for Dots and Boxes to reduce the branching factor of the search tree?
I am implementing an AI based on the MiniMax algorithm that plays the game Dots and Boxes. I would like to reduce the branching factor of the search tree, by introducing a heuristic rule that limits ...
- 145
4
votes
0
answers
128
views
Rectangle Packing with Constraints
I am aware that the general rectangle packing problem is NP-hard. I am trying to form an estimate for a version of the problem with constraints. Consider fitting rectangles of smaller size into a ...
- 41
2
votes
0
answers
52
views
Compiler optimization which does an SMT-like optimization in software?
Say I had two functions called one after the other:
...
- 148
2
votes
2
answers
622
views
Big-O Notation and Calculus?
I was wondering if there are any calculus relationships implicit in Big-O notation.
For example, an algorithm linear according to Big-O notation reduces the size of the problem by a constant amount ...
- 21
1
vote
0
answers
109
views
Tree Optimization, Combinatorics, algorithm [closed]
My Partners and me, we are trying to optimize frequency process...
I used Java to show our Problem, but the question is about algorithm NOT about Java implementation. Although implementations in java ...
- 111
0
votes
1
answer
432
views
Autocorrect algorithm - How to implement a decent "apostrophe & elision" feature?
shorter version of the original question (as requests in comments)
What is the algorithm to handle missing apostrophe as it is done in auto-correct feature of Android virtual keyboard?
(If it helps /...
- 103
1
vote
0
answers
44
views
Order of Traversal in Bidirectional Dataflow Analysis
Does order of traversing CFG matter in solving bidirectional dataflow problems, from a performance perspective?
- 111
0
votes
1
answer
152
views
Any CPUs using value prediction, dynamic instruction reuse?
There is a lot of research about techniques that try to reuse the previous result of an instruction, either memory loads or arithmetic, such as dynamic instruction reuse, value prediction, based on ...
- 101
2
votes
1
answer
97
views
Optimize sorting matrix entries by row and column
I am writing a routine to store an $M$-by-$N$ sparse matrix in a balanced binary tree. The insertion routine calls a comparison function to determine where a new matrix entry $(i,j)$ should be ...
- 208
4
votes
1
answer
111
views
Is there an algorithm that can find a solution that solves the most number of equations in a linear system of equations?
My apologies if this question makes no sense. I am trying to find an algorithm that can solve a linear system of equations. Unlike most problems like this, this algorithm does not need to find a ...
- 43
0
votes
1
answer
310
views
Is the spigot algorithm for $\pi$ useful for computing all the digits of $\pi$?
I'm asking the question here because it's not a purely mathematical question and the answer also depends on how computers work. I think that according to the Wikipedia article Bailey–Borwein–Plouffe ...
- 115
20
votes
12
answers
12k
views
Data structure or algorithm for quickly finding differences between strings
I have an array of 100,000 strings, all of length $k$. I want to compare each string to every other string to see if any two strings differ by 1 character. Right now, as I add each string to the ...
- 311
0
votes
2
answers
528
views
Calculate the number of trailing zeros in equation f(n) = f(n-1) * f(n-2) where f(0) and f(1) are any given arbitary numbers
This question is doable if you can calculate the number by multiplying f(n-1) and f(n-2).
Is it possible to do this question if we entirely want to skip ...
- 119
4
votes
0
answers
47
views
Symbolic Math Systems As Speculative Optimization For Numerical Software?
Has there been published work on hiding symbolic math within numeric software, partitioning parallel processes between speculative symbolic optimization search and numeric evaluations?
Real world ...
- 378
3
votes
1
answer
288
views
How to avoid permutations in the n-Queens problem?
EDIT: if you are not familiar with the problem and the solution, it's nicely explained here.
I have solved the n-Queens problem as an exercise using backtracking (recursion), but the problem I have ...
- 279
1
vote
3
answers
96
views
Automatic softcore configuration based on intermediate representation (IR) compiler output
When compiling a piece of software (with LLVM for exmple), you first transform your code into some kind of intermediate representation (IR code). This IR code needs to be converted to your target ...
- 19
0
votes
1
answer
434
views
Is there a poly-time algorithm for expanding out polynomials
so I've been looking around and haven't seen this before. Basically I'm working with a problem in which I need to expand/FOIL out. Something in the form of
$$
z = (x+y)(x-y) \implies x^2+xy-xy+y^2
$$
...
- 519
0
votes
0
answers
22
views
Non-optimal program, bad choice of language or Low-speed system?
To check some results of an article, I wrote the proposed algorithm from the Coding articles. In the article, some results from the algorithm were obtained. Unfortunately, the performance of my ...
0
votes
0
answers
479
views
Why is sequential search of ordered list slower than search of unordered one
I have got assignment to implement set class with linked list, so I first made it with unordered list and time needed to insert million integers is bit less than hour. Then I thought I can get it to ...
- 1
15
votes
2
answers
1k
views
What property of cons allows elimination of tail recursion modulo cons?
I'm familiar with the idea of basic tail recursion elimination, where functions that return the direct result of a call to themselves can be rewritten as iterative loops.
...
- 253
3
votes
4
answers
134
views
Can loops like this one be algorithmically transformed into multiplication
Are there known techniques for converting a loop like the following to an if and a multiplication?
...
- 352
3
votes
0
answers
101
views
Lazy evaluation on slow Boolean functions (optimization)
Short-circuit evaluation is a straight forward subject for lazy evaluation on Boolean expressions, I noted that two factors could be useful in ordering Boolean functions to improve run-time. But this ...
- 195
-1
votes
1
answer
11k
views
How do I calculate the speedup properly?
I am trying to calculate the speedup of this, but I am getting the wrong answer:
Assuming that we have a program where we have two execution phases. One phase takes 1 time unit to execute and can ...
- 1
2
votes
1
answer
839
views
Why is it so difficult to eliminate dead loops?
I recently came across an issue where my compiler was not able to eliminate some "obviously" dead code - it was a function that returned nothing, with no side effects, and a cursory analysis of the ...
- 139
8
votes
3
answers
7k
views
Constant folding vs. Constant propogation
What is the difference between constant folding and constant propogation? They both seem to do the same thing, instead of saving constants into stack or evaluating a full arithmetic expression, they ...
- 315
3
votes
2
answers
283
views
Is writing a compiler for a compact language easier?
I am contemplating the project of writing a compiler. I am wondering if, aside from the availability of easy google results, it is easier to write a compiler for a more explicit/verbose language such ...
- 205
4
votes
1
answer
118
views
What formal representation is commonly used to describe compiler optimizations?
I have devised a compiler optimization that works on any structured language that has arrays assignments array[index] = value and counted loops ...
- 333
1
vote
0
answers
30
views
Program Transformation to Disintermediate Isomorphic Representation Transforms
Given two representations of the same abstract data type, any optimal program that incorporates one representation has a corresponding optimal program that incorporates the other.
What is the field ...
- 378
19
votes
2
answers
4k
views
Why is static-single assignment preferred over continuation passing style in many industry-used compilers?
According to the Wikipedia page on static-single assignment (SSA), SSA is used by large and well-known projects such as LLVM, GCC, MSVC, Mono, Dalvik, SpiderMonkey, and V8 while the page on projects ...
- 552
2
votes
1
answer
1k
views
Is it possible to submit every March Madness bracket?
A few years ago Warren Buffett started offering $1 billion to anyone who could correctly predict the winner of every game in the NCAA men's basketball tournament. A 64 team (we won't count the first ...
1
vote
3
answers
515
views
Match dictionary to misspelled word, corner cases
I'm trying to think of corner-cases where I can skip having to linear-search through my dictionary in my problem; For a given word w1, find all matches with the least editing distance from it in the ...
- 265
1
vote
1
answer
383
views
Identify similar functions
I was wondering if there is any technique in order to recognize similar functions behaviour. In particular, suppose that I implement two functions $f$ and $g$ in a certain programming language $P$ and ...
- 111
1
vote
0
answers
2k
views
How to use Clarke and Wright saving algorithm to afford heterogeneous fleet?
I want to solve Heterogeneous fleet in vehicle routing problem using the Clarke and Wright saving algorithm. After reading many literature I found two options:
Explicit and early assignment for the ...
6
votes
2
answers
846
views
generating pi using Machin like formula
Back in 2002, using this arctan formula for pi discoverd by Stoemer:
$$ \pi = 176 \arctan(1/57) + 28 \arctan(1/239) - 48 \arctan(1/682) \\ +
96 \arctan(1/12943)$$
and I assume using this ...
- 324
3
votes
1
answer
847
views
Can you solve 3D Tic Tac Toe with Minimax?
I have implemented a 3d Tic Tac Toe game with AI, where the computer is unbeatable.
The only thing is that the board looks like this:
_ _ _
_ _
_ _ _
rather ...
- 31
7
votes
1
answer
289
views
Reference request: optimizing procedures on lists in dynamic languages by performing safety checks in advance
For my science fair project, I implemented an optimization to Python's sort routine. The idea is to move the safety checks that have to be carried out during each comparison, e.g. type checks and ...
