News for hackers. Stuff that matters.
Re:Increasing the D Compiler Speed by Over 75% by WalterBright on Thursday July 25, 2013 @04:46PM (#6104868)
I haven't spent much time looking into cache effects in the compiler's internal data structures, that gold hasn't been mined yet.
Re:Increasing the D Compiler Speed by Over 75% by p0nce on Thursday July 25, 2013 @08:12PM (#6105827)
Some ideas (at least on x86):

- alignment greater than 16-bytes, eg. 128 bytes for isolated buffers.

- the hardware prefetcher like to load cachelines around the memory actually accessed, just in case. So data chunks that will be accessed at the same time better be near each other to save cache usage a bit.

- memory access which does not have a simple pattern is slower than one which is contiguous or have a simple stride.

Re:Increasing the D Compiler Speed by Over 75% by acqq on Thursday July 25, 2013 @05:34PM (#6105153)
I just wanted to say that when allocations are very cheap and kept "near" keeping lists of elements linked from the hash array (http://en.wikipedia.org/wiki/Hash_table#Separate_chaining) instead of keeping all the elements in the hash array itself (http://en.wikipedia.org/wiki/Hash_table#Open_addressing) makes the hash table faster when the hash functions are simple and fast as the number of collisions inside of the array sinks. I don't know if that would be applicable for dmd.