J. Mellor-Crummey. Concurrent queues: Practical fetch-and-OE algorithms. Technical Report 229, University of Rochester, November 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Implementing Lock-Free Queues - Valois (1994) (20 citations) (Correct)
....implementation. Queues are also useful in implementing parallel versions of many algorithms, such as quicksort and branch and bound, and are generally useful as a means of distributing work to a number of processes [14] Many authors have proposed algorithms for lock free queues in the literature [6, 8, 11, 12, 16, 18, 19, 20]. In the remainder of this paper we examine practical implementations of lock free FIFO queues. Section 2 introduces some essential concepts related to lock free data structures. Sections 3 surveys previous work and presents a new algorithm for lock free queues using a linked list data structure, ....
....if an enqueuing process is slow in linking the new node onto the end of the list. Furthermore, if the process halts completely, the list structure is broken and cannot be repaired, since the only halted process has any knowledge of what link needs to be made. 3. 2 Blocking Methods Mellor Crummey [12] and Stone [19] present versions of the above basic algorithm which fix these flaws. In order to ensure that the queue is linearizable, however, these two algorithms detect when a slow enqueuing process has not yet linked its node to the list, and simply wait. Thus, while they do not employ any ....
J. Mellor-Crummey. Concurrent queues: Practical fetch-and-OE algorithms. Technical Report 229, University of Rochester, November 1987.
Practical Considerations for Non-Blocking Concurrent Objects - Bershad (1993) (34 citations) (Correct)
....All of these problems occur because processors block waiting for a resource. Since there is no blocking with non blocking objects, their occurrence is prevented. Several researchers have already demonstrated the feasibility of non blocking objects in concurrent algorithms. Mellor Crummey [Mellor Crummey 87] and Wing and Gong [Wing Gong 90] have designed a library of non blocking concurrent objects and proven them correct. Herlihy has shown several practical algorithms for wait free a restricted form of non blocking objects [Herlihy 90] Massalin and Pu have implemented an entire ....
Mellor-Crummey, J. M. Concurrent Queues: Practical Fetch-and-OE Algorithms. Technical Report 229, Department of Computer Science, University of Rochester, November 1987.
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