Validation technique for bulk lock delegation

Details Validation technique for bulk lock delegation Validation technique for bulk lock delegation

2005-06-21

2005-06-21

Le, Uyen (Department: 2163)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

06910039

ABSTRACT:
A lock management technique that combines low-space overhead via sharing of lock states of equal value with comprehensive support for bulk delegation of locks has been developed. Operating in conjunction with methods for validating delegation requests prior to their execution, bulk delegation of locks can be achieved with computational costs that are generally independent of the number of lock being delegated. This property, added to the low-space overhead representation of locks via lock state sharing, offer a combination that may be particularly attractive for systems that demand for fine-granularity locking, large transaction sizes (in term of number of locks acquired) and efficient bulk delegation mechanisms.

REFERENCES:
patent: 5485607 (1996-01-01), Lomet et al.
patent: 5999931 (1999-12-01), Breitbart et al.
patent: 6044466 (2000-03-01), Anand et al.
patent: 6052688 (2000-04-01), Thorsen
patent: 6182186 (2001-01-01), Daynes
patent: 6343339 (2002-01-01), Daynes
patent: 2002/0103804 (2002-08-01), Rothschild et al.
patent: 2002/0152086 (2002-10-01), Smith et al.
patent: 2002/0178395 (2002-11-01), Chen et al.
patent: 2003/0014598 (2003-01-01), Brown
patent: 2003/0101300 (2003-05-01), Goldick
C. Pu, G. E. Kaiser, N. Hutchinson, “Split Transactions for Open-Ended Activities,” inProc. of the ACM SIGMOD Int'l Conf. on Management of Data, 1998, pp. 26-37 [online] [Retrieved from the Internet Jan. 31, 2003]<URL: http://citeseer.nj.nec.com/pu88splittransactions.html>.
G. E. Kaiser, C. Pu, “Dynamic Restructuring of Transactions,”Database Transaction Models for Advanced Applications, Data Management Systems, Morgan-Kauffman, 1992, 27 pp. [online] [Retrieved from the Internet Jan. 31, 2003] <URL: http://citeseer.nj.nec.com/kaiser92dynamic.html>.
L. Daynés, “Implementation of Automated Fine-Granularity Locking in a Persistent Programming Language,”Software—Practice and Experience, John Wiley & Sons, Ltd., 1999, 38 pp.
L. Daynés, et al, Customizable Concurrency Control for Persistent Java,Advanced Transaction Models and Architectures, Data Management Systems, Kluwer Academic Pub., Boston, 1997; Chap. 7, 34 pp.
Barbara Liskov et al., “Implementation of Argus”,Proceedings of 11th International Symposium on Operating System Principle(SOSP), 1987, pp. 111-122.
J.L.Eppinger et al., “Camelot and Avalon: A Distributed Transaction Facility”, Morgan Kaufmann Publishers, San Mateo, California, 1991, pp. 3-11, 81-92, 121-162 and 251-286.
Laurent Daynes et al., “Locking on OODBMS Client Supporting Nested Transactions”, IEEE 11thInternational Conference on Data Engineering, France, 1995, pp. 316-323.
Ole Anfindsen, “Apotram—An Application-Oriented Transaction Model”, PhD Thesis, University of Olso, Dept. of Informatics, Oslo, Norway, 1997.
Roger S. Barga and Calton Pu, “A Reflective Framework for Implementing Extended Transactions”,Advanced Transaction Models and Architectures, Data Management Systems, Chapter 3, Kluwe Academic Publishers, Boston, 1997, pp. 63-89.
Laurent Daynes and Oliver Gruber, “Customizing Concurrency Control Using Graph of Locking Capabilities”,Sixth International Workshop on Persistent Object Systems, France, Sep. 1994, Springer-Verlag, pp. 147-161.
T. Harder et al., “Supporting Parallelism in Engineering Databases by Nested Transactions,” Technical Report #34/1992, University of Kaiserslautern, [Online] [Retrieved from the Internet Dec. 3, 2002]0 <URL: http://wwwdbis.informatik.uni-kl.de/pubs/papers/HPS92.SFB.html>.
A. Biliris et al, “ASSET: A System Supporting Extended Transaction,” inProc. of ACM SIGMOD Int'l Conf. on Management of Data, Minneapolis, MN, May 1994, pp. 44-54 [online] [Retrieved from the Internet Dec. 3, 2002] <URL: http://www.cs.umass.edu/Dienst/UI/2.0/Describe
cstrl.umassa_cs/UM-CS-1994-027>.
E. T. Mueller, J. D. Moore and G. J. Popek, “A Nested Transaction Mechanism for LUCUS,” inProc. of 9th Int'l Symposium on Operating System Principle(SOSP), 1983, pp. 71-89 [online] [Retrieved from the Internet Jan. 31, 2003] <URL: http://www.cis.upenn.edu/˜bepierce/courses/dd/topics.html>.
J. Eliot B. Moss, “Nested Transactions: An Approach to Reliable Distributed Computing,” PhD Thesis, MIT, Apr. 1981, [online] [Retrieved from the Internet Jan. 31, 2003]<URL:http://citeseer.nj.nec.com/eliot81nested.html>.
L. Daynés et al., “Efficient Support for Customizing Concurrency Control in Persistent Java,” inInternational Workshop on Advanced Transaction Models and Architectures(ATMA), India, Sep. 1996, pp. 216-233 [online] [Retrieved from the Internet Jan. 31, 2003]<URL: http://citeseer.nj.nec.com/daynes96efficient.html>.
S. K. Shrivastava and S. M. Wheater, “Implementing Fault-Tolerant Distributed Applications Using Objects and Multi-Couloured Actions,” inProc. of Int'l Conf. on Distributed Computing Systems, Paris, France, May 1990.
T. Harder and K. Rothermel, “Concurrency Control Issues in Nested Transactions,” VLDE Journal, 1993, 2(1):39-74, [online] [Retreived from the Internet Jan. 31, 2003]<URL: http://citeseer.nj.nec.com/473908.html>.
Laurent Daynes and G. Czajkowski, High Performance, Space-Efficient, Automated Object Locking,IEEE 17thInternational Conference on Data Engineering, Heidleberg, Germany, Apr. 2001.

Affiliated with

Also associated with

Rating

Validation technique for bulk lock delegation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Validation technique for bulk lock delegation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Validation technique for bulk lock delegation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3507169