Electrical computers and digital processing systems: memory – Storage accessing and control – Control technique
Reexamination Certificate
2006-08-04
2008-10-07
Lane, Jack A (Department: 2185)
Electrical computers and digital processing systems: memory
Storage accessing and control
Control technique
C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
07434010
ABSTRACT:
Various technologies and techniques are disclosed that improve implementation of concurrency control modes in a transactional memory system. A transactional memory word is provided for each piece of data. The transactional memory word includes a version number, a reader indicator, and an exclusive writer indicator. The transactional memory word is analyzed to determine if the particular concurrency control mode is proper. Using the transactional memory word to help with concurrency control allows multiple combinations of operations to be performed against the same memory location simultaneously and/or from different transactions. For example, a pessimistic read operation and an optimistic read operation can be performed against the same memory location.
REFERENCES:
patent: 5263155 (1993-11-01), Wang
patent: 5960436 (1999-09-01), Chang et al.
patent: 6240413 (2001-05-01), Learmont
patent: 6546443 (2003-04-01), Kakivaya et al.
patent: 6681226 (2004-01-01), Bretl et al.
patent: 6718349 (2004-04-01), Weedon
patent: 6826757 (2004-11-01), Steele, Jr. et al.
patent: 6850938 (2005-02-01), Sadjadi
patent: 6952829 (2005-10-01), Banavar et al.
patent: 2002/0116403 (2002-08-01), Weedon
patent: 2002/0165727 (2002-11-01), Greene et al.
patent: 2003/0033328 (2003-02-01), Cha et al.
patent: 2003/0236786 (2003-12-01), Shi et al.
patent: 2006/0036574 (2006-02-01), Schweigkoffer et al.
patent: 2006/0136454 (2006-06-01), Tchouati et al.
Atkins et al., “Adaptable concurrency control for atomic data types”, Date: Aug. 1992, pp. 190-225, vol. 10, No. 3, http://portal.acm.org/citation.cfm?id=146939&coll=ACM&dl=ACM&CFID=176859&CFTOKEN=92839444.
Herlihy, Maurice, “Apologizing versus asking permission: optimistic concurrency control for abstract data types”, Date: Mar. 1990, pp. 96-124, vol. 15, No. 1, http://portal.acm.org/citation.cfm?id=77647&coll=ACM&dl=ACM&CFID=176859&CFTOKEN=92839444.
Herlihy, Maurice, “Optimistic Concurrency Control for Abstract Data Types”, Date: 1986, pp. 206-217, http://delivery.acm.org/10.1145/20000/10608/p206-herlihy.pdf?key1=10608&&key2=4622283511&coll=ACM&di=ACM&CFID=176859&CFTOKEN=92839444.
Saha et al., “McRT-STM: A High Performance Software Transactional Memory System for a Multi-Core Runtime”, Date: 2006, pp. 187-197, http://delivery.acm.org/10.1145/1130000/1123001/p187-saha.pdf?key1=1123001&key2=2983083511&coll=ACM&dl=ACM&CFID=176859&CFTOKEN=92839444.
Herlihy, et al, “Transactional Memory: Architectural Support for Lock-Free Data Structures”, In: ACM SIGARCH Computer Architecture News, 1993, vol. 21, Issue 2, pp. 289-300.
International Search Report, PCT/US2007/015405, Jan. 23, 2008, pp. 1-10.
Detlefs David
Duffy John Joseph
Graefe Goetz
Grover Vinod K.
Magruder Michael M.
Lane Jack A
Microsoft Corporation
LandOfFree
Combined pessimistic and optimisitic concurrency control does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Combined pessimistic and optimisitic concurrency control, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combined pessimistic and optimisitic concurrency control will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4013744