|
ABSTRACT
Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essentially random: a given object may contain references to any other object. Since application heaps are typically much larger than hardware caches, tracing results in many cache misses. Technology trends will make cache misses more important, so tracing is a prime target for prefetching.Simulation of Java benchmarks running with the Boehm-De-mers-Weiser mark-sweep garbage collector for a projected hardware platform reveal high tracing overhead (up to 65% of elapsed time), and that cache misses are a problem. Applying Boehm's default prefetching strategy yields improvements in execution time (16% on average with incremental/generational collection for GC-intensive benchmarks), but analysis shows that his strategy suffers from significant timing problems: prefetches that occur too early or too late relative to their matching loads. This analysis drives development of a new prefetching strategy that yields up to three times the performance improvement of Boehm's strategy for GC-intensive benchmark (27% average speedup), and achieves performance close to that of perfect timing ie, few misses for tracing accesses) on some benchmarks. Validating these simulation results with live runs on current hardware produces average speedup of 6% for the new strategy on GC-intensive benchmarks with a GC configuration that tightly controls heap growth. In contrast, Boehm's default prefetching strategy is ineffective on this platform.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
 |
3
|
|
 |
4
|
|
 |
5
|
Hans-J. Boehm , Alan J. Demers , Scott Shenker, Mostly parallel garbage collection, Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, p.157-164, June 24-28, 1991, Toronto, Ontario, Canada
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
 |
9
|
|
| |
10
|
James Gosling , Bill Joy , Guy Steele , Gilad Bracha, Java Language Specification, Second Edition: The Java Series, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2000
|
| |
11
|
Horowitz, M., Martonosi, M., Mowry, T. C., and Smith, M. D. Informing memory operations: Memory performance feedback mechanisms and their applications.
|
| |
12
|
Hughes, R. J. M. A semi-incremental garbage collection algorithm. Software---Practice and Experience 21, 11 (Nov. 1982), 1081--1084.
|
| |
13
|
|
| |
14
|
Karlsson, M., Dahlgren, F., and Stenström, P. A prefetching technique for irregular accesses to linked data structures. In Proceedings of the International Symposium on High Performance Computer Architecture (Toulouse, France, Jan.). IEEE Computer Society, 2000, pp. 206--217.
|
| |
15
|
Mikko H. Lipasti , William J. Schmidt , Steven R. Kunkel , Robert R. Roediger, SPAID: software prefetching in pointer- and call-intensive environments, Proceedings of the 28th annual international symposium on Microarchitecture, p.231-236, November 29-December 01, 1995, Ann Arbor, Michigan, United States
|
 |
16
|
|
 |
17
|
Amir Roth , Andreas Moshovos , Gurindar S. Sohi, Dependence based prefetching for linked data structures, Proceedings of the eighth international conference on Architectural support for programming languages and operating systems, p.115-126, October 02-07, 1998, San Jose, California, United States
|
 |
18
|
|
| |
19
|
|
 |
20
|
|
| |
21
|
SPEC. SPECjvm98 benchmarks, 1998. http://www.spec.org/osg/jvm98.
|
 |
22
|
|
| |
23
|
Artour Stoutchinin , José N. Amaral , Guang R. Gao , James C. Dehnert , Suneel Jain , Alban Douillet, Speculative Prefetching of Induction Pointers, Proceedings of the 10th International Conference on Compiler Construction, p.289-303, April 02-06, 2001
|
 |
24
|
|
 |
25
|
|
 |
26
|
|
INDEX TERMS
Primary Classification:
B.
Hardware
B.3
MEMORY STRUCTURES
B.3.2
Design Styles
Subjects:
Cache memories
Additional Classification:
B.
Hardware
B.8
Performance and Reliability
B.8.2
Performance Analysis and Design Aids
D.
Software
D.3
PROGRAMMING LANGUAGES
D.3.4
Processors
Subjects:
Run-time environments;
Memory management (garbage collection)
General Terms:
Algorithms,
Design,
Experimentation,
Languages,
Management,
Measurement,
Performance
Keywords:
breadth-first,
buffered prefetch,
cache architecture,
depth-first,
garbage collection,
mark-sweep,
prefetch-on-grey,
prefetching
|