Hiearchical real-time garbage collection
Uloženo v:
| Název: | Hiearchical real-time garbage collection |
|---|---|
| Autoři: | Filip Pizlo, Antony L. Hosking, Ibm T. J Watson |
| Přispěvatelé: | The Pennsylvania State University CiteSeerX Archives |
| Zdroj: | https://www.cs.purdue.edu/homes/hosking/papers/lctes07.pdf. |
| Rok vydání: | 2007 |
| Sbírka: | CiteSeerX |
| Témata: | General Terms Languages, Experimentation. Keywords Real-time systems, Java Memory management |
| Popis: | Memory management is a critical issue for correctness and perfor-mance in real-time embedded systems. Recent work on real-time garbage collectors has shown that it is possible to provide guar-antees on worst-case pause times and minimum mutator utiliza-tion time. This paper presents a new hierarchical real-time garbage collection algorithm for mixed-priority and mixed-criticality envi-ronments. With hierarchical garbage collection, real-time program-mers 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 utiliza-tion – all with only minimal changes to the application code. |
| Druh dokumentu: | text |
| Popis souboru: | application/pdf |
| Jazyk: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.490.8133 |
| Dostupnost: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.490.8133 |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Přístupové číslo: | edsbas.C8C4E36E |
| Databáze: | BASE |
Nájsť tento článok vo Web of Science Buďte první, kdo okomentuje tento záznam!