From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from majordomo@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id PAA03603; Mon, 29 Jul 2002 15:59:44 +0200 (MET DST) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id PAA03623 for ; Mon, 29 Jul 2002 15:59:43 +0200 (MET DST) Received: from beaune.inria.fr (beaune.inria.fr [128.93.8.3]) by nez-perce.inria.fr (8.11.1/8.11.1) with ESMTP id g6TDxg510859 for ; Mon, 29 Jul 2002 15:59:42 +0200 (MET DST) Received: by beaune.inria.fr (8.8.8/1.1.22.3/14Sep99-0328PM) id PAA0000032271; Mon, 29 Jul 2002 15:59:42 +0200 (MET DST) Date: Mon, 29 Jul 2002 15:59:42 +0200 (MET DST) From: Damien Doligez Message-Id: <200207291359.PAA0000032271@beaune.inria.fr> To: caml-list@inria.fr, farago@eecs.harvard.edu Subject: Re: [Caml-list] compact.c Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk >From: Julie Farago > >Is there a paper on the compaction code (compact.c) of the garbage >collector (in byterun/)? Even though the documentation in this file is >really exceptional, I am a little confused by how the inversion of >pointers is used to compact the heap. Is there an algorithm I should >lookup? There is no paper on compact.c itself, but the algorithm is not original. If I remember correctly, it is from this paper: F. Lockwood Morris, A time- and space-efficient garbage compaction algorithm, Communications of the ACM, v.21 n.8, p.662-665, Aug. 1978 The only tricky part is the double inversion of pointers to infix headers. If you really need it, I'll write up a short description and put it on my web page. -- Damien ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners