J. Seward. Generational Garbage Collection for Lazy Graph Reduction. In International Workshop on Memory Management, pages 200--17, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....behaviour within a cell, written by Pat Fasel (Los Alamos) Our benchmark run consists of only 4 iteration steps so we expect some long time scale activity. primes is a 13 line toy program which prints the first 1000 prime numbers computed using the sieve of Eratosthenes. It is included because Seward [1992] found that its behaviour was particularly inimical to generational collectors. Some general statistics for these programs are shown in Figure 1. The Exec size is the size of the (stripped) executable binary. The Redn time (reduction time) is the execution time spent doing useful graph ....

....examine the operation of our collector for different allocation sizes in Section 5.4. Deciding when a major collection is performed is also critical to the performance. We want to minimise major collections because they are expensive, both in execution 7 Seward s generational collection scheme (Seward [1992]) is very similar to ours as it is also based on our earlier work. 8 An alternative approach is to use the in place compacting collector to perform the minor collections as well. This would enable all the free heap space to be allocated between minor collections. However, as we expect a small ....

[Article contains additional citation context not shown here]

J Seward [Sept 1992], "Generational garbage collection for lazy graph reduction," in International Workshop on Memory Management, Springer-Verlag, Lecture Notes in Computer Science.

....they update suspended computations (or thunks) with their values, so it looks as if they might interact badly with generational collectors. Perhaps as a result, garbage collectors for lazy functional languages have tended to be a variant of the classic Baker two space collector. Indeed, apart from Seward [1992] there is esentially no literature on generational garbage collection for lazy languages. We have begun investigation of a variety of garbagecollection technology for lazy languages, including generational schemes. Some of our findings are surprising (to us at least) and we summarise them briefly ....

J Seward [March 1992], "Generational garbage collection for lazy graph reduction," Department of Computer Science, University of Manchester.

....behaviour within a cell, written by Pat Fasel (Los Alamos) Our benchmark run consists of only 4 iteration steps so we expect some long time scale activity. primes is a 13 line toy program which prints the first 1000 prime numbers computed using the sieve of Eratosthenes. It is included because Seward [1992] found that its behaviour was particularly inimical to generational collectors. Some general statistics for these programs are shown in Figure 1. The Exec size is the size of the (stripped) executable binary. The Redn time (reduction time) is the 0 5 10 15 20 25 1 10 100 1000 10000 Closures ....

....performed Following a minor collection, the scheme depicted in Figure 6 splits the available free space in half, using the top half as an allocation area. This strategy ensures the maximum time interval between minor collections 8 , thereby providing 7 Seward s generational collection scheme (Seward [1992]) is very similar to ours as it is also based on our earlier work. 8 An alternative approach is to use the in place compacting collector to perform the minor collections as well. This would enable all the free heap space to be allocated between minor collections. However, as we expect a small ....

[Article contains additional citation context not shown here]

J Seward [Sept 1992], "Generational garbage collection for lazy graph reduction," in International Workshop on Memory Management, Springer-Verlag, Lecture Notes in Computer Science.

No context found.

J. Seward. Generational Garbage Collection for Lazy Graph Reduction. In International Workshop on Memory Management, pages 200--17, 1992.

No context found.

Julian Seward. Generational garbage collection for lazy graph reduction. In Bekkers and Cohen [Bekkers and Cohen1992].

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