Effective “static-graph” reorganization to improve locality in garbage-collected systems

Wilson, Paul R.; Lam, Michael S.; Moher, Tom

doi:10.1145/113445.113461

Cited by 60 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several authors have considered how to use copying collection to improve the locality of mutators. Depth-first or pseudo depth-first copying can improve over breadth-first copying [24,25,31,41]. The collector can also be proactively invoked to improve locality [13,15].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The locality of concurrent write barriers

Hellyer

Jones

Hosking

2010

Proceedings of the 2010 International Symposium on Memory Management

View full text Add to dashboard Cite

Concurrent and incremental collectors require barriers to ensure correct synchronisation between mutator and collector. The overheads imposed by particular barriers on particular systems have been widely studied. Somewhat fewer studies have also compared barriers in terms of their termination properties or the volume of floating garbage they generate. Until now, the consequences for locality of different barrier choices has not been studied, although locality will be of increasing importance for emerging architectures. This paper provides a study of the locality of concurrent write barriers, independent of the processor architecture, virtual machine, compiler or garbage collection algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

“…The collector can also be proactively invoked to improve locality [13,15]. Objects can also be reordered statically by type in order to colocate related objects or hot fields of objects [24,26,30,41].…”

Section: Related Workmentioning

confidence: 99%

The locality of concurrent write barriers

Hellyer

Jones

Hosking

2010

Proceedings of the 2010 International Symposium on Memory Management

View full text Add to dashboard Cite

show abstract

Swap compression: resurrecting old ideas

Cortes

Becerra

Cervera

2000

Softw: Pract. Exper.

View full text Add to dashboard Cite

The performance of memory-intensive applications tends to be poor due to the high overhead added by the swapping mechanism. The same problem may be found in highly-loaded multi-programming systems where all running applications have to use the swap space in order to be able to execute at the same time.In this paper, we present a solution to these problems. The idea consists of compressing the swapped pages and keeping them in a swap cache whenever possible.The idea of a compressed swap cache was proposed a few years ago, but it did not achieve the expected results due to hardware limitations. As processors are much faster and the performance gap between processors and disk is also much bigger, we believe that now it is the right time to revisit this idea. In this paper, we present a new implementation of the compressed cache, plus some enhancements that significantly improve the performance of the swapping mechanism. A FIRST APPROACH TerminologyBefore starting to describe the compressed swap cache, we believe it is necessary to define some terms that might otherwise get mixed up.

show abstract