Determining the address range of a subtree of a linearized tree

Details Determining the address range of a subtree of a linearized tree Determining the address range of a subtree of a linearized tree

2011-07-26

2011-07-26

Kim, Paul (Department: 2169)

Data processing: database and file management or data structures

Garbage collection

C707S797000, C707S800000

Reexamination Certificate

active

07987214

ABSTRACT:
A method and computer system for determining the memory address range of a subtree of a linearized tree of objects or the original version of such tree when the tree has been modified or is concurrently being modified by other threads. The primary application of the method is in garbage collection for multiprocessor shared memory computers with very large memories, but it is also relevant for a number of other applications.

REFERENCES:
patent: 7415452 (2008-08-01), Ayers
V. Gopalakrishna and C. E. Veni Madhavan: Performance Evaluation of Attribute-based Tree Organization, ACM Transactions on Database Systems, 6(1):69-87, 1980.
J. Budgaard: The Development of an Ada Front End for Small Computers, ACM SIGAda Ada Letters, vol. V, Issue 2, pp. 321-328, 1985.
J. E. Stucka and R. Wiss: Stack Algorithm for Extracting Subtree from Serialized Tree, IBM Technical Disclosure Bulletin, 37(3):3-6, 1994.
P. A. Bernstein, V. Hadzilacos and N. Goodman: Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987, Section 5, pp. 143-166.
N. Shavit & D. Touitou: Software Transactional Memory, ACM Symposium on the Principles of Distributed Computing, 1995 (extended version).
M. Greenwald: Non-Blocking Synchronization and System Design, PhD Thesis, Department of Computer Science, Stanford University, 1999 (especially Section 3.2 pp. 40-65).
H. Gao: Design and Verification of Lock-free Parallel Algorithms, PhD Thesis, Wiskunde en Natuurwetenschappen, Riksuniversiteit Groningen, 2005 (especially Section 2 pp. 21-56).
R. Jones and R. Lins: Garbage Collection: Algorithms for Dynamic Memory Management. Wiley, 1996 (especially pp. 150-153, 165-174, 187-193, 199-200, 214-215, 222-223).

Affiliated with

Also associated with

Rating

Determining the address range of a subtree of a linearized tree does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Determining the address range of a subtree of a linearized tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining the address range of a subtree of a linearized tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2724564