论文信息 - Hash-consing Garbage Collection

Hash-consing Garbage Collection

We describe an implementation of hash-consing for the Standard ML of New Jersey compiler. Hash-consing can eliminate replication among heap-allocated data, which may allow the use of fast equality checking and may also improve the locality of reference of a program. The cost of a hash table lookup for each record allocated may, however, o set any gains from the elimination of replication. Our hash-consing scheme is integrated with a generational garbage collector. Only records that survive a garbage collection are \hash-consed," thus avoiding the cost of a table lookup for short-lived records. We discuss some issues related with the implementation of this scheme and present a performance evaluation. a Supported in part by NSF Grant CCR-9200790 ySupported by CNPQ Grant 200579/90.8

Andrew W. Appel | Marcelo J. r. Gon alves | A. Appel

[1] Richard S. Bird,et al. Tabulation Techniques for Recursive Programs , 1980, CSUR.

[2] Richard P. Gabriel,et al. Performance and evaluation of Lisp systems , 1985 .

[3] Andrew W. Appel,et al. A Standard ML compiler , 1987, FPCA.

[4] Ifor Williams,et al. The design and evaluation of a high-performance smalltalk system , 1988 .

[5] Chris Reade,et al. Elements of functional programming , 1989, International computer science series.

[6] Andrew W. Appel,et al. Simple generational garbage collection and fast allocation , 1989, Softw. Pract. Exp..

[7] Andrew W. Appel,et al. A runtime system , 1990, LISP Symb. Comput..

[8] Paul R. Wilson,et al. Effective “static-graph” reorganization to improve locality in garbage-collected systems , 1991, PLDI '91.

[9] Henry G. Baker,et al. The Boyer Benchmark at warp speed , 1992 .

[10] Henry G. Baker,et al. The Gabriel “Triangle” Benchmark at warp speed , 1992 .

[11] Henry G. Baker,et al. A tachy “TAK” , 1992 .

[12] M. Friedman,et al. On Programming of Arithmetic Operations , .