On Wed, Mar 20, 2013 at 4:50 PM, Simon Toedt <[email protected]> wrote: > Apologies for my lack of knowledge, but how can a fifo queue be > implemented with just a compare and swap for pointers?
Does anyone know a method to implement this with just a single compare and swap operation for pointers? I'm not sure whether this is even theoretically possible. Simon _______________________________________________ ast-users mailing list [email protected] http://lists.research.att.com/mailman/listinfo/ast-users
