On Thu, Oct 24, 2013 at 11:27:05AM -0700, Andrew Francis wrote: > The University of Chicago/Microsoft Research paper "Scalable Join > Patterns" (http://www.mpi-sws.org/~turon/scalable-joins.pdf) > outlines an approach for implementing join patterns using > essentially lock-free bags, optimistic locking and techniques for > guaranteeing liveness. For the sake of this discussion, ignore the > term "join pattern" : substitute it with "channel." > > A bit more context - I have looked at the C code for the Go channel > implementation and said "wow, there is a lot of locking there"! I > also have been following conversations concerning race conditions > and the race detector (based on thread sanitizer) and asking myself: > pypy-stm could do this.
Thanks for the paper reference, very interesting. Is it worth implementing the api first with a naive implementation with some examples of use before heading into the details of optimised implementation? (clearly it won't prove performance value, but at least half of the merit of that paper is the clean declarative style and precise semantics of the join calculus) njh _______________________________________________ pypy-dev mailing list pypy-dev@python.org https://mail.python.org/mailman/listinfo/pypy-dev
