Talk:Garbage collection (computer science)

From Wikipedia, the free encyclopedia
Jump to: navigation, search
edit·history·watch·refresh Stock post message.svg To-do list for Garbage collection (computer science):

Here are some tasks awaiting attention:

syntactical vs. semantical garbage[edit]

In Reachability of an object both terms (syntactical and semantical garbage) are used, which might be confusing the reader. If both mean the same, the alternative term could be introduced.

Patents. Eg. non-patented ((hard) real-time) GC algorithms[edit]

Are all real-time algorithms patented? I was very interested in seeing Staccado (see my recent edits). It seems to fulfill all important criteria for hard real-time GC algorithm. I found a patent that migh ally to Staccado (didn't read to carefully). It doesn't mention that name in title or in text. It however mentions Metronome a lot that it is based on. I assume Metronome is patented but do not know for sure: [[1]]. Azul uses a patented [2] algorithm, but they sell hardware. Should we say that algorithms are patented? It seems they (real-time) all might be? Let's say they all are and they expire in 20 years then anyone know if a soft or even hard real-time GC algorithm older than that is available (that could be used eg. for Java, or C/C++)? Seems patent-less hard real-time Java (or even soft) is not available for the next 15 years or so. While for C/C++ it is as GC is not needed. comp.arch (talk) 14:48, 13 March 2014 (UTC)

Hm, what about this? — Dsimic (talk | contribs) 19:20, 15 March 2014 (UTC)
Great, thanks. It doesn't say anything about patents or the date. I assume it's over 20 years old (references are old and it's about LISP) even though the html file is newer. Then the patents would be expired in the states (and everywhere?). I haven't looked into the algorithms enough in the article here, but they mentioned arraylets (and compiler support). I haven't thought it through, it seems arrays might be a problem. When I learned (about) LISP I didn't learn about arrays in it. As it is functional and based on linked lists maybe it helps if no arrays are used for real time. Doesn't (modern) LISP however also support arrays? And while the article you pointed to says real time, should we assume hard real-time? [Even if the GC is real-time and the rest of Java/programming language, would VM not screw that up possibly (be disabled?).] The new algorithms must have something better or they would not be thought up. Staccado is also concurrent, while Metronome is not but still an improvement I assume on what you pointed to. comp.arch (talk)

I agree that this article should mention real-time garbage collection algorithms. So I started a rough draft of a garbage collection (computer science)#Real-time section. --DavidCary (talk) 03:23, 6 December 2015 (UTC)


This article has a garbage collection (computer science)#Real-time section. I see that another article has a section on real-time garbage collection ( tracing garbage collection#Real-time garbage collection ). Would it be better to create a stand-alone "real-time garbage collection" article to discuss such algorithms, and convert both of those sections to short WP:SUMMARY of that article? --DavidCary (talk) 17:38, 8 December 2015 (UTC)

Move vailable location[edit]

Can you add "The grabage collector move the memory locations of variables, so it causes limitations using pointers, which cause inconvenience for programming." into the Disadventage section? -- (talk) 02:01, 24 May 2016 (UTC)