This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Combined Problem of Compaction and Sorting
July 1982 (vol. 8 no. 4)
pp. 432-435
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.
Index Terms:
sorting of partially perturbed lists, Automatic space management, compaction, dynamic storage allocation, garbage collection
Citation:
F.L. Vermeulen, "On the Combined Problem of Compaction and Sorting," IEEE Transactions on Software Engineering, vol. 8, no. 4, pp. 432-435, July 1982, doi:10.1109/TSE.1982.235577
Usage of this product signifies your acceptance of the Terms of Use.