Efficient compile-time garbage collection for arbitrary data structures

Transactional Distributed 64-Bit Memory for PC-Clusters

Embedded Selforganising Systems ◽

10.14464/ess1124 ◽

2010 ◽

Vol 1 (1) ◽

pp. 10-18

Author(s):

Nico Kaemmer ◽

Steffen Gerhold ◽

Patrick Schmidt ◽

Michael Sonnenfroh ◽

Stefan Frenz ◽

...

Keyword(s):

Operating System ◽

Data Structures ◽

Garbage Collection ◽

Transactional Memory ◽

Distributed Objects ◽

Application Data ◽

Language Environment ◽

Consistency Models

The Rainbow operating system provides 64-Bit transactional memory operation for PC-clusters. Basic consistency of the distributed objects is guaranteed by an optimistic transactions scheme and weakened consistency models are available for application data structures. The Java-like language environment allows for binary isolation, compiler-based OS security and for clusterwide garbage collection. An optional pageserver will offer orthogonal persistence as well as subsecond restart and recovery.

Download Full-text

Intensional polymorphism in type-erasure semantics

Journal of Functional Programming ◽

10.1017/s0956796801004282 ◽

2002 ◽

Vol 12 (6) ◽

pp. 567-600 ◽

Cited By ~ 20

Author(s):

KARL CRARY ◽

STEPHANIE WEIRICH ◽

GREG MORRISETT

Keyword(s):

Data Structures ◽

Garbage Collection ◽

Type System ◽

Implementation Techniques ◽

Run Time ◽

Closure Conversion ◽

Type Information ◽

Time Type

Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, polymorphic marshalling and attened data structures. To date, languages that support intensional polymorphism have required a type-passing (as opposed to type-erasure) interpretation where types are constructed and passed to polymorphic functions at run time. Unfortunately, type-passing suffers from a number of drawbacks: it requires duplication of run-time constructs at the term and type levels, it prevents abstraction, and it severely complicates polymorphic closure conversion. We present a type-theoretic framework that supports intensional polymorphism, but avoids many of the disadvantages of type passing. In our approach, run-time type information is represented by ordinary terms. This avoids the duplication problem, allows us to recover abstraction, and avoids complications with closure conversion. In addition, our type system provides another improvement in expressiveness; it allows unknown types to be refined in place, thereby avoiding certain beta-expansions required by other frameworks.

Download Full-text