<html>#2832: possible race condition in LoopControl
<table style='border-spacing: 1ex 0pt; '>
<tr><td style='text-align:right'> Reporter:</td><td>Roland Haas</td></tr>
<tr><td style='text-align:right'> Status:</td><td>new</td></tr>
<tr><td style='text-align:right'>Milestone:</td><td></td></tr>
<tr><td style='text-align:right'> Version:</td><td></td></tr>
<tr><td style='text-align:right'> Type:</td><td>bug</td></tr>
<tr><td style='text-align:right'> Priority:</td><td>major</td></tr>
<tr><td style='text-align:right'>Component:</td><td></td></tr>
</table>
<p>Comment (by Erik Schnetter):</p>
<p>We don’t need <code>new</code> or <code>std::vector</code>. We replace the call to <code>new</code> with <code>posix_memalign</code>, and the call to <code>delete</code> by <code>free</code>. Then each thread has one cache line as intended.</p>
<p>Alternatively, there could be one call to <code>posix_memalign</code> allocating memory for all threads, and each thread uses pointer arithmetic to find its place.</p>
<p>--<br/>
Ticket URL: <a href='https://bitbucket.org/einsteintoolkit/tickets/issues/2832/possible-race-condition-in-loopcontrol'>https://bitbucket.org/einsteintoolkit/tickets/issues/2832/possible-race-condition-in-loopcontrol</a></p>
</html>