CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Supporting Lock-Free Composition of Concurrent Data Objects

Daniel Cederman (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers)) ; Philippas Tsigas (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers))
Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel programming p. 339-340. (2010)
[Konferensbidrag, refereegranskat]

Lock-free data objects offer several advantages over their blocking counterparts, such as being immune to deadlocks and convoying and, more importantly, being highly concurrent. But they share a common disadvantage in that the operations they provide are difficult to compose into larger atomic operations while still guaranteeing lock-freedom. We present a lock-free methodology for composing highly concurrent linearizable objects together by unifying their linearization points. This makes it possible to relatively easily introduce atomic lock-free move operations to a wide range of concurrent objects. Experimental evaluation has shown that the operations originally supported by the data objects keep their performance behavior under our methodology.

Nyckelord: composition, data structures, lock-free



Denna post skapades 2010-01-24. Senast ändrad 2014-01-21.
CPL Pubid: 110736

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)