<div dir="ltr">... and tested on our supported compilers, once we have our new testing support levels decided.<div><br></div><div>Mark</div></div><br><div class="gmail_quote"><div dir="ltr">On Fri, Sep 4, 2015 at 12:05 PM Berk Hess <<a href="mailto:hess@kth.se">hess@kth.se</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Hi,<br>
<br>
They should not only be aligned at the start, but also padded at the end<br>
up to SIMD register width alignment such that SIMD loops can read and<br>
write without masking at the end.<br>
<br>
Cheers,<br>
<br>
Berk<br>
<br>
On 2015-09-04 12:01, Erik Lindahl wrote:<br>
> Hi,<br>
><br>
> Yes, aligned allocators should be on our todo-list :-)<br>
><br>
> Cheers,<br>
><br>
> ERik<br>
><br>
>> On 04 Sep 2015, at 11:57, David van der Spoel <<a href="mailto:spoel@xray.bmc.uu.se" target="_blank">spoel@xray.bmc.uu.se</a>> wrote:<br>
>><br>
>> With the impending requirement of C++11 the use of NULL is deprecated (as I just found out). However we still are dependent on smalloc and friends to give us aligned memory for the inner loops, which means we have to deal with malloc and free for handling pointers.<br>
>><br>
>> The stackoverflow page below suggests a way of aligning std::vector under the hood, which would have the advantage that we could use std::vector without having to worry about memory management. Is that something we should consider?<br>
>><br>
>> <a href="http://stackoverflow.com/questions/8456236/how-is-a-vectors-data-aligned" rel="noreferrer" target="_blank">http://stackoverflow.com/questions/8456236/how-is-a-vectors-data-aligned</a><br>
>><br>
>> --<br>
>> David van der Spoel, Ph.D., Professor of Biology<br>
>> Dept. of Cell & Molec. Biol., Uppsala University.<br>
>> Box 596, 75124 Uppsala, Sweden. Phone: +46184714205.<br>
>> <a href="mailto:spoel@xray.bmc.uu.se" target="_blank">spoel@xray.bmc.uu.se</a> <a href="http://folding.bmc.uu.se" rel="noreferrer" target="_blank">http://folding.bmc.uu.se</a><br>
>> --<br>
>> Gromacs Developers mailing list<br>
>><br>
>> * Please search the archive at <a href="http://www.gromacs.org/Support/Mailing_Lists/GMX-developers_List" rel="noreferrer" target="_blank">http://www.gromacs.org/Support/Mailing_Lists/GMX-developers_List</a> before posting!<br>
>><br>
>> * Can't post? Read <a href="http://www.gromacs.org/Support/Mailing_Lists" rel="noreferrer" target="_blank">http://www.gromacs.org/Support/Mailing_Lists</a><br>
>><br>
>> * For (un)subscribe requests visit<br>
>> <a href="https://maillist.sys.kth.se/mailman/listinfo/gromacs.org_gmx-developers" rel="noreferrer" target="_blank">https://maillist.sys.kth.se/mailman/listinfo/gromacs.org_gmx-developers</a> or send a mail to <a href="mailto:gmx-developers-request@gromacs.org" target="_blank">gmx-developers-request@gromacs.org</a>.<br>
<br>
--<br>
Gromacs Developers mailing list<br>
<br>
* Please search the archive at <a href="http://www.gromacs.org/Support/Mailing_Lists/GMX-developers_List" rel="noreferrer" target="_blank">http://www.gromacs.org/Support/Mailing_Lists/GMX-developers_List</a> before posting!<br>
<br>
* Can't post? Read <a href="http://www.gromacs.org/Support/Mailing_Lists" rel="noreferrer" target="_blank">http://www.gromacs.org/Support/Mailing_Lists</a><br>
<br>
* For (un)subscribe requests visit<br>
<a href="https://maillist.sys.kth.se/mailman/listinfo/gromacs.org_gmx-developers" rel="noreferrer" target="_blank">https://maillist.sys.kth.se/mailman/listinfo/gromacs.org_gmx-developers</a> or send a mail to <a href="mailto:gmx-developers-request@gromacs.org" target="_blank">gmx-developers-request@gromacs.org</a>.<br>
</blockquote></div>