Treffer: Garbage collection algorithms for Java-based prolog engines

Title:
Garbage collection algorithms for Java-based prolog engines
Authors:
QINAN ZHOU, TARAU, Paul
Source:
PADL 2003 : practical aspects of declarative languages (New Orleans LA, 13-14 January 2003)Lecture notes in computer science. :304-319
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 23 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Gestion des mémoires et des fichiers (y compris la protection et la sécurité des fichiers), Memory and file management (including protection and security), Algorithme adaptatif, Adaptive algorithm, Algoritmo adaptativo, Allocation mémoire, Storage allocation, Asignación memoria, Gestion mémoire, Storage management, Gestión memoria, Gestion temps, Time management, Langage JAVA, JAVA language, Lenguaje JAVA, PROLOG, Ramasse-miettes, Garbage collector, Recogemigas
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of North Texas, Denton, TX 76203, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15133206
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15133206
Database:
PASCAL Archive

Weitere Informationen

Implementing a Prolog Runtime System in a language like Java, which provides its own automated memory management and safety features (like built-in index checking and array initialization) requires a consistent approach to memory management based on a simple ultimate goal: minimizing total memory management time (the sum of Java's own and ours). Based on our experience with Jinni 2002 -a Java based compiled Prolog system, we analyze the existing garbage collection algorithms and propose new optimizations. In particular, we aim to have a garbage collector with least extra helper memory space yet with reasonably fast speed. Efforts are made in reducing both time and space overhead for the mark-sweep-compact algorithm. We suggest an in-place compaction algorithm and provide its implementation. As the Prolog engine uses dynamic arrays for its stacks, the impact of Java's garbage collector on the system becomes a key factor. In this context, we measure and optimize the performance of the garbage collector with the overall memory management scheme in mind.