A new list compaction method

Authors:

Kai Li and Paul Hudak

Abstract:

List compaction, or so-called 'cdr-coding', can greatly reduce the storage needs of list processing languages.  However, existing methods do not perform well when several lists are being constructed simultaneously from the same heap, since the non-contiguous nature of the cells being allocated eliminates the opportunity for compaction.  This situation arises not only in true parallel systems sharing a common memory, and sequential systems supporting multiple processes, but also quite often in purely sequential systems, where it is not uncommon to build several different lists simultaneously within a single loop.  In this paper, a new list compaction
method is presented that performs well during both sequential and 'parallel' list generation.  The method is essentially a generalization of cdr-coding, in which lists are represented explicitly as linked vectors rather than implicitly as compacted memory.  In addition, an encoding scheme is used that is as simple or simpler than all known encodings, and destructive operations are
supported with no greater overhead than existing schemes.  Performance figures in a simulated environment suggest that the strategy consistently performs better than conventional cdr-coding, with essentially the same complexity.

Bibtex:

 @article{huda86c
    ,key={li}
    ,author={Li, K. and Hudak, P.}
    ,title={A new list compaction method}
    ,journal={Software -- Practice and Experience}
    ,volume=16
    ,number=2
    ,month=Feb
    ,year=1986
    ,pages={145-163}
    } 

Links:

List-Compact-SPE.pdf