e-smith@utah-cs.UUCP (Eric Smith) (07/17/84)
Who says you can't have your cake and eat it too? Intel's 432, while it does have other problems, seems to do a d*** good job of heap based allocation *and* PARALLEL garbage collection using Dijkstra's algorithm (On-the-Fly Garbage Collection: An Exercise in Cooperation, Communications of the ACM 20: 966-975, November 1978). There is even some talk of a garbage collection processor... (right now it's done by the iMAX system process GCOL). Eric L. Smith ...!harpo!utah-cs!e-smith B324 Van Cott Hall University of Utah Salt Lake City, UT 84112 (801) 584-4276
WOLF@UMASS-CS.CSNET ("Alexander L. Wolf") (03/17/86)
I heard a rumor recently that none of the currently existing, production quality (now we're *really* cutting the field down) Ada compilers does garbage collection. We are developing an Ada program that does a lot of string manipulation and have found that the program requires a surprisingly large amount of memory in which to run. We are using DEC's compiler, which in almost every (other) respect has proven outstanding. I'd appreciate any insights... Alex.