Re: Daily gclist MIME digest V5 #52

The algorithms proposed at the early days are in [1,2,3] and some of it 
is explained in the GC-book [6].  More advanced algorithms appear in 
[4,5].  You can easily find and download the latest work from the 
internet.

[1] LINS,R.D.Cyclic reference counting with lazy 
mark-scan.Inf.Process.Lett.44,4 (Dec.
1992),215–220.

[2] JONES,R.E.,AND LINS,R.D.Cyclic weighted reference counting without 
delay.In
PARLE’93 Parallel Architectures and Languages Europe (June 
1993),A.Bode,M.Reeve,
and G.Wolf,Eds.,vol.694 of Lecture Notes in Computer 
Science,Springer-Verlag,
pp.712–715.

[3] MART´INEZ,A.D.,WACHENCHAUZER,R.,AND LINS,R.D.Cyclic reference counting
with local mark-scan.Inf.Process.Lett.34,1 (1990),31–35.

[4] David F.Bacon and V.T.Rajan.Concurrent cycle collection in reference 
counted systems.In Jørgen Lindskov Knudsen,editor,
Proceedings of 15th European Conference on Object-Oriented 
Programming,ECOOP 2001,volume 2072 of Springer-Verlag,
Budapest,June 2001.Springer-Verlag.

[5] Harel Paz, Erez Petrank, David F. Bacon, V.T. Rajan, and Elliot K. 
Kolodner. An efficient on-the-fly cycle collection. In  Proceedings of 
the 14th International Conference on Compiler Construction, Edinburgh, 
April 2005. Springer-Verlag.


[6]  Richard E.Jones.Garbage Collection:Algorithms for Automatic Dynamic 
Memory Management.Wiley,Chichester,July
1996.With a chapter on Distributed Garbage Collection by R.Lins.

--Erez

----------------------------------------------------------------
Dr. Erez Petrank
Dept. of Computer Science
Technion - Israel Institute of Technology
Haifa 32000,  Israel

Email: [email protected]
homepage: http://www.cs.technion.ac.il/~erez/
Phone:  +972-4-829-4942.   Fax:  +972-4-829-3900
----------------------------------------------------------------



[email protected] wrote:
> Daily gclist MIME digest
> 
> This is Digest Volume 5 : Issue 52 : Digest Style "text"
> Below is a summary of all the messages, showing the subject of each post
> and who posted it, followed by the full text of all messages.  Re: Are there any studies or reports about the analysis
> 
> ----------------------------------------------------------------------
> 
> Date: Sat, 31 Dec 2005 03:20:22 +0100
> From: Jesus Cea <[email protected]>
> To: [email protected]
> Subject: Re: Are there any studies or reports about the analysis
> Message-ID: <[email protected]>
> 
> -----BEGIN PGP SIGNED MESSAGE-----
> Hash: SHA1
> 
> A six month old message... :-)
> 
> Chin-Yang Lin wrote:
> 
>>I am studying the traditional gc algorithm - reference counting(RC). A major weakness for RC is the inability to reclaim cyclic garbage. Many studies proposed their cyclic reference counting algorithms to deal with this problem in different efficient manners. 
> 
> 
> I was wondering if somebody could provide some (online, please :)
> references about collecting cyclic structures in a Reference Counting
> framework.
> 
> I'm working in an object database backend. I'm currently doing GC using
> reference counting, and I'm leaking objects in cyclic structures. This
> is a rare situation, but the uncollectable garbage grows with time.
> 
> I would like to be able to collect that garbage without examining a
> multimillion object database :-), object by object (let's say,
> mark&sweep is not an option)
> 
> I could change GC algoritm easily, in my project. So, I'm not committed
> to Reference Counting. But I need an algoritmo which doesn't need to
> revise all objects in database, even in a "generational" way. My
> advantage is that my mutator and the GC system can fully cooperate,
> 100%. That situation should be very helpful.
> 
> Thanks for your time and attention.
> 
> PS: Happy new year 2006
> 
> - --
> Jesus Cea Avion                         _/_/      _/_/_/        _/_/_/
> [email protected] http://www.argo.es/~jcea/ _/_/    _/_/  _/_/    _/_/  _/_/
>                                       _/_/    _/_/          _/_/_/_/_/
> PGP Key Available at KeyServ   _/_/  _/_/    _/_/          _/_/  _/_/
> "Things are not so easy"      _/_/  _/_/    _/_/  _/_/    _/_/  _/_/
> "My name is Dump, Core Dump"   _/_/_/        _/_/_/      _/_/  _/_/
> "El amor es poner tu felicidad en la felicidad de otro" - Leibniz
> -----BEGIN PGP SIGNATURE-----
> Version: GnuPG v1.4.2 (GNU/Linux)
> Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org
> 
> iQCVAwUBQ7Xq5plgi5GaxT1NAQIIOAP7B/d9lL7HZNlBwwTLPxDCe9pH1yrr1GQP
> Y81iPyXy2Q9t+GSB4pUEPxyU1C6gupHmBUN0nfWlHuw0l2xsk1E0uBoT3c4BPABy
> uJEiFy3cQFMzRk1ViXK+ldaiDbDYZEFRp2hR0o2F84FKQe7voNXtn1+uyTKzvx1u
> i2xcgyf8sV8=
> =Ay/z
> -----END PGP SIGNATURE-----
> 
> ------------------------------
> 
> End of [gclist] Daily gclist MIME digest V5 #52
> **********

-- 

----------------------------------------------------------------
Dr. Erez Petrank
Dept. of Computer Science
Technion - Israel Institute of Technology
Haifa 32000,  Israel

Email: [email protected]
homepage: http://www.cs.technion.ac.il/~erez/
Phone:  +972-4-829-4942.   Fax:  +972-4-829-3900
----------------------------------------------------------------