P. Sansom. Combining copying and compacting garbage collection. In R. Heldal, C.K. Holst, and P. Wadler, editors, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....optimization vs fast gc low optimization . It is pertinent to ask the question: How does the performance of mark scan deallocation optimization compare with copying (with no optimization) Note: The referees suggested that, since there exist mark scan gcs without free lists (e.g. [4]) and also copying gcs with free lists, the question could be more generally phrased as : How does the performance of a gc with free list deallocation optimization compare with a gc without free list (with no optimization) This paper then addresses the question in one particular ....

P. Sansom. Combining copying and compacting garbage collection. In R. Heldal, C.K. Holst, and P. Wadler, editors, 1991.

....level. So, for tabled programs we can at most compare our collectors with each other and only for plain Prolog execution with collectors from other systems. An extensive comparison of a sliding and a copying collector in the context of a functional programming language can be found for example in [San91] and the results carry over to Prolog. From an implementation point of view, two points are worth noting: accurate marking is the difficult part of both collectors and the copying phase is much easier to implement and maintain than the sliding phase. On the other hand, a copying collector may be ....

Patrick M. Sansom. Combining copying and compacting garbage collection or Dual-mode garbage collection. In Rogardt Heldal, Carsten Kehler Holst, and Philip Wadler, editors, Functional Programming, Workshops in Computing. Springer-Verlag, August 1991.

....engine level. So, in tabled programs we can at most compare our collectors with each other and only for plain Prolog execution with collectors from other systems. An extensive comparison of a sliding and a copying collector in the context of a functional programming language can be found e.g. in [16] and its results carry over to Prolog; see also [3] Two points are worth noting: accurate marking is the dicult part of both collectors and the copying phase is much easier to implement and maintain than the sliding phase. On the other hand, a copying collector may be more dicult to debug due to ....

P.M. Sansom. Combining copying and compacting garbage collection or Dual-mode garbage collection. In Functional Programming, Glasgow, Aug. 1991. Springer.

....let expressions. These nodes might be updated with an AP or VAP node. 3 iSimplej Generational garbage collector without update test This section describes an Appel style garbage collector [App89] but uses dioeerent garbage collectors for major and minor collection as suggested by Sansom [San91]. The distinguished feature of Appel s generational collector is that all nodes that survives one garbage collection are tenured (a simple generational collector ) Tenuring all nodes at minor collections empties the exception table. The exception table is however still needed as the garbage ....

Patrick M. Sansom. Combining copying and compacting garbage collection. In Functional Programming, Glasgow. Springer-Verlag, 1991.

.... Garbage Collection Glasgow Haskell supports four different garbage collectors: ffl a 2 space copying collector [6] ffl a 1 space compacting collector [11] ffl a dual mode collector which operates either as a two space collector or a compacting collector depending on the amount of live data [20]; and ffl a generational collector [1, 21] This collector maintains just two generations: the new generation is collected using a two space collector; and the old generation is collected using a one space collector. To allow separate collection of the generations, a list of pointers from the old ....

PM Sansom, Combining copying and compacting garbage collection, in Proc. Glasgow Workshop on Functional Programming, Workshops in Computing Series, Springer-Verlag, Aug 1991.

....level. So, in tabled programs we can at most compare our collectors with each other and only for plain Prolog execution with collectors from other systems. An extensive comparison of a sliding and a copying collector in the context of a functional programming language can be found for example in [17] and its results carry over to Prolog; see also [3] One point is perhaps worth noting: accurate marking is the difficult part of both collectors and the copying phase is much easier to implement and maintain than the sliding phase. On the other hand, a copying collector may be more difficult to ....

....high fragmentation. The figures would show an even higher fragmentation, if XSB would trim its environments. Also, one must take into account that better determinism detection leads to more garbage; thus, to a higher fragmentation. As an artificial example, consider the execution of a(3,[17,18,19,20],Out) against the following program: a(N,L,Out) N 0, L = X R] M is N 1, a(M,R,Out) a(N,L,Out) N = 0, Out = L, gcheap. At the moment of calling the garbage collector, the cells containing the numbers 17,18,19 would be considered unreachable if a 3 was recognized as deterministic, ....

P. M. Sansom. Combining copying and compacting garbage collection or Dual-mode garbage collection. In R. Heldal, C. K. Holst, and P. Wadler, editors, Functional Programming, Workshops in Computing, Glasgow, Aug. 1991. Springer-Verlag.

....evaluations. In the former case they might be updated with an AP or VAP node. 3 Simple generational garbage collector without update test This section describes an Appel style garbage collector [App89] but uses dioeerent garbage collectors for major and minor collection as suggested by Sansom [San91]. The distinguished feature of Appel s generational collector is that all nodes that survive one garbage collection are tenured (this is called a simple generational collector in this paper) Tenuring all nodes at minor collections empties the exception table. The exception table is however still ....

Patrick M. Sansom. Combining copying and compacting garbage collection. In Functional Programming, Glasgow. Springer-Verlag, 1991.

....half the real memory available, at which point the virtual memory system begins to thrash. We have implemented a dual mode collector, which switches dynamically between a single space compacting collector and a two space collector to try to minimise paging, with encouraging early results (Sansom [1991]) We are developing a further extension to a generational collector, based on Appel s simple two generation scheme (Appel [1989] 7.5 Trading code size for speed The info table dispatch mechanism outlined above allows some interesting space time tradeoffs to be made. So far we have assumed that ....

P Sansom [Aug 1991], "Combining copying and compacting garbage collection," in Proc Fourth Annual Glasgow Workshop on Functional Programming , Springer Verlag Workshops in Computer Science.

No context found.

PM Sansom [Aug 1991], "Combining copying and compacting garbage collection," in Functional Programming, Glasgow 1991, R Heldal, CK Holst & P Wadler, eds., Springer-Verlag, Workshops in Computing, Portree, Scotland.

No context found.

PM Sansom [Aug 1991], "Combining copying and compacting garbage collection," in Functional Programming, Glasgow 1991, R Heldal, CK Holst & P Wadler, eds., Springer-Verlag, Workshops in Computing, Portree, Scotland.

No context found.

Patrick M. Sansom. Combining copying and compacting garbage collection. In Peyton Jones et al. [Peyton Jones et al.1992].

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