A universal construction for wait-free transaction friendly data structures

Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of processes using only shared registers and CAS objects. Our universal construction is transaction friendly, allowing a process to gracefully exit from an operation that it wanted to perform, and it is cache-efficient in a multicore setting where the processes run on cores that share a single cache. We also present an optimized shared queue based on this method. Categories and Subject Descriptors E.1 [Data Structures]: Distributed data structures; Lists, stacks, and queues General Terms Algorithms, Theory Keywords Universal construction, wait-free, abortable data structure, transaction friendly, cache-efficiency

• Type: Conference
• Year: 2010
• Where: SPAA
• Authors: Phong Chuong, Faith Ellen, Vijaya Ramachandran
• Keywords: Data Structure, Distributed And Parallel Computing, Sequential Implementation, SPAA 2010, Universal Construction