Using type stability to facilitate contention management

Details Using type stability to facilitate contention management Using type stability to facilitate contention management

2011-08-02

2011-08-02

Campos, Yaima (Department: 2185)

Electrical computers and digital processing systems: memory

Storage accessing and control

Shared memory area

C711S151000, C711S152000, C711S153000, C711S170000, C711S171000, C711S172000, C711S173000, C707S756000, C707S791000

Reexamination Certificate

active

07991967

ABSTRACT:
Various technologies and techniques are disclosed for providing type stability techniques to enhance contention management. A reference counting mechanism is provided that enables transactions to safely examine states of other transactions. Contention management is facilitated using the reference counting mechanism. When a conflict is detected between two transactions, owning transaction information is obtained. A reference count of the owning transaction is incremented. The system ensures that the correct transaction was incremented. If the owning transaction is still a conflicting transaction, then a contention management decision is made to determine proper resolution. When the decision is made, the reference count on the owning transaction is decremented by the conflicting transaction. When each transaction completes, the reference counts it holds to itself is decremented. Data structures cannot be deallocated until their reference count is zero. Dedicated type-stable allocation pools can be reduced using an unstable attribute.

REFERENCES:
patent: 5241675 (1993-08-01), Sheth et al.
patent: 5335343 (1994-08-01), Lampson et al.
patent: 5701480 (1997-12-01), Raz
patent: 6513100 (2003-01-01), Clift
patent: 6754737 (2004-06-01), Heynemann et al.
patent: 6785779 (2004-08-01), Berg et al.
patent: 7089253 (2006-08-01), Hinshaw et al.
patent: 7236974 (2007-06-01), Bhattacharjee et al.
patent: 2003/0115276 (2003-06-01), Flaherty et al.
patent: 2004/0015642 (2004-01-01), Moir et al.
patent: 2004/0103123 (2004-05-01), Bradshaw
patent: 2004/0215880 (2004-10-01), Chilimbi et al.
patent: 2006/0085489 (2006-04-01), Tomic et al.
patent: 2006/0112248 (2006-05-01), Meiri et al.
patent: 2006/0190504 (2006-08-01), Pruet
patent: 2006/0218206 (2006-09-01), Bourbonnais et al.
patent: 2006/0218561 (2006-09-01), Moir et al.
patent: 2007/0198781 (2007-08-01), Dice et al.
patent: 2007/0239943 (2007-10-01), Dice et al.
Costich Oliver, “Transaction Processing Using an Untrusted Scheduler in a Multilevel Database with Replicated Architecture”, pp. 1-17.
Dekeyser, et al., “Conflict Scheduling of Transactions on XML Documents”, Date: 2004, vol. 27, http://portal.acm.org/citation.cfm?id=1012305.
Yeo, et al., “Linear Orderability of Transactions in Mobile Environment with Heterogeneous Databases”, pp. 1-30.
PCT International Search Report for International Application No. PCT/US2008/067346 mailed Jan. 19, 2009 (7 pages).
PCT Written Opinion for International Application No. PCT/US2008/067346 mailed Jan. 19, 2009 (4 pages).

Affiliated with

Also associated with

Rating

Using type stability to facilitate contention management does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Using type stability to facilitate contention management, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using type stability to facilitate contention management will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2723335