Apart from the emphasis of terms like "true", this is a pretty decent summary of what's going on in the paper --- concurrent algorithms, linearizability, and a lot of dance around atomic blocks, restarts, and the pointers curr and pred.
Showing posts with label paraglide. Show all posts
Showing posts with label paraglide. Show all posts
Monday, April 20, 2009
Algorithms for Concurrent Data Structures
Word clouds seem to be all the rage lately. Playing with some clouds for a recent talk, I found them to actually provide an interesting summary of research papers. For example, here's a word cloud for our PLDI'08 paper on derivation of highly-concurrent linearizable data structure algorithms.
Apart from the emphasis of terms like "true", this is a pretty decent summary of what's going on in the paper --- concurrent algorithms, linearizability, and a lot of dance around atomic blocks, restarts, and the pointers curr and pred.
Apart from the emphasis of terms like "true", this is a pretty decent summary of what's going on in the paper --- concurrent algorithms, linearizability, and a lot of dance around atomic blocks, restarts, and the pointers curr and pred.
Tuesday, May 6, 2008
Workshop on the Verification of Concurrent Algorithms
Four of the nomads attended the Cambridge workshop on the verification of concurrent algorithms. I gave an overview talk on Shape Analysis for concurrent programs (slides). Martin gave a short talk about our work on synthesis of concurrent set algorithms (slides).
On the last day, we had a few hours before our flight, so we went punting. Below are a couple of pictures taken by Noam (you can see Noam's reflection in my sunglasses).
On the last day, we had a few hours before our flight, so we went punting. Below are a couple of pictures taken by Noam (you can see Noam's reflection in my sunglasses).
Subscribe to:
Posts (Atom)