Cheney's algorithm - Wikipedia, the free encyclopedia

Cheney's algorithm - Wikipedia, the free encyclopedia

Cheney's algorithm This article includes a list of references , but its sources remain unclear because it has insufficient inline citations . Please help to improve this article by introducing more precise citations. (April 2014) Cheney's algorithm, first described in a 1970 ACM paper by C.J. Cheney, is a method of garbage collection in computer software systems. In this scheme, the heap is divided into two equal halves, only one of which is in use at any one time. Garbage collection is performed by copying live objects from one semispace (the from-space) to the other (the to-space), which then becomes the new heap. The entire old heap is then discarded in one piece. Cheney's algorithm reclaims items as follows: Object references on the stack. Object references on the stack are checked. One of the two following actions is taken for each object reference that points to an object in from-space: If the object has not yet been moved to the to-space,

Read full article from Cheney's algorithm - Wikipedia, the free encyclopedia