Parallel memory compaction

Electrical computers and digital processing systems: memory – Storage accessing and control – Control technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000

Reexamination Certificate

active

10744723

ABSTRACT:
A method for compaction of objects within a computer memory, the method including dividing a memory space into a plurality of non-overlapping sections, selecting a plurality of source sections from among the sections, each containing at least one object, selecting a plurality of target sections from among the sections, and moving any of the objects from the source section to the target section, where each of a plurality of pairs of the source and target sections is exclusively available to a different process from among a plurality of processes operative to perform any of the steps with a predefined degree of concurrency.

REFERENCES:
patent: 5088036 (1992-02-01), Ellis et al.
patent: 6910213 (2005-06-01), Hirono et al.
Ben-Yitzhak, Ori et al., “An Algorithm for Parallel Incremental Compaction”, ISMM '02, Jun. 20-21, 2002, Berlin, Germany, pp. 100-105.
Lang, Bernard et al., “Incrementally Compacting Garbage Collection”, Papers of the Symposium on Interpretive Technique, Jun. 24-26, 1978, St. Paul, Minnesota, United States, pp. 253-263.
Flood, Christine H. et al., “Parallel Garbage Collection for Shared Memory Multiprocessors”, USENIX Java Virtual Machine Research and Technology Symposium (JVM '01), Monterey, CA, Apr. 2001.

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

Parallel memory compaction does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Parallel memory compaction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel memory compaction will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3801599

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