Cheney's algorithm: Difference between revisions

Revision as of 09:00, 15 March 2013

Revision as of 07:00, 8 April 2014

Line 1:

{{Use dmy dates|date=August 2012}}

{{morefootnotes|date=April 2014}}

'''Cheney's algorithm''', first described in a 1970 [[Association for Computing Machinery|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 (data structure)|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.

Line 35 ⟶ 36:

| journal = Communications of the ACM

| volume = 13 | issue = 11 | date = November 1970 | pages = 677–678

| <!--doesn't seem to work properly-->={{doi|10.1145/362790.362798}}

| url = http://doi.acm.org/10.1145/362790.362798

| doi = 10.1145/362790.362798