The generated order preserving real-time garbage collection

Authors:
H. Koide
Affiliations:
-
Venue:
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
Year:
1995

Citing 5
Cited 0

Real-time concurrent collection on stock multiprocessors

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Performance analysis of on-the-fly garbage collection

Communications of the ACM
List processing in real time on a serial computer

Communications of the ACM
A time- and space-efficient garbage compaction algorithm

Communications of the ACM
A LISP garbage-collector for virtual-memory computer systems

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new real-time garbage collection that always preserves the order of object creation. Some programming languages and application programs need to preserve the generated order of objects. The proposed method is the first type of the garbage collection that can be used to make them run in real-time. Since the generated order preserving scavenging garbage collection is partly employed, the complexity of the proposed method is not related to the heap size. The requirements for the real-time processing is also presented.