The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
Programming Techniques: ASP—a ring implemented associative structure package
Communications of the ACM
A generalized technique for symbol manipulation and numerical calculation
Communications of the ACM
Compound data structure for computer aided design; a survey
ACM '67 Proceedings of the 1967 22nd national conference
A LISP Garbage Collector Algorithm Using Serial Secondary Storage
A LISP Garbage Collector Algorithm Using Serial Secondary Storage
The impact of storage management on plex processing language implementation
The impact of storage management on plex processing language implementation
LISP 1.5 Programmer's Manual
An architecture for efficient Lisp list access
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Incremental incrementally compacting garbage collection
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Parcel: project for the automatic restructuring and concurrent evaluation of LISP
ICS '88 Proceedings of the 2nd international conference on Supercomputing
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
ISCA '99 Proceedings of the 26th annual international symposium on Computer architecture
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Compact Encodings of List Structure
ACM Transactions on Programming Languages and Systems (TOPLAS)
Design of a LISP-based microprocessor
Communications of the ACM
An empirical study of list structure in Lisp
Communications of the ACM
A time- and space-efficient garbage compaction algorithm
Communications of the ACM
A nonrecursive list compacting algorithm
Communications of the ACM
New LISP techniques for a paging environment
Communications of the ACM
Divide and concer: Data structuring in applicative multiprocessing systems
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Garbage collection for embedded systems
Proceedings of the 4th ACM international conference on Embedded software
IFL'02 Proceedings of the 14th international conference on Implementation of functional languages
| Hi-index | 48.30 |
Compact lists are stored sequentially in memory, rather than chained with pointers. Since this is not always convenient, the Swym system permits a list to be chained, compact, or any combination of the two. A description is given of that list representation and the operators implemented (most are similar to those of LISP 1.5). The system garbage collector attempts to make all lists compact; it relocates and rearranges all of list storage using temporary storage. This unique list-compacting garbage collection algorithm is presented in detail. Several classes of the macros used to implement the system are described. Finally, consideration is given to those design factors essential to the success of a plex processing system implementation.