Issue No. 04 - July (1982 vol. 8)
F.L. Vermeulen , Laboratorium voor Elektronika en Meettechniek, Rijksuniversiteit
Under certain assumptions, a garbage collection algorithm which compacts the dynamic storage area also involves sorting a set of pointers, whose order usually has only been partially disturbed since the last garbage coliection. Using this structure and combining the sorting and compaction, we can achieve a rather important reduction of the time to perform a garbage collection.
sorting of partially perturbed lists, Automatic space management, compaction, dynamic storage allocation, garbage collection
F. Vermeulen, "On the Combined Problem of Compaction and Sorting," in IEEE Transactions on Software Engineering, vol. 8, no. , pp. 432-435, 1982.