Sundeep Prakash, Yann-Hang Lee, Theodore Johnson  Home/Search
Context Related
| ufl.edu/cis/techreport...tr91002.ps.Z 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: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Non-blocking algorithms for concurrent data structure guarantee that a data structure is always accessible, in contrast to blocking algorithms in which a slow or halted process can render part or all of the data structure inaccessible to other processes. In this paper, we first develop a method to design non-blocking algorithms for any concurrent data structure, using the compare&swap operation as the basic synchronization primitive. We use the example of queues to demonstrate the method. ... (Update)
Context of citations to this paper: More
.... to that in [17] We developed these OCC models as a tool for analyzing the performance of non blocking data structure algorithms [20, 21, 29, 30], and they also have applications in analyzing real time optimistic transaction processing schemes [6, 9] 2 Model Description...
...and timestamp their modifications to the shared object, and cooperate whenever conflicts arise. Turek et al. 23] and Prakash et al. [20] presented methodologies for transforming multiple lock concurrent objects into lock free concurrent objects. In comparison to data...
Cited by: More
A Comparison of Task Pools for Synamic Load Balancing of.. - Korch, Rauber (Correct)
Improving Wait-Free Algorithms for Interprocess.. - Huang, Pillai, Shin (2002) (Correct)
Managing Long Linked Lists Using Lock Free Techniques - Farook, Graham (Correct)
Active bibliography (related documents): More All
0.6: Space Efficient Parallel Buddy Memory Management - Johnson, Davis (1992) (Correct)
0.4: Characterizing the Performance of Algorithms for Lock-free Objects - Johnson (Correct)
0.3: Cedar Synchronization Processor Instruction Set Reference - David Pointer Greg (Correct)
Similar documents based on text: More All
0.6: Optimal Time-Space Tradeoff for Shared Memory Leader Election - Afek, Stupp (1999) (Correct)
0.2: On-line Algorithms for Path Selection in a Nonblocking Network - Arora, Leighton, Maggs (1996) (Correct)
0.2: MMPI: Asynchronous Message Management for the Message-Passing.. - Edwards (1996) (Correct)
Related documents from co-citation: More All
11: A methodology for implementing highly concurrent data objects - Herlihy - 1993
9: A NonBlocking Algorithm for Shared Queues Using Compare-and-Swap (context) - Prakash, Lee et al. - 1991
6: A Lock-Free Multiprocessor OS Kernel - Massalin, Pu - 1991
BibTeX entry: (Update)
S. Prakash, Y. H. Lee, and T. Johnson. Non-Blocking Algorithms for Concurrent Data Structures. Technical Report 91-002, University of Florida, July 1991. http://citeseer.ist.psu.edu/prakash91nonblocking.html More
@techreport{ prakash91nonblocking,
author = "S. Prakash and Y.-H. Lee and T. Johnson",
title = "Non-Blocking Algorithms for Concurrent Data Structures",
number = "91--002",
year = "1991",
url = "citeseer.ist.psu.edu/prakash91nonblocking.html" }
Citations (may not include all citations):625 ACM Transactions on Programming Languages and Systems (context) - Lamport, Program - 1983
186 A Methodology for Implementing Highly Concurrent Data Struct.. - Herlihy - 1989
83 Basic Techniques for the Efficient Coordination of Very Larg.. - Gottlieb, Lubachevsky et al. - 1983
57 Impossibility and Universality Results for Wait-Free Synchro.. (context) - Herlihy - 1988
51 Axioms for Concurrent Objects (context) - Herlihy, Wing - 1987
31 Concurrent Search Structure Algorithms (context) - Shasha, Goodman - 1988
24 A Non-Blocking Algorithm for Shared Queues using Compare-and.. (context) - Prakash, Lee et al. - 1991
21 Watson Research Center (context) - IBM - 1983
17 Systems Programming: Coping with parallelism (context) - Treiber - 1986
10 Trees Databases using Preparatory Operations (context) - Mond, Raz et al. - 1985
8 A Synchronization Scheme and its Applications for Large Mult.. (context) - Zhu, Yew - 1984
8 A Simple and Correct Shared-Queue Algorithm Using Compareand.. (context) - Stone - 1990
8 Operating System Data Structures for Shared-memory (context) - Wilson - 1988
5 A Parallel Linked List for Shared-Memory Multiprocessors (context) - Tang, Yew et al. - 1989
2 Concurrent Dynamic Storage Allocation (context) - Ellis, Olson - 1987
1 SMARTS - Shared-memory Multiprocessor Ada Run Time Superviso.. (context) - Hummel - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (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