Håkan Sundell, Philippas Tsigas  Home/Search
Context
Related
| cs.chalmers.se/~phs/T...SunT04_Deque.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.chalmers.se/~noble/papers (more) Homepages: H.Sundell P.Tsigas |
Rate this article:      (best)Comment on this article |
Abstract: We present an efficient and practical lock-free implementation of a concurrent deque that is disjoint-parallel accessible and uses atomic primitives which are available in modern computer systems. Previously known lock-free algorithms of deques are either based on non-available atomic synchronization primitives, only implement a subset of the functionality, or are not designed for disjoint accesses. Our algorithm is based on a doubly linked list, and only requires single-word compare-and-swap... (Update)
Similar documents based on text: More All
0.8: Scalable and Lock-Free Concurrent Dictionaries - Sundell, Tsigas (2004) (Correct)
0.6: NOBLE: A Non-Blocking Inter-Process Communication Library - Sundell, Tsigas (2002) (Correct)
0.6: Self-Adjusting Trees - Ha-Hoai, Papatriantafilou, Tsigas (2003) (Correct)
BibTeX entry: (Update)
@techreport{ sunt04t,
author = "H{\aa}kan Sundell and Philippas Tsigas",
title = "Lock-Free and Practical Deques using Single-Word Compare-And-Swap",
institution = "Computing Science, Chalmers University of Technology",
number = "2004-02",
month = Mar,
year = 2004,
url = "citeseer.ist.psu.edu/sundell04lockfree.html" }
Citations (may not include all citations):334 Operating System Concepts (context) - Silberschatz, Galvin - 1994
326 Linearizability: a correctness condition for concurrent obje.. (context) - Herlihy, Wing - 1990
125 Wait-free synchronization - Herlihy - 1991
45 Thread scheduling for multiprogrammed multiprocessors - Arora, Blumofe et al. - 1998
25 Disjoint-access-parallel implementations of strong shared me.. (context) - Israeli, Rappoport - 1994
20 Obstruction-free synchronization: Double-ended queues as an .. (context) - Herlihy, Luchangco et al. - 2003
16 Non-blocking synchronization and system design - Greenwald - 1999
12 Correction of a memory management method for lock-free data .. - Michael, Scott - 1995
11 A pragmatic implementation of nonblocking linked lists - Harris - 2001
10 NOBLE: A non-blocking inter-process communication library - Sundell, Tsigas - 2002
9 A practical multiword compare-and-swap operation - Harris, Fraser et al. - 2002
3 Lock-free reference counting - Detlefs, Martin et al. - 2001
2 CAS-based lock-free algorithm for shared deques (context) - Michael - 2003
1 Even better DCASbased concurrent deques (context) - Detlefs, Flood et al. - 2000
1 DCASbased concurrent deques (context) - Agesen, Detlefs et al. - 2000
1 DCAS-based concurrent deques supporting bulk allocation (context) - Martin, Moir et al. - 2002
1 The algorithm for dynamic maximum sizes This section shows t.. (context) - Valois, structures et al. - 1995
Documents on the same site (http://www.cs.chalmers.se/~noble/papers.html):
Scalable and Lock-Free Concurrent Dictionaries - Sundell, Tsigas (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC