rigtorp

52 カルマ登録 12 年前

https://rigtorp.se

·一昨日·議論

You would use one of those approaches:

If you align and pad each slot there won't be any false sharing and the stream prefetcher can kick in if there's only one producer or consumer.

If you use bijective hashing you reduce false sharing without aligning and padding. This can save memory at the expense of the stream prefetcher never kicking in.

rigtorp

·一昨日·議論

Here's my widely used implementation of this approach in C++: https://github.com/rigtorp/MPMCQueue

rigtorp

·一昨日·議論

That looks like a rewrite of my earlier work: https://rigtorp.se/ringbuffer/

rigtorp

·6 か月前·議論

Better to use the Gmail API to incrementally backup your mail: https://github.com/rigtorp/gmbackup

rigtorp

·6 か月前·議論

I have a tool that saves each mail as a single file using the Gmail API: https://github.com/rigtorp/gmbackup

rigtorp

·10 か月前·議論

Interesting, of course many computations can be expressed as a graph. In the case of the bipartite graph we perform belief propagation on to decode LDPC where is the optimization from the distributive property? The parity matrix would typically be constructed so that there's few subexpression to factor out, to maximize the error correcting properties.

I agree both FFT and belief propagation can be expressed as message passing algorithms.

rigtorp

·10 か月前·議論

How is belief propagation used for decoding LDPC codes related to FFT?

コメント