R. E. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester, July 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
SCHEDULING GARBAGE COLLECTION OF JAVAVM ON EMBEDDED REALTIME .. - Of The University (Correct)
....in more detail in Chapter 5. This chapter surveys several garbage collection algorithms including referencecounting, mark sweep, and copying as basic algorithms and incremental and generational garbage collection algorithms as a common approach to reduce the pause time in tracing 7 collectors [JON94, WIL94]. Garbage collection algorithms reflecting real time requirements are introduced in Chapter 5. Basic Garbage Collection Techniques There are two basic approaches to find live objects in memory space: by reference counting and by tracing. Reference counting garbage collectors keep a count of ....
....GC B 0 28.34 B 1 37.12 (per MB) B 2 0.012 B 3 0.004 B 0 2.16 B 1 54.21 (per MB) B 2 0.005 B 3 0.004 Besides the heap size, the collection cost is dominated by the marking phase more than the sweeping phase. Linearly scanning the heap will generally be less expensive than tracing data structures [JON94]. The number of alive objects, L, and the number of garbage objects, G, in above equation (A) are dependent on elapsed time for marking phase and elapsed time for sweeping phase, respectively. The difference in parameters B 2 and B 3 of non incremental GC in Table 7 explains this fact. A parameter ....
Jones, Richard, and Lins, Rafael, Garbage Collection Algorithms for Automatic Dynamic Memory Management, Wiley, New York, 513-646, 1996.
Tuning Garbage Collection in an Embedded Java Environment - Chen, Shetty, Kandemir, .. (2002) (3 citations) (Correct)
....have started to investigate architectural support for reducing leakage in cache architectures [23, 16] In this paper, we show that it is possible to also reduce leakage energy in memory by shutting down idle banks using an integrated hardware software strategy. The garbage collector (GC) [13] is an important part of the JVM and is responsible for automatic reclamation of heapallocated storage after its last use by a Java application. Various aspects of the GC and heap subsystems can be configured at JVM runtime. This allows control over the amount of memory in the embedded device that ....
....reduce the memory energy (leakage and dynamic) consumption in an embedded Java environment. Since garbage collection is a heap intensive (i.e. memory intensive) operation and directly affects application performance, its impact on performance has been a popular research topic (e.g. see [13] and the references therein) In an embedded portable environment, however, its impact on energy should also be taken into account. This is important not because the garbage collector itself consumes a sizeable portion of overall energy during execution, but because it influences the energy ....
[Article contains additional citation context not shown here]
R. Jones and R. D. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons. 1999.
Unknown - Vm Conference August (Correct)
....or registered trademarks of SPARC International, Inc. in the United States and other countries. Products bearing SPARC trademarks are based upon an architecture developed by Sun Microsystems, Inc. 1 Introduction Generational garbage collection [24] is a widespread and popular technique [30, 21, 32, 6, 3]. Generational collection usually both decreases average GC pause times (since most collections target just the youngest generation) and also increases GC e#ciency (by concentrating collection work on the youngest generation, whose objects often die young) In collecting the youngest generation, ....
....and write barrier code sequences, then the application of concurrency to garbage collection. 2.1 Remembered sets and write barriers Many remembered set representations have been proposed in the literature, with associated write barriers. Chapter 7. 5 of Jones and Lins garbage collection reference [21] contains an excellent overview. The sequential store bu#er scheme of Hosking, Moss, and Stefanovic [19] is similar to our log based barriers in that it separates data structures updated by mutator barriers from remembered set representations. However, the details of the mutator barrier code ....
Richard Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, Ltd, 1996.
Effective Compile-Time Analysis for Data Prefetching in Java - Cahoon (2002) (Correct)
....the future Configuration 154 6.1 The Heap at the Start of a Collection . 158 6.2 The Heap at the End of a Collection . 158 6. 3 Cheney s Algorithm (from Jones and Lin [52]) 158 6.4 Snapshot of Cheney s Copying Algorithm . 159 6.5 Extended to Cheney s Algorithm to Handle Jump Pointers . 162 xvi 6.6 Performance with Garbage Collection . ....
....E F A B D To Space Figure 6.1. The Heap at the Start of a Collection A D F B E C To Space Figure 6.2. The Heap at the End of a Collection cheney scan( scan = free = To space; R = copy(R) P = copy(P) scan = scan size(scan) Figure 6.3. Cheney s Algorithm (from Jones and Lin [52]) current allocation point. Cheney s algorithm processes each object between scan and free, copying each object s reference fields, until the two pointers are equal. The algorithm performs a breadth first traversal of the live objects. Figure 6.3 shows the pseudo code for Cheney s algorithm. ....
Richard Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, 1996.
An Experimental Study of Renewal-Older-First Garbage Collection - Hansen, Clinger (Correct)
.... Languages] Processors Memory management (garbage collection) General Terms Algorithms, Measurement, Performance, Experimentation Keywords generational garbage collection, older first 1 Introduction Garbage collection is a technology that automatically reclaims unreachable heap storage [24]. As is common in the literature on garbage collection, we use live as a synonym for reachable, and dead as a synonym for unreachable. Generational garbage collectors divide the heap into two or more regions, known as generations because they often group objects of similar age, and ....
....first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and or a fee. ICFP 02, October 4 6, 2002, Pittsburgh, Pennsylvania, USA. Copyright 2002 ACM 1 58113 487 8 02 0010 . 5. 00 lect these generations at different times [24, 27]. Most generational garbage collectors attempt to collect younger generations more frequently than older generations, so we call them younger first collectors. Younger first generational garbage collectors usually outperform non generational garbage collectors. Why One pop explanation is that ....
[Article contains additional citation context not shown here]
Richard Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, 1996.
The Jrpm System for Dynamically Parallelizing Java Programs - Chen, Olukotun (2003) (1 citation) (Correct)
....must properly terminate speculative execution before jumping to an exception handler external to the STL. 5.2 Garbage Collection Originally, memory allocation during speculation interfered with performance in several benchmarks. Our JVM uses a fast concurrent mark and sweep garbage collector [23]. Unallocated objects are stored in a linked free list. Allocating objects on every speculative thread of a STL caused a serializing dependency on this linked list. To deal with this, we parallelized access to the allocator during speculation. This was achieved by maintaining several free lists ....
....access to the allocator during speculation. This was achieved by maintaining several free lists that can be accessed privately by each processor during speculative execution. Similar techniques could be applied to prevent serializing dependencies in JVMs that use copying garbage collectors [23]. 5.3 Synchronized Objects In Java, method invocations can be explicitly synchronized to an object (using the synchronized keyword [16] to prevent concurrent accesses from multiple explicit Java threads. A simple object lock will cause an inter thread dependency if it is locked and unlocked on ....
Jones, R. and Lins, R. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, Chichester, UK, 1996.
Safe Class and Data Evolution in Large and Long-Lived Java.. - Dmitriev (2001) (10 citations) (Correct)
....VM was derived from the Sun s Classic VM and was originally called Exact VM. This name refers to its ability to support exact memory management, i.e. all the pointers on the runtime stacks and objects are known to the garbage collector (such an approach is also called non conservative or accurate [Jon96] EVM was released by Sun in the JDK1.2, Solaris Production Release. However, in the subsequent JDK releases it was replaced with the HotSpot VM. At the same time, in Autumn 1999, EVM was renamed Sun Labs Research VM and was retargetted to purely research purposes. a sharp contrast with PJama ....
R. E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, Ltd., 1996. With a chapter on Distributed Garbage Collection by R.Lins.
To Collect or Not To Collect? Machine Learning for Memory.. - Andreasson, Hoffmann (Correct)
....threads to stop, which would not be necessary if the concurrent garbage collector had started in time, since a concurrent garbage collector allows running applications to run concurrently with some phases of the garbage collection. For further reading about garbage collection, see references [2, 6, 8, 9, 13, 14]. An important issue, when it comes to concurrent garbage collection in a JVM, is to decide when to garbage collect. Concurrent garbage collection must not start too late, or else the running program may run out of memory. Neither must it be invoked too frequently, since this causes more garbage ....
....too frequently, since this causes more garbage collections than necessary and thereby disturbs the execution of the running program. The key idea in our approach is to find the optimal trade off between time and memory resources by letting a learning decision process decide when to garbage collect [2, 6, 8, 9, 13, 14]. 4 Reinforcement Learning Reinforcement learning methods solve a class of problems known as Markov Decision Processes (MDP) If it is possible to formulate the problem at hand as an MDP, reinforcement learning provides a suitable approach to its solution [3, 4, 5] Decision process ....
[Article contains additional citation context not shown here]
Jones, R. and Lins, R. (1996). Garbage collection -- algorithms for automatic dynamic memory management. John Wiley & Sons Ltd., Chichester, England, UK.
Immutability Specification and its Applications - Pechtchanski, Sarkar (2002) (4 citations) (Correct)
....operation that did not pass verification, and checks if it violates any of the immutability assertions. Runtime checking can be expensive, which is why it is important to filter out as many write operations in Stages 1 and 2 as possible. Past experience with runtime checking using write barriers [14], suggests that runtime checking of write operations need not incur a large overhead if appropriate optimizations are performed. It is most convenient to implement run time checking via code instrumentation; the instrumentation can be performed on the JIT compiled code or on the bytecode. As a ....
R. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, Chichester, England, 1996.
the Garbage Collection Bibliography - Richard Jones (2003) Self-citation (Jones) (Correct)
....Barry Hayes, Daniel G. Bobrow, and Scott Shenker. Combining generational and conservative garbage collection: Framework and implementations. In POPL [POPL1990] pages 261 269. Demoen and Sagonas, 1998] Bart Demoen and Konstantinos Sagonas. Memory management for Prolog with tabling. In Jones [Jones1998] pages 97 106. Demoen et al. 1996] Bart Demoen, Geert Engels, and Paul Tarau. Segment preserving copying garbage collection for WAM based Prolog. In Jim Hightower, editor, ACM Symposium on Applied Computing, Philadelphia, February 1996. ACM Press. Programming languages track. Demoen et al. 2002] Bart Demoen, Phuong Lan Nguyen, ....
Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
Beltway: Getting Around Garbage Collection Gridlock - Blackburn, Jones, McKinley.. (2002) (11 citations) Self-citation (Jones) (Correct)
....this observation, generational collectors avoid collecting old objects. 3) Using incrementality to improve response time has led to the use of small nursery generations and to incremental algorithms [13, 24] 4) Researchers also use small nurseries and copying collectors to improve data locality [25, 38]. 5) More recently, Stefanovic et al. demonstrate that giving the very youngest objects time to die can improve collector performance [32] The Beltway collection framework is the first to combine and exploit all five insights flexibly and efficiently. In addition, Beltway generalizes over ....
Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
Quantifying the Performance of - Garbage Collection Vs (Correct)
No context found.
R. E. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester, July 1996.
An On-the-Fly Mark and Sweep Garbage Collector Based on.. - Hezi Azatchi Yossi (Correct)
No context found.
Richard E. Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996.
Barriers: Friend or Foe? - Stephen Blackburn Department (Correct)
No context found.
JONES, R., AND LINS, R. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, May 1996. Chapter on distributed collection by Lins.
Integrating Generations with Advanced Reference - Counting Garbage Collectors (Correct)
No context found.
Richard E. Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996.
Relative Factors in Performance Analysis of Java Virtual - Machines Dayong Gu (Correct)
No context found.
R. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, Ltd, 1996.
Garbage Collection Without Paging - Matthew Hertz Yi (Correct)
No context found.
R. E. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester, July 1996.
Using Page Residency to Balance Tradeoffs - In Tracing Garbage (Correct)
No context found.
R. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, 1996.
Garbage Collection without Paging - Hertz, Feng, Berger (2005) (Correct)
No context found.
R. E. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester, July 1996.
Dynamic Selection of Application-Specific Garbage Collectors - Soman, Krintz, Bacon (2004) (1 citation) (Correct)
No context found.
JONES, R. E. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
Resource Management in Open Tuple Space Systems - de Menezes (1999) (Correct)
No context found.
Richard Jones and Rafael Lins. Garbage Collection --- Algorithms for Automatic Dynamic Memory Management. Wiley, 1996.
Dependence Analysis for Java - Craig Chambers Igor (1999) (10 citations) (Correct)
No context found.
Richard Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, 1996.
Field Level Analysis for Heap Space Optimization.. - Chen, Kandemir.. (2004) (Correct)
No context found.
R. Jones and R. Lins. Garbage Collection: algorithms for automatic dynamic memory management.John Wiley & Sons, 1996.
Connectivity-Based Garbage Collection - Hirzel (2004) (2 citations) (Correct)
No context found.
Richard Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Son Ltd., 1996.
Dead Timestamp Identification in Stampede - Nissim Harel Nissim (2002) (Correct)
No context found.
R. Jones and R. Lins. Garbage Collection : Algorithms for Automatic Dynamic Memory Management. John Wiley, August 1996.
A Comparative Study of Stampede Garbage Collection Algorithms - Hasnain Mandviwala Mandvi (2002) (Correct)
No context found.
R. Jones and R. Lins. Garbage Collection : Algorithms for Automatic Dynamic Memory Management. John Wiley, August 1996.
Myths and Realities: The Performance Impact of Garbage Collection - Blackburn, al. (2004) (1 citation) (Correct)
No context found.
R. E. Jones and R. D. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996.
A Generic Middleware for Intra-Language Transparent.. - Klintskog, Banna, Brand (2003) (1 citation) (Correct)
No context found.
Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996. With a chapter on Distributed Garbage Collection by R. Lins. 72
On-the-Fly Cycle Collection Revisited - Paz, Bacon, Kolodner, Petrank.. (2003) (Correct)
No context found.
Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
Impact of JIT JVM Optimizations on Java Application Performance - Shiv Iyer Newburn (Correct)
No context found.
R.E. Jones and R. Lins "Garbage Collection: Algorithms for Automatic Dynamic Memory Management," Wiley, July 1996.
Rate Control for Threads in Streaming Applications - Hasnain Mandviwala Mandvi (2004) (Correct)
No context found.
R. Jones and R. Lins. Garbage Collection : Algorithms for Automatic Dynamic Memory Management. John Wiley, August 1996.
Ulterior Reference Counting: - Fast Garbage Collection (2003) (Correct)
No context found.
R. E. Jones and R. D. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996.
Oil and Water? High Performance Garbage Collection in.. - Blackburn, Cheng.. (2004) (Correct)
No context found.
R. E. Jones and R. D. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996.
A Generic Middleware for Intra-Language Transparent.. - Klintskog, Banna, Brand (2003) (1 citation) (Correct)
No context found.
Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
Heap Compression for Memory-Constrained Java Environments - Chen, Kandemir.. (2003) (Correct)
No context found.
R. Jones. Garbage Collection: algorithms for automatic dynamic memory management. John Wiley & Sons, Ltd, 1999.
A Survey of Adaptive Optimization in Virtual Machines - Arnold, Fink, Grove, Hind.. (2004) (Correct)
No context found.
R. Jones and R. Lins, Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Chichester, England: John Wiley and Sons, 1996.
Janos: A Java-oriented OS for Active Network Nodes - Patrick Tullmann Mike (2001) (4 citations) (Correct)
No context found.
R. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, 1996.
Integrating Generations with Advanced Reference Counting.. - Azatchi, Petrank (2003) (3 citations) (Correct)
No context found.
Richard E. Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996.
Mostly Concurrent Garbage Collection Revisited - Barabash, Ossia, Petrank (2003) (1 citation) (Correct)
No context found.
Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
An On-the-Fly Mark and Sweep Garbage Collector Based on.. - Hezi Azatchi Yossi (Correct)
No context found.
Richard E. Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996.
Efficient On-the-Fly Cycle Collection - Harel Paz David (Correct)
No context found.
Richard E. Jones and Rafael D. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996.
Tuning Garbage Collection in an Embedded Java Environment - Chen, Shetty, Kandemir, .. (2002) (3 citations) (Correct)
No context found.
R. Jones and R. D. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons. 1999.
Ulterior Reference Counting: - Fast Garbage Collection (2003) (Correct)
No context found.
R. E. Jones and R. D. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996.
Low-Level Run-Time Systems for Generic Code Generators - Reig (2002) (Correct)
No context found.
R. E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
Semantic and Logical Properties of Stateful Programming - Calcagno (2002) (2 citations) (Correct)
No context found.
R. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, 1997.
A Generic Middleware for Intra-Language Transparent.. - Klintskog, Banna, Brand (2003) (1 citation) (Correct)
No context found.
Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
An Efficient Parallel Heap Compaction Algorithm - Diab Abuaiadh Yoav (Correct)
No context found.
Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
Enhancing Branch Prediction via On-Line Statistical Analysis - Dropsho (Correct)
No context found.
Jones, Richard, and Lins, Raphael. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. No. ISBN 0-471-94148-4. John Wiley and Sons, Ltd., 1997.
A Replicated and Persistent Functional Programming Environment -.. - Oksanen (2001) (Correct)
No context found.
R. E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996.
Prioritised Dynamic Communicating Processes: Part I - BARNES, WELCH (2002) (Correct)
No context found.
Richard Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, New York, 1996.
First 50 documents Next 50
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