• Hierarchical real-time garbage...

Treffer: Hierarchical real-time garbage collection

Title:
Hierarchical real-time garbage collection
Authors:
PIZLO, Filip, HOSKING, Antony L, VITEK, Jan
Source:
Proceedings of the 2007 ACM SIGPLAN-SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES 2007), San Diego, California, June 13-15, 2007ACM SIGPLAN notices. 42(7):123-133
Publisher Information:
Broadway, NY: ACM, 2007.
Publication Year:
2007
Physical Description:
print, 24 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, Logiciel, Software, Langages de programmation, Programming languages, 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), Calculateur embarqué, Boarded computer, Calculador embarque, Criticité, Criticality, Criticidad, Gestion mémoire, Storage management, Gestión memoria, Langage JAVA, JAVA language, Lenguaje JAVA, Langage programmation, Programming language, Lenguaje programación, Méthode cas pire, Worst case method, Método caso peor, Ramasse-miettes, Garbage collector, Recogemigas, Réponse temporelle, Time response, Respuesta temporal, Système temps réel, Real time system, Sistema tiempo real, Temps minimal, Minimum time, Tiempo mínimo, Temps occupation, Occupation time, Tiempo ocupación, Temps réel, Real time, Tiempo real, Temps réponse, Response time, Tiempo respuesta, Experimentation. Real-time systems, Java Memory management, Languages
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Purdue University, United States
IBM T.J Watson Purdue University, United States
ISSN:
1523-2867
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19154355
Rights:
Copyright 2007 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.19154355
Database:
PASCAL Archive

Weitere Informationen

Memory management is a critical issue for correctness and performance in real-time embedded systems. Recent work on real-time garbage collectors has shown that it is possible to provide guarantees on worst-case pause times and minimum mutator utilization time. This paper presents a new hierarchical real-time garbage collection algorithm for mixed-priority and mixed-criticality environments. With hierarchical garbage collection, real-time programmers can partition the heap into a number of heaplets and for each partition choose to run a separate collector with a schedule that matches the allocation behavior and footprint of the real-time task using it. This approach lowers worst-case response times of real-time applications by 26%, while almost doubling mutator utilization - all with only minimal changes to the application code.