Efficient parallel bitwise sweep during garbage collection

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S147000, C711S145000, C711S161000, C711S170000

Reexamination Certificate

active

10862137

ABSTRACT:
A method, system, and program for efficient parallel bitwise sweeps of larger objects during garbage collection are provided. During a bitwise sweep, a helper thread scans a mark vector looking for a consecutive sequence of unmarked bits of a sufficient length following a marked bit. Once a consecutive sequence of unmarked bits of a sufficient length following a marked bit is detected, the helper thread fetches the size of a marked object corresponding to the marked bit. If the size of the marked object exceeds a size represented by the consecutive sequence of unmarked bits, the remainder of the bits representing the marked object are skipped, such that once a marked object is identified as potentially exceeding an object fetch threshold the helper thread efficiently skips the remainder of the bits represents the marked object and continues scanning for a number of consecutive zeroes indicating free space.

REFERENCES:
patent: 6070173 (2000-05-01), Huber et al.
patent: 6148310 (2000-11-01), Azagury et al.
patent: 6173294 (2001-01-01), Azagury et al.
patent: 6199075 (2001-03-01), Ungar et al.
patent: 6226653 (2001-05-01), Alpern et al.
patent: 6289360 (2001-09-01), Kolodner et al.
patent: 6317756 (2001-11-01), Kolodner et al.
patent: 6324631 (2001-11-01), Kuiper
patent: 6393440 (2002-05-01), Salant et al.
patent: 6434575 (2002-08-01), Berry et al.
patent: 6457023 (2002-09-01), Pinter et al.
patent: 6470361 (2002-10-01), Alpern et al.
patent: 6490599 (2002-12-01), Kolodner et al.
patent: 6510440 (2003-01-01), Alpern et al.
patent: 6865585 (2005-03-01), Dussud
patent: 2002/0055941 (2002-05-01), Kolodner et al.
patent: 2002/0099918 (2002-07-01), Avner et al.
patent: 2003/0009547 (2003-01-01), Benfield et al.
patent: 2003/0220952 (2003-11-01), Borman et al.
patent: 2005/0114413 (2005-05-01), Subramoney et al.
patent: 2005/0138319 (2005-06-01), Abuaiadh et al.
patent: 2005/0149945 (2005-07-01), Stichnoth
patent: 2005/0188164 (2005-08-01), Ballantyne et al.
patent: 2005/0198088 (2005-09-01), Subramoney et al.
patent: 2005/0216539 (2005-09-01), Wu et al.
patent: 2005/0234974 (2005-10-01), Bailey et al.
patent: 2007/0073793 (2007-03-01), Blandy et al.
patent: 2 345 159 (2000-06-01), None
patent: 2 345 160 (2000-06-01), None
U.S. Appl. No. 10/862,151, filed Jun. 4, 2004, Blandy.
U.S. Appl. No. 10/862,138, filed Jun. 4, 2004, Blandy.
U.S. Appl. No. 10/948,276, filed Sep. 23, 2004, Achanta et al.
Dimpsey et al, “Java Server Performance: A case study of building efficient, scalable JVMs”, IBM Systems Journal, vol. 39, No. 1, 2000, pp. 151-174.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Efficient parallel bitwise sweep during garbage collection does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient parallel bitwise sweep during garbage collection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient parallel bitwise sweep during garbage collection will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3940548

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.