Optimizing preemptible read-copy update for low-power usage...

Details Optimizing preemptible read-copy update for low-power usage... Optimizing preemptible read-copy update for low-power usage...

2008-04-03

2011-11-08

Patel, Nitin (Department: 2116)

Electrical computers and digital processing systems: support

Computer power control

C713S323000

Reexamination Certificate

active

08055918

ABSTRACT:
A technique for low-power 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 grace period processing action is implemented that requires a response from a processor that may be running a preemptible reader of said shared data element before further grace period processing can proceed. A power and reader status of the processor is also determined. Grace period processing may proceed despite the absence of a response from the processor if the power and reader status indicates that an actual response from the processor is unnecessary.

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: 6886162 (2005-04-01), McKenney
patent: 6996812 (2006-02-01), McKenney
patent: 2005/0149634 (2005-07-01), McKenney
patent: 2005/0198030 (2005-09-01), McKenney
patent: 2006/0090104 (2006-04-01), McKenney et al.
patent: 2006/0100996 (2006-05-01), McKenney
patent: 2006/0112121 (2006-05-01), McKenney et al.
patent: 2006/0117072 (2006-06-01), McKenney
patent: 2006/0123100 (2006-06-01), McKenney
patent: 2006/0130061 (2006-06-01), McKenney
patent: 2006/0265373 (2006-11-01), McKenney et al.
patent: 2007/0083565 (2007-04-01), McKenney
patent: 2007/0101071 (2007-05-01), McKenney
patent: 2007/0226431 (2007-09-01), McKenney et al.
patent: 2007/0226440 (2007-09-01), McKenney et al.
patent: 2007/0266209 (2007-11-01), McKenney et al.
patent: 2008/0033952 (2008-02-01), McKenney et al.
patent: 2008/0040720 (2008-02-01), McKenney et al.
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.
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.
H. Boehm, “The Space Cost of Lazy Reference Counting,” ACM SIGPLAN Notices, Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '04, vol. 39, Issue 1, Jan. 2004, p. 210-219.
M. Michael, “Scalable Lock-Free Dynamic Memory Allocation,” ACM SIGPLAN Notices, Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation; PLDI '04, vol. 39, Issue 6, Jun. 2004, p. 35-46.
D. Dice et al., “Mostly Lock-Free Malloc,” ACM SIGPLAN Notices, Proceedings of the 3rd International Symposium on Memory Management, ISMM '02, vol. 38, Issue 2 Supplement, Jun. 2002, p. 163-174.
J. Corbet, “Read-copy-update for realtime,” LWN.net, Sep. 26, 2006, 3 pages.
“Priority Inversion,” Wikipedia, Feb. 4, 2007, 3 pages.
McKenney, “Seven real-time Linux approaches (Part C)”, LinuxDevices.com, Jun. 7, 2005, 13 pages.
P. McKenney, “ RCU and CONFIG—PREEMPT—RT progress,” Linux Kernel Mailing List, May 5, 2005, 2 pages.
O. Nesterov, QRCU: ‘Quick’ SRCU Implementation, Linux Kernel Mailing List, Dec. 1, 2005, 3 pages.
T. Gleixner, “High Resolution Timers/Dynamic Ticks-V2”, LWN.net, Oct. 1, 2006, 6 pages.
P. Mckenney, “Sleepable RCU”, LWN.net, Oct. 9, 2006, 10 pages.
O. Nesterov, “cpufreq—tsc() as core—initcall—sync”, LKML.org, Nov. 19, 2006, 2 pages.
P. McKenney, “Using RCU in the Linux 2.5 Kernel”, Kernel Korner, Oct. 1, 2003,11 pages.
A. Kleen, “How to do nothing efficiently or better laziness: No Idle tick on x86-64”, 2005, 16 pages.
P. McKenney, “Read-Copy Update Implementations”, 2001, 3 pages.
Non-Final Office Action dated Apr. 1, 2011 from copending U.S. Appl. No. 12/178,752.
Amendment and Response to Office Action dated Jul. 1, 2011 from copending U.S. Appl. No. 12/178,572.

Affiliated with

Also associated with

Rating

Optimizing preemptible read-copy update for low-power usage... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimizing preemptible read-copy update for low-power usage..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing preemptible read-copy update for low-power usage... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4252968