Patent
1995-06-07
1997-04-22
Black, Thomas G.
395670, 395701, G06F 1730
Patent
active
056236590
ABSTRACT:
For concurrent access by a plurality of users to a data set in a memory, a computer system first searches for a write lock on a first portion of the data set which the user wishes to access. For no write lock detected, the request is granted by allowing write access to the first portion. A write lock is placed on the first portion of the data set to prevent other users from changing it, while allowing other users read access to the first portion. If a second user wants write access to a second not interesting portion of the data set, the process is similar. A search for a write lock on a second portion of the data set is conducted. If not found, the second user's request for write access to the second portion is granted. A write lock on the second portion is placed to prevent other users from changing the second portion while allowing read access. If a third user wants access to a third portion of the data set wherein the third shares some common elements with the first portion, but has other elements which are not shared, his request will partially granted to the portion of the third portion which is not shared by the first portion. A write lock is placed on the portion of the third portion to which the third user is allowed write access. When a user has finished with his portion of the data set, the write lock is removed and the parent version of the data set is updated.
REFERENCES:
patent: 4503499 (1985-03-01), Mason et al.
patent: 4853843 (1989-08-01), Ecklund
patent: 5175851 (1992-12-01), Johnson et al.
patent: 5285528 (1994-02-01), Hart
patent: 5305448 (1994-04-01), Insalaco et al.
patent: 5333319 (1994-07-01), Silen
patent: 5339427 (1994-08-01), Elko et al.
patent: 5388268 (1995-02-01), Beach et al.
patent: 5414839 (1995-05-01), Joshi
patent: 5418966 (1995-05-01), Madduri
patent: 5440746 (1995-08-01), Lentz
patent: 5459871 (1995-10-01), Van Den Berg
Song et al., "How Well Can Data Temporal Consistencies Be Maintained?" 1992 IEEE Symposium on Computer-Aided Control System Design (CAESD), 17-19 Mar., 1992, pp. 275-284.
Peter E. Dyson "Group Editing Made Easy: a Hand-on Look at Aspects", Seybold Report on Desktrop Publishing, vol. V7, Issue: M1, Sep. 4, 1992, pp. 9-13.
Tomasz Imielinski, New Brunswick, NJ 08903, Incomplte Objects -- A Data Model for Design and Planning Applications, 1991, pp. 288-297.
A Dynamic C-Based Object-Oriented System For Unix, Engelstad et al. IEEE Software, pp. 73-85, May 1991.
An Extensible Kernel Object Management System, Rahim Yaseen, Stanley Y. W. Su and Herman Lam, 1991, pp. 247-263.
Experience with Flamingo: A Distributed, Object-Oriented User Interface System, David B. Anderson, Pittsburgh, PA 15213, OOPSLA'86 Proceedings, pp. 177-185, Sep. 1986.
Transactions for Concurrent Object-Oriented Programming Systems, Gail E. Kiser, Columbia University, pp. 136-138, no date.
Experience with CST: Programming and Implementation, Waldemar Horwat, Andrew A. Chien and William J. Dally, 1989, pp. 101-109.
Pollster, A Document Annotation System For Distributed Environment, Luis-Felipe Cabrera, Eric Mowat, pp. 142-157, Summer Conference Proceedings -Atlanta 1986.
Logical Routing Specification in Office Information Systems, Murray A. Maxer and Frederick H. Lochovsky, University of Toronoto, vol. 2, No. 4, Oct. 84, pp. 303-330.
Shi Shaw-Ben
Wang Peter C.-T.
Black Thomas G.
International Business Machines - Corporation
LaBaw Jeffrey S.
Lintz Paul R.
LandOfFree
Parent/child subset locking scheme for versioned objects does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Parent/child subset locking scheme for versioned objects, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parent/child subset locking scheme for versioned objects will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-349747