On 10/4/07, Oliver Zeigermann <[EMAIL PROTECTED]> wrote: > However, this much more looks like what is done in > commons transaction.
I think you're referring to the Software Transactional Memory research work. But what about the non-blocking algorithms for concurrent data structures? I.E., here are a few papers: http://research.sun.com/scalable/pubs/ICDCS2003.pdf http://research.sun.com/scalable/pubs/lazy-list.pdf What do you think? Cheers, Sergio B. -- Sergio Bossa Software Architect, Developer and Open Source Enthusiast. Blog : http://sbtourist.blogspot.com Sourcesense - making sense of Open Source : http://www.sourcesense.com Pro-netics s.p.a. : http://www.pronetics.it --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
