From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: * X-Spam-Status: No, score=1.9 required=5.0 tests=BAYES_50,INVALID_DATE, MSGID_SHORT autolearn=no autolearn_force=no version=3.4.4 Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site utah-cs.UUCP Path: utzoo!linus!decvax!harpo!utah-cs!e-smith From: e-smith@utah-cs.UUCP (Eric Smith) Newsgroups: net.lang,net.lang.ada Subject: Re: garbage collection Message-ID: <2916@utah-cs.UUCP> Date: Tue, 17-Jul-84 06:34:44 EDT Article-I.D.: utah-cs.2916 Posted: Tue Jul 17 06:34:44 1984 Date-Received: Thu, 19-Jul-84 15:09:32 EDT References: <1979@mit-eddi.UUCP> <2144@mit-eddie.UUCP> <2620@ncsu.UUCP> <2226@mit-eddie.UUCP>, <7617@umcp-cs.UUCP> Organization: Univ of Utah CS Dept List-Id: 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