Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Highly-Concurrent Multi-Word Synchronization (Extended Abstract)
 

Summary: Highly-Concurrent Multi-Word Synchronization
(Extended Abstract)
Hagit Attiya and Eshcar Hillel
Department of Computer Science, Technion
Abstract. The design of concurrent data structures is greatly facilitated by the
availability of synchronization operations that atomically modify k arbitrary lo-
cations, such as k-read-modify-write (kRMW). Aiming to increase concurrency in
order to exploit the parallelism offered by today's multi-core and multiprocess-
ing 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 sup-
ported 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.
1 Introduction
Multi-word synchronization operations, like k-read-modify-write (kRMW), allow to
read the contents of several memory locations, compute new values and write them
back, all in one atomic operation. A popular special case is k-compare-and-swap

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

 

Collections: Computer Technologies and Information Sciences