Philip Bohannon, Daniel Lieuwen, Avi Silberschatz, S. Sudarshan, and Jacques Gava. Recoverable User-Level Mutual Exclusion. In Proceedings of the seventh IEEE Symposium on Parallel and Distributed Processing, pages 293--301, October 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Speculation-Based Techniques for Lockfree Execution of Lock-Based .. - Rajwar (2002) (Correct)
....the programmer. Software proposals have been made to make lock based critical sections non blocking [163] and thread scheduling that is aware of blocking locks [87, 123] Bohannon et al. present a recovery strategy to allow a system to recover from a lock held by a process believed to have failed [20]. Locks also restrict parallelism: two operations on the same object cannot execute in parallel, even if they access disjoint parts of the object. In some cases, this problem can be addressed by using finer granularity locks. By using several locks per object, operations that access disjoint ....
Philip Bohannon, Daniel Lieuwen, Avi Silberschatz, S. Sudarshan, and Jacques Gava. Recoverable User-Level Mutual Exclusion. In Proceedings of the seventh IEEE Symposium on Parallel and Distributed Processing, pages 293--301, October 1995.
An Almost-Serial Protocol for Transaction Execution in.. - Blott, Korth (2002) (1 citation) (Correct)
....of performance experiments using DataBlitz. DataBlitz uses strict 2PL for concurrency control. However, DataBlitz also supports the ability to turn off locking, offers control over the point at which logging operations are performed, and provides an efficient, user level semaphore implementation [6]. Using these fea tures, we implemented the SP protocol described in Section 4.3 atop the existing, lower level primitives of DataBlitz. This provided a single platform whose behavior could be toggled between strict 2PL and SP. Our experimental database consisted of a single hash table, with ....
P. Bohannon, D. Lieuwen, A. Silberschatz, S. Sudarshah, and J. Gava. Recoverable user-level mutual exclusion. In Proc. of the IEEE Symposium on Parallel and Distributed Processing, 1995.
Recoverable User-Level Mutual Exclusion - Bohannon, Lieuwen, Silberschatz, .. (1995) (5 citations) Self-citation (Bohannon Lieuwen Silberschatz Sudarshan Gava) (Correct)
No context found.
P. Bohannon, D. Lieuwen, A. Silberschatz, S. Sudarshan, and J. Gava. Recoverable user-level mutual exclusion. Technical Report 950320-05, AT&T Bell Laboratories, March 1995.
Recoverable User-Level Mutual Exclusion - Bohannon, Lieuwen, Silberschatz, .. (1995) (5 citations) Self-citation (Bohannon Lieuwen Silberschatz Sudarshan Gava) (Correct)
....change, the following theorem allows useful recovery routines to be built around whoOwns. Theorem 6.1 Procedure whoOwns(L) terminates and reports an ownership status of spin lock L which accurately reflects the state of L at some point in time after whoOwns is called. 2 We present the proof in [7], and merely present the intuition here. The correctness of the cleanup algorithm follows from three main points: 1. Suppose the algorithm observes an informative state of a spin lock (free or owned by some process) If the lock is observed to be free, then this represents an accurate state of ....
P. Bohannon, D. Lieuwen, A. Silberschatz, S. Sudarshan, and J. Gava, "Recoverable user-level mutual exclusion," Tech. Rep. 950320-05, AT&T Bell Laboratories, Mar. 1995.
Recovering Scalable Spin Locks - Bohannon, Lieuwen, Silberschatz (1996) Self-citation (Bohannon Lieuwen) (Correct)
No context found.
P. Bohannon, D. Lieuwen, A. Silbershatz, S. Sudarshan, and J. Gava. Recoverable user-level mutual exclusion. In Proc. IEEE Symp. on Parallel and Dist. Processing, October 1995.
The Architecture of the Dalí Main-Memory Storage Manager - Bohannon, al. (1997) Self-citation (Bohannon) (Correct)
....much simpler at the cost of more than one compare for some searches (no concurrency control scheme was given in [3] Our concurrency control and recovery mechanisms take advantage of its simplicity; these mechanisms are described in Section 7.2. The latch recovery techniques are based on work in [9]. A significant body of work on making data structures tolerant to process slow downs and failures exists under the title of wait free data structures (see e.g. 20, 21, 44] This work is not designed for transaction processing systems, however, and depends on the presence of a compare and swap ....
....as atomic instructions (as opposed to compare and swap or load linked storeconditional) then extra care must be taken to determine if the process did in fact own the latch. In this section, we provide an overview of the technique used to handle this in Dal i, which is based on [9]. To allow the cleanup server to determine ownership of the latch, a process having acquired a latch must also register itself as the owner, for example by writing its process identifier to a known location. Unfortunately, the act of acquiring the latch using the basic hardware instruction ....
[Article contains additional citation context not shown here]
P. Bohannon, D. Lieuwen, A. Silbershatz, S. Sudarshan, and J. Gava. Recoverable user-level mutual exclusion. In Proc. 7th IEEE Symposium on Parallel and Distributed Processing, October 1995.
Mechanisms for Efficient Shared-Memory, Lock-Based Synchronization - Kagi (1999) (2 citations) (Correct)
No context found.
Philip Bohannon, Daniel Lieuwen, Avi Silberschatz, S. Sudarshan, and Jacques Gava. Recoverable user-level mutual exclusion. In Proceedings of the seventh IEEE Symposium on Parallel and Distributed Processing, pages 293--301, October 1995.
DataBlitz Architectural Overview - Er Vi Ew (Correct)
No context found.
] P. Bohannon, D. Lieuwen, A. Silbershatz, S. Sudarshan, and J. Gava. Recoverable user-level mutual exclusion. In Proc. 7th IEEE Symposium on Parallel and Distributed Processing, October
The Architecture of the Dalí Main Memory Storage Manager - Bohannon, al. (Correct)
No context found.
P. Bohannon, D. Lieuwen, A. Silberschatz, S. Sudarshan, and J. Gava, "Recoverable userlevel mutual exclusion," Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing, Oct. 1995, pp. 293-301.
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