H.-J. Boehm. Reducing garbage collector cache misses. In T. Hosking, editor, ISMM 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Multiple Page Size Support in the Linux Kernel - Winwood, Shuf, Franke (2002) (1 citation) (Correct)
....separate well de ned regions. For Java programs, some performance gains are expected to come from better garbage collection (GC) performance. Much work during garbage collection is spent on chasing pointers in objects to nd all reachable objects in the region of the heap that is being collected [4]. Many reachable objects can be scattered throughout the heap. As a result, the locality of GCs is often worse than that of applications [11] This behavior is representative of systems employing non moving GCs which have to be used when some objects cannot be relocated (e.g. when not all ....
H.-J. Boehm. Reducing garbage collector cache misses. In Proc. of ISMM 2000.
Heap Memory Management in Prolog with Tabling: Principles and .. - Demoen, Sagonas (Correct)
....usually restrict the range of valid (heap) pointers in a system. Mark bits in a separate data structure enhance locality of reference because they can be packed together and thus their reading results in fewer cache misses than when they are in the header of the allocated objects: see [Boe00] for more details. The sliding phase compacts the heap by shoving the useful cells in the direction of the heap bottom, thereby making a contiguous area free for cheap allocation by pointer bumping. At the same time the root pointers are relocated: Morris algorithm [Mor78] is frequently used; ....
Hans-Juergen Boehm. Reducing garbage collector cache misses. In Proceedings of ISMM'2000: ACM SIGPLAN International Symposium on Memory Management, pages 59--64. ACM Press, October 2000.
Controlling Garbage Collection and Heap Growth to.. - Brecht, Arjomandi, Li, .. (2000) (12 citations) (Correct)
....garbage collection and heap growth and directly consider the tradeoff between execution time and application footprint. 6 Discussion Decreased garbage collection times, whether they are achieved by improvements to the implementation we ve used (e.g. by reducing cache misses during collections [5]) or by utilizing a different collector, may mean garbage collection can be invoked more frequently without negatively impacting the application s execution time. While we believe that this would make it easier to obtain a sweet spot in terms of collection frequency, we suspect that it would still ....
Hans-Juergen Boehm. Reducing garbage collector cache misses. In International Symposium on Memory Management, pages 59--64. ACM Press, October 2000. 12
The Hardness of Cache Conscious Data Placement (Extended.. - Petrank, Rawitz (2002) (Correct)
.... misses during code fetch reduces (see for example [23, 16, 14] a second avenue is to place data in the memory wisely using the memory manager (see for example [10, 7, 9, 8] and nally, algorithms may be modi ed so that they access the memory in a way that reduces cache misses (see for example [6, 20, 22, 18, 19]) In this work we concentrate on the rst two avenues: cache conscious data and cache conscious code placement. The study of cache conscious objects or code placement in the memory faces two major obstacles. The rst obstacle is in obtaining the input data for the placement algorithm. A wise data ....
H.-J. Boehm. Reducing garbage collector cache misses. In T. Hosking, editor, ISMM
Controlling Garbage Collection and Heap Growth to.. - Brecht, Arjomandi, Li, .. (2001) (12 citations) (Correct)
....controlling garbage collection and heap growth and directly consider the trade o between execution time and application footprint. 6. DISCUSSION Decreased garbage collection times, whether they are achieved by improving the implementation used (e.g. by reducing cache misses during collections [5]) or by utilizing a di erent collector, may mean garbage collection can be invoked more frequently without negatively impacting an application s execution time. While we believe that this would make it easier to obtain a sweet spot in terms of collection frequency, we suspect that it would still ....
H.-J. Boehm. Reducing garbage collector cache misses. In International Symposium on Memory Management, pages 59-64. ACM Press, Oct. 2000.
The Space Cost of Lazy Reference Counting - Boehm (2004) Self-citation (Boehm) (Correct)
No context found.
H.-J. Boehm. Reducing garbage collector cache misses. In Proceedings of the 2000.
Fast Multiprocessor Memory Allocation and Garbage Collection - Boehm (2000) (2 citations) Self-citation (Boehm) (Correct)
No context found.
H.-J. Boehm. Reducing garbage collector cache misses. In Proceedings of the 2000.
Quantifying the Performance of - Garbage Collection Vs (Correct)
No context found.
H.-J. Boehm. Reducing garbage collector cache misses. In T. Hosking, editor, ISMM 2000.
Relative Factors in Performance Analysis of Java Virtual - Machines Dayong Gu (Correct)
No context found.
H.-J. Boehm. Reducing garbage collector cache misses. In ISMM '00: Proceedings of the 2nd international symposium on Memory management, pages 59--64, Oct. 2000. ISBN 1-58113-263-8.
Quantifying the Performance of Garbage Collection vs. Explicit .. - Hertz, Berger (2005) (Correct)
No context found.
H.-J. Boehm. Reducing garbage collector cache misses. In T. Hosking, editor, ISMM 2000.
Creating and Preserving Locality of Java Applications - At Allocation And (Correct)
No context found.
H.-J. Boehm. Reducing garbage collector cache misses. In Management (ISMM 2000.
On the Cache Performance of Prolog Systems - Castro, Costa (2002) (Correct)
No context found.
H.-J. Boehm. Reducing garbage collector cache misses. In ISMM, pages 59-64, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC