/articles/toma

To get this branch, use:
bzr branch http://darksoft.org/webbzr/articles/toma
34 by Suren A. Chilingaryan
Fix cross-references and some latex complaints
1
\begin{algorithm}[htb]
32 by Suren A. Chilingaryan
Fix algorithms and separate them into the files as well
2
\DontPrintSemicolon
3
\caption{\label{alg:newtex4_cc} The main loop of \algorithmname~\ref{alg:newtex4} modified to cache geometrical constants in the shared memory}
4
\KwIn { Similar to \algorithmname~\ref{alg:newtex4}, but projection constants $\gmem{c}_*$ are provided in global GPU memory}
70 by Suren A. Chilingaryan
Rewrite abstract and tune to Springer
5
\KwShMem { $\shmem{\vdata{c}_{cs}}[s_p]$, $\shmem{c_{a}}[s_p]$ }
6
32 by Suren A. Chilingaryan
Fix algorithms and separate them into the files as well
7
\ForToBy{p_b}{0}{n_p}{s_p}{
57 by Suren A. Chilingaryan
Merge the changes proposed by Evelina and integrate into the full version proofs for the short version
8
  \tcc{Caching projection constants in shared memory}
32 by Suren A. Chilingaryan
Fix algorithms and separate them into the files as well
9
  $m_l \eq \vy{m_t} \mul \vx{n_t} + \vx{m_t}$ \;
10
  $\shmem{\vdata{c}_{cs}}[m_l] \eq \vlist{\gmem{c_c}[p_b + m_l], \gmem{c_s}[p_b + m_l]}$ \;
11
  $\shmem{c_a}[m_l] \eq \gmem{c_a}[p_b + m_l]$ \;
12
13
  \KwSync \;
14
57 by Suren A. Chilingaryan
Merge the changes proposed by Evelina and integrate into the full version proofs for the short version
15
  \tcc{Computing partial sums}
32 by Suren A. Chilingaryan
Fix algorithms and separate them into the files as well
16
  \ForToBy{p}{m_p}{min(s_p, n_p - p_b)}{4}{
17
    $c_s \eq \vy{\shmem{c_{cs}}[p]}$ \;
18
    $h \eq \shmem{c_a}[p] + \vx{f'_g} \mul \vx{\shmem{c_{cs}}[p]} - \vy{f'_g} \mul \vy{\shmem{c_{cs}}[p]} + \fconst{0.5}$ \;
19
    
20
	\ForTo{q}{0}{4}{
21
       $\vfloat{s}[q] \aeq $ \KwTex{$h$, $p_b + p + \fconst{0.5}$} \;
22
%       $h \seq 4 \mul \vy{\shmem{c_{cs}}[p]}$ \;
23
       $h \seq 4 \mul c_s$ \;
24
    }
25
  }
26
27
  \KwSync \;
28
}
29
\end{algorithm}