Efficiently boosting priority of read-copy update readers in...

Details Efficiently boosting priority of read-copy update readers in... Efficiently boosting priority of read-copy update readers in...

2006-07-27

2010-06-08

Thomas, Shane M (Department: 2186)

Electrical computers and digital processing systems: memory

Storage accessing and control

Shared memory area

C711S150000, C711S167000

Reexamination Certificate

active

07734879

ABSTRACT:
A technique for efficiently boosting the priority of a preemptable data reader in order to eliminate impediments to grace period processing that defers the destruction of one or more shared data elements that may be referenced by the reader until the reader is no longer capable of referencing the data elements. Upon the reader being subject to preemption or blocking, it is determined whether the reader is in a read-side critical section referencing any of the shared data elements. If it is, the reader's priority is boosted in order to expedite completion of the critical section. The reader's priority is subsequently decreased after the critical section has completed. In this way, delays in grace period processing due to reader preemption within the critical section, which can result in an out-of-memory condition, can be minimized efficiently with minimal processing overhead.

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: 6219690 (2001-04-01), Slingwine et al.
patent: 6874144 (2005-03-01), Kush
patent: 6886162 (2005-04-01), McKenney
patent: 2004/0216112 (2004-10-01), Accapadi et al.
patent: 2005/0022186 (2005-01-01), Accapadi et al.
patent: 2005/0050550 (2005-03-01), Fuller
patent: 2005/0060710 (2005-03-01), Kush
patent: 2005/0071577 (2005-03-01), Dias et al.
patent: 2005/0080824 (2005-04-01), Vaidyanathan et al.
patent: 2005/0125789 (2005-06-01), Dijkstra et al.
patent: 2009/0006403 (2009-01-01), McKenney
J. Seigh, “RCU + SMR for preemptive kernel/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.
P. McKenney et al.,“Read-Copy Update,” 2002 Ottawa Linux Symposium, Jul. 8, 2002, 28 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.
S. Dietrich et al., “Evolution of Real-Time Linux,” 7th RTL Workshop, Nov. 17, 2005, 18 pages.
S. Rostedt, “Patch: Document futex PI design,” May 9, 2006, 14 pages.
B. Gamsa, “Tornado: Maximizing Locality and Concurrency in a Shared Memory Multiprocessor Operating System,” 1999, 14 pages.
Molnar et al., “Realtime and Linux,” 2005 Linux Kernel Summit, 8 pages.

Affiliated with

Also associated with

Rating

Efficiently boosting priority of read-copy update readers in... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficiently boosting priority of read-copy update readers in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiently boosting priority of read-copy update readers in... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4171707