Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2008-07-01
2008-07-01
Ali, Mohammad (Department: 2169)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
11248096
ABSTRACT:
A technique for realtime-safe detection of a grace period for deferring the destruction of a shared data element until pre-existing references to the data element have been removed. A pair of counters is established for each of one or more processors. A global counter selector determines which counter of each per-processor counter pair is a current counter. When reading a shared data element at a processor, the processor's current counter is incremented. Following counter incrementation, the processor's counter pair is tested for reversal to ensure that the incremented counter is still the current counter. If a counter reversal has occurred, such that the incremented counter is no longer current, the processor's other counter is incremented. Following referencing of the shared data element, any counter that remains incremented is decremented. Following an update to the shared data element wherein a pre-update version of the element is maintained, the global counter selector is switched to establish a new current counter of each per-processor counter pair. The non-current counter of each per-processor counter pair is tested for zero. The shared data element's pre-update version is destroyed upon the non-current counter of each per-processor counter pair being zero.
REFERENCES:
patent: 5442758 (1995-08-01), Slingwine et al.
patent: 5608893 (1997-03-01), Slingwine et al.
patent: 5727209 (1998-03-01), Slingwine et al.
patent: 6182107 (2001-01-01), Atsatt
patent: 6219690 (2001-04-01), Slingwine et al.
patent: 6360220 (2002-03-01), Forin
patent: 6581063 (2003-06-01), Kirkman
patent: 6615216 (2003-09-01), Hu
patent: 6668310 (2003-12-01), McKenney
patent: 6760726 (2004-07-01), Hersh
patent: 6785888 (2004-08-01), McKenney et al.
patent: 7287135 (2007-10-01), McKenney et al.
patent: 7349926 (2008-03-01), McKenney et al.
patent: 7353346 (2008-04-01), McKenney et al.
J. Seigh, “RCU+SMR for preemptive kemel/user threads,” Linux Kernel Mailing List, May 9, 2005, 2 pages.
M. Michael, “Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects,” IEEE Transactions On Parallel And Distributed Systems, Jun. 2004, vol. 15, No. 6, pp. 491-504.
D. Sarma et al., “Making RCU Safe for Deep Sub-Millisecond Response Realtime Applications,” 2004 USENIX (UseLinux track) Jun. 2004, 9 pages.
P. McKenney, “RCU vs. Locking Performance on Different CPUs,” 2004 Linux.conf.au, 2004, 18 pages.
P. McKenney et al., “Scaling dcache with RCU,” Linux Journal, Jan. 1, 2004, 12 pages.
P. McKenney et al., “Using RCU in the Linux 2.5 Kernel,” Linux Journal, Oct. 1, 2003, 11 pages.
H. Linder et al., “Scalability of the Directory Entry Cache,” 2002 Ottawa Linux Symposium, Jun. 26, 2002, pp. 289-300.
P. Mckenney et al., “Read-Copy Update,” 2001 Ottawa Linux symposium, Jul. 2001, 22 pages.
P. McKenney et al., “Read-Copy Update: Using Execution History to Solve Concurrency Problems,” PDCS, Oct. 1998, 11 pages.
Ben Gamsa et al., “Tornado: Maximizing Locality and Concurrency in a Shared Memory Multiprocessor Operating System” 1999.
Ali Mohammad
Duft Walter W.
Raissinia Abdy
Smith Brannon W
LandOfFree
Realtime-safe read copy update with lock-free readers does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Realtime-safe read copy update with lock-free readers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Realtime-safe read copy update with lock-free readers will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3914493