From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on ip-172-31-74-118.ec2.internal X-Spam-Level: X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.5-pre1 Date: 21 Apr 92 21:09:54 GMT From: titan.ksc.nasa.gov!mcroberts@ames.arc.nasa.gov Subject: Garbage collection? Message-ID: <1992Apr21.160955.2523@titan.ksc.nasa.gov> List-Id: I've been looking at two different Ada textbooks which have very different ideas about garbage collection. The older book says that a good Ada compiler should take care of it for you and you should avoid unchecked_deallocation. The newer one says that you need to manage storage yourself using unchecked_deallocation. I'm curious as to the state of the art in automated garbage collection. I'm used to using Common Lisp on Symbolics or Unix platforms, and they use a combination of temporal, incremental and full GCs. I'm also familiar with languages such as C++ where you have to manage garbage collection yourself, but you can implement reference counts and other sorts of schemes to simplify it. Is this something one needs to worry about when using solid production quality Ada compilers, and is there any negative performance impact if you don't clean up your own garbage. In Lisp it is usually better to let the system do it since it is highly optimized and done mostly during page faults.