Highly concurrent multi-word synchronization

d Abstract) Hagit Attiya and Eshcar Hillel Department of Computer Science, Technion The design of concurrent data structures is greatly facilitated by the availability of synchronization operations that atomically modify k arbitrary locations, such as k-read-modify-write (kRMW). Aiming to increase concurrency in order to exploit the parallelism offered by today's multi-core and multiprocessing architectures, we propose a software implementation of kRMW that ef ciently breaks apart delay chains. Our algorithm ensures that two operations delay each other only if they are within distance O(k) in the con ict graph, dynamically induced by the operations' data items. The algorithm uses double compare-and-swap (DCAS). When DCAS is not supported by the architecture, the algorithm of Attiya and Dagan [3] can be used to replace DCAS with (unary) CAS, with only a slight increase in the interference among operations.

• Type: Journal
• Year: 2011
• Where: TCS
• Authors: Hagit Attiya, Eshcar Hillel
• Keywords: Algorithm, Concurrent Data Structures, Eshcar Hillel Department, TCS 2011, Theoretical Computer Science