Revision as of 16:04, 17 March 2006 edit Tony Sidaway (talk \| contribs) Extended confirmed users, Pending changes reviewers 81,722 edits mNo edit summary ← Previous edit		Revision as of 16:07, 17 March 2006 edit undo Tony Sidaway (talk \| contribs) Extended confirmed users, Pending changes reviewers 81,722 edits mNo edit summary Next edit →
Line 1: '''Cheney's algorithm''', first described in a 1970 ACM paper by C.J. Cheney, is a method of [[garbage collection (computer science)\|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:

Cheney's algorithm: Difference between revisions