Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
sav08:chaotic_iteration_in_abstract_interpretation [2008/05/20 12:46] vkuncak |
sav08:chaotic_iteration_in_abstract_interpretation [2008/05/20 12:56] vkuncak |
||
---|---|---|---|
Line 37: | Line 37: | ||
Questions: | Questions: | ||
- | * What is the cost of doing one chaotic versus one parallel iteration? | + | * What is the cost of doing one chaotic versus one parallel iteration? ++|chaotic is $n$ times cheaper++ |
* Does chaotic iteration converge if parallel converges? | * Does chaotic iteration converge if parallel converges? | ||
* If it converges, will it converge to same value? | * If it converges, will it converge to same value? | ||
* If it converges, how many steps will convergence take? | * If it converges, how many steps will convergence take? | ||
+ | * What is a good way of choosing index $i$ (iteration strategy), example: round robin (take permutation of all indices) | ||
+ | |||
+ | $I,L_1,L_2,\ldots,L_n,\ldots,$ be vectors of values $(g^k_1,\ldots,g^k_n)$ in parallel iteration and | ||
+ | |||
+ | $I,C_1,C_2,\ldots,C_n,\ldots,$ be vectors of values $(g^k_1,\ldots,g^k_n)$ in chaotic iteration | ||
+ | |||
+ | (starting from the same initial lattice value $I$) | ||
+ | |||
+ | Compare values $I$, $L_1$, $C_1$, $I_n$, $C_n$ in the lattice | ||
+ | * in general | ||
+ | * for round robin | ||
===== References ===== | ===== References ===== |