CheckFence Checking Consistency of Concurrent Data Types oncheckfence检查并发数据类型的一致性.ppt

CheckFence: Checking Consistency of Concurrent Data Types on Relaxed Memory Models Sebastian BurckhardtRajeev AlurMilo M. K. Martin Department of Computer and Information Science University of Pennsylvania June 6, 2007 General Motivation Specific Motivation concurrency libaries with lock-free synchronization ... are simple, fast, and safe to use concurrent versions of queues, sets, maps, etc. more concurrency, less waiting fewer deadlocks ... are notoriously hard to design and verify tricky interleavings routinely escape reasoning and testing exposed to relaxed memory modelscode needs to contain memory fences for correct operation! ... are simple, fast, and safe to use concurrent versions of queues, sets, vectors, etc. more concurrency, less waiting fewer deadlocks ... are notoriously hard to design and verify tricky interleavings exposed to relaxed memory modelscode needs memory fences for correct operations Specific Motivation Bridging the Gap Example: Nonblocking Queue The implementation optimized: no locks. not race-free exposed to memory model The client program on multiple processors calls operations Michael Scott’s Nonblocking Queue[Principles of Distributed Computing (PODC) 1996] boolean_t dequeue(queue_t *queue, value_t *pvalue) { node_t *head; node_t *tail; node_t *next; while (true) { head = queue-head; tail = queue-tail; next = head-next; if (head == queue-head) { if (head == tail) { if (next == 0) return false; cas(queue-tail, (uint32) tail, (uint32) next); } else { *pvalue = next-value; if (cas(queue-head, (uint32) head, (uint32) next)) break; } } } delete_node(head); return true; } Correctness Condition Data type implementations must appear sequentially consistent to the client program: the observed argument and return values must be consistent with some interleaved, atomic execution of the operations. Part II: Solution