for "garbage" and "collection" and "1994"
Search term: garbage;collection;1994
No spelling errors allowed, case-insensitive, partial words match.
Information on how to form queries.
@InProceedings{total94,
author = "Mads Tofte and Jean-Pierre Talpin",
semno = "D-183",
title = "Implementation of the Typed Call-by-value
lambda-calculus using a Stack of Regions",
booktitle = "Proceedings from the 21st annual ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Languages",
year = "1994",
note = "(Accepted for publication)",
summary = "We present a translation scheme for the
polymorphically typed call-by-value $\lambda$-calculus.
All runtime values, including function closures, are
put into {\sl regions}. The store consists of a stack
of regions. Region inference and effect inference are
used to infer where regions can be allocated and
deallocated. Recursive functions are handled using a
limited form of polymorphic recursion. The translation
is proved correct with respect to a store semantics,
which models a region-based run-time system.
Experimental results suggest that regions tend to be
small, that region allocation is frequent and that
overall memory demands are usually modest, even without
garbage collection.",
}
@InBook{Griffiths:cc:1974b,
author = "M. Griffiths",
title = "Run-time storage management",
crossref = "cc:1974",
pages = "195--221",
checked = "19940222",
source = "dept. library",
sjb = "Covers static and dynamic allocation, linking
procedure frames, displays, how to deal with arrays,
structures, lists, garbage collection.",
}
@InBook{Hill:cc:1974b,
author = "U. Hill",
title = "Special Run-time Organization Techniques for Algol
68",
crossref = "cc:1974",
pages = "222--252",
checked = "19940222",
source = "dept. library",
sjb = "Covers issues such as variable length arrays and
garbage collection.",
}
@InProceedings{Hudak:Keller:acm:lfp:1982,
author = "Paul Hudak and Robert M. Keller",
title = "Garbage Collection and Task Deletion in Distributed
Applicative Processing",
crossref = "acm:lfp:1982",
pages = "168--178",
checked = "19940213",
source = "dept. library",
keywords = "distributed garbage collection",
abstract = "The problem of automatic storage reclamation for
distributed implementations of applicative languages is
explored. Highly parallel distributed systems have
several unique characteristics that complicate the
reclamation process; in this setting, the deficiencies
of existing storage reclamation schemes are thus noted.
A real-time, effectively distributed, garbage collector
of the mark-sweep variety, called a {\em marking-tree
collector}, is shown to accomplish reclamation in
parallel with the main computation, with no centralized
data or control other than a logical rendezvous between
phases of the collector. In addition, it is capable of
finding and subsequently deleting active processes
which are determined to be no longer relevant to the
computation.",
reffrom = Eckart:LeBlanc:iait:1987,
reffrom = Osborne:acm:lfp:1990,
}
@Article{Dewar:Sharir:Weixelbaum:acm:toplas:1982,
author = "Robert B. K. Dewar and Micha Sharir and Elia
Weixelbaum",
title = "Transformational Derivation of a Garbage Collection
Algorithm",
journal = "ACM Transactions on Programming Languages and
Systems",
volume = "4",
number = "4",
pages = "650--667",
month = oct,
year = "1982",
checked = "19940302",
source = "Dept. Library",
keywords = "automatic programming, very high level languages,
program transformation, algorithms, design, languages,
transformational programming, wide-spectrum languages,
garbage collection, loop fusion, formal
differentiation, strength reduction.",
abstract = "Transformational programming is a relatively new
programming technique intended to derive complex
algorithms automatically. Initially, a set of
transformational rules is described, and an initial
specification of the problem to be programmed is given.
The specification is written in a high-level language
in a fairly compact form possibly ignoring efficiency.
A number of versions, called transformations, are
created by successively applying the transformational
rules starting with the initial specification. As an
example of the application of this technique to a
fairly complex case, a transformational derivation of a
variant of known efficient garbage collection and
compaction algorithm from an initial very high-level
specification is given. Currently, the techniques are
still being developed, and therefore the
transformations are derived manually. However, most of
the transformations done are of a technical nature and
could eventually be automated.",
}
@Article{Kurokawa:spe:1981,
author = "Toshiaki Kurokawa",
title = "A New Fast and Safe Marking Algorithm",
journal = "Software -- Practice and Experience",
volume = "11",
number = "6",
pages = "671--682",
month = jul,
year = "1981",
refs = "9",
checked = "19940428",
keywords = "marking algorithm, garbage collection, LISP stacked
node checking method",
abstract = "A new marking algorithm for garbage collection is
presented. Although the method is a variation of the
usual simple stacking algorithm, in practice this
algorithm has quite improved both in stack space and
processing time. One significant modification is to
stack a node only when both the sublists are unmarked.
The other innovation is a ``stacked-node-checking''
method invoked after each stack-overflow. With this
method, a number of unnecessary nodes are eliminated,
the stack is compacted, and the marking process can
resume using the generated space in the stack. This
algorithm has been used for LISP1.9 garbage collection
for years, and succeeded in showing good figures.",
}
@InProceedings{Faustini:Wadge:iait:1987,
author = "A. a. Faustini and W. W. Wadge",
title = "An Educative Interpreter for Lucid",
crossref = "iait:1987",
pages = "86--91",
refs = "9",
checked = "19940516",
keywords = "Lucid, garbage collection, interpreter,
implementation, POP2",
abstract = "We describe an interpreter for pLucid, a member of the
Lucid family of functional dataflow languages. In
appearance, pLucid is similar to Landin's Iswim, except
that individual variables and expressions denote {\em
streams} (infinite sequences of data items), and
function variables denote {\em filters}
(stream-to-stream transformations). The actual data
objects in pLucid (the components of a streams) are
those of POP2: numbers, strings, words, and lists. The
``inner syntax'' (infix operations, conventions for
denoting constants) are those of POP2 as well. \par The
interpreter (which was written in C) is {\em
educative}: it uses a tagged demand-driven scheme.
Demands for values in the output stream generate
demands for values of other variables internal to the
program. These demands, and the values returned in
response, are tagged according to the ``time''
(sequence index) and place (node in the tree of
function calls). Once computed, values are stored in an
associative memory (the ``warehouse'') in case they are
demanded again later in the computation. The warehouse
is periodically cleaned out using a heuristic called
the ``retirement plan''. The heuristic is not perfect,
but does not have to be: in an educative computation,
the program is not altered as in reduction. If
discarded values are needed again, they can be
recomputed. \par The pLucid interpreter performs
extensive runtime checks and error messages quote the
source line containing the offended operator. A special
end-of-data object permits a very simple treatment of
finite (terminating) input and output. Of special
interest is its interface to UNIX, which allows any
system command to be used as a filter {\em inside} a
pLucid program. \par The interpreter performs well
enough for nontrivial programs to be developed and
tested. These include (simple versions of) a text
formatter, a distributed airline reservation system,
and a full screen editor.",
}
@InProceedings{Wakeling:Runciman:fplca:1991,
author = "David Wakeling and Colin Runciman",
email = "{dw,colin}@minster.york.ac.uk",
title = "Linearity and Laziness",
crossref = "fplca:1991",
pages = "215--240",
refs = "28",
checked = "19940811",
source = "Main library",
abstract = "A criticism often levelled at functional languages is
that they do not cope elegantly or efficiently with
problems involving changes of state. In a recent
paper~\cite{Wadler:pcam:1990}, Wadler has proposed a
new approach to these problems. His proposal involves
the sue of a type system based on the linear logic of
Girard~\cite{Girard:tcs:1987}. This allows the
programmer to specify the ``natural'' imperative
operations without at the same time sacrificing the
crucial property of referential transparency. \par In
this paper we investigate the practicality of Wadler's
approach, describing the design and implementation of a
variant of Lazy ML. A small example program shows how
imperative operations can be used in a referentially
transparent way, and at the same time it highlights
some of the problems with the approach. Our
implementation is based on a variant of the
G-Machine~\cite{Johnsson:phd:1987,Augustsson:phd:1987}.
We give some benchmark figures to compare the
performance of our machine with the original one. the
results are disappointing: the cost of maintaining
linearity in terms of lost optimisations at
compile-time, and the extra data structures that must
be created at run-time more than cancels out the gains
made by using linear types to reduce the amount of
garbage collection. We also consider how the language
and the implementation can be extended to accommodate
aggregates such as arrays. here the results are more
promising: linear arrays are usually more efficient
than trailered ones, but they are less efficient than
destructively-updated ones. We conclude that larger
aggregates are the most promising area of application
for Wadler's type system.",
}
@InProceedings{Chiueh:fplca:1991,
author = "Tzi-cker Chiueh",
title = "An Architectural Technique for Cache-level Garbage
Collection",
crossref = "fplca:1991",
pages = "520--537",
checked = "19940809",
source = "Main library",
abstract = "Cache performance is critical in high-speed computing
systems. However, heap intensive programs such as LISP
codes typically have low cache performance because of
inherently poor data locality. To improve the cache
performance, the system should reuse heap cells while
they are in cache, thus reducing the number of cache
misses due to heap references. Furthermore, the system
can adopt multithreaded architecture to hide the cache
miss overhead by switching to different control threads
when a cache miss occurs. In this paper, a novel
architectural scheme called {\em cache-level garbage
collection} based on multi-threading is developed to
improve the cache performance for heap-intensive
programs. Consequently both the cache hit ratio is
improved and the cache miss overhead is masked, thereby
minimizing the total cache miss penalty. We present the
garbage collection algorithm and its architectural
support features, together with initial performance
evaluation.",
}
@InProceedings{AttardiGiu1994a,
author = "Giuseppe Attardi and Tito Flagella",
booktitle = "ProceedProceedings of the 1994 Usenix C++ Conference",
title = "{A} customisable memory management framework",
year = "1994",
abstract-url = "file://ftp.di.unipi.it/pub/Papers/attardi/usenix94.abstract",
url = "file://ftp.di.unipi.it/pub/Papers/attardi/usenix94.ps.gz",
keywords = "conservative garbage collection, memory management,
C++",
month = apr,
pages = "123--142",
publisher = "Usenix Association",
scope = "gc",
}
@Unpublished{WilsonPaul1994a,
title = "{U}niprocessor {G}arbage {C}ollection {T}echniques
({L}ong {V}ersion)",
author = "Paul R. Wilson",
url = "ftp://cs.utexas.edu/pub/garbage/bigsurv.ps",
keywords = "Garbage Collection",
note = "Submitted to ACM Computing Surveys",
year = "1994",
scope = "gc",
}
@InProceedings{KamadaTomi1994a,
author = "Tomio Kamada and Satoshi Matsuoka and Akinori
Yonezawa",
booktitle = "Supercomputing `94",
title = "{E}fficient {P}arallel {G}lobal {G}arbage {C}ollection
on {M}assively {P}arallel {C}omputers",
year = "1994",
abstract-url = "http://www.computer.org/p3/kamada.html",
url = "http://www.computer.org/p3/kamadat.ps",
keywords = "Garbage Collection, Distributed Garbage Collection,
Memory Management",
publisher = "IEEE Computer Society",
scope = "gc",
}
@InProceedings{DoligezDam1994a,
author = "Damien Doligez and Georges Gonthier",
booktitle = "POPL",
title = "{P}ortable, {U}nobtrusive {G}arbage {C}ollection for
{M}ultiprocessor {S}ystems",
year = "1994",
url = "ftp://ftp.inria.fr/INRIA/Projects/para/doligez/DoligezGonthier94.ps.gz",
keywords = "Garbage Collection; Parallelism; Concurrency; Proof of
Programs",
month = jan,
pages = "70--83",
publisher = "ACM Press",
scope = "gc",
}
@InProceedings{Eckart:1987:DGC,
author = "J. D. Eckart and R. J. LeBlanc",
title = "Distributed garbage collection",
crossref = "Wexelblat:1987:IIT",
pages = "264--273",
year = "1987",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Sat Aug 13 17:16:20 MDT 1994",
keywords = "languages; algorithms; design",
series = "Published as ACM SIGPLAN Notices",
subject = "D.4.2 Software, OPERATING SYSTEMS, Storage Management
\\ D.3.2 Software, PROGRAMMING LANGUAGES, Language
Classifications",
}
@InProceedings{Lang:1987:IIC,
author = "B. Lang and F. Dupont",
title = "Incremental incrementally compacting garbage
collection",
crossref = "Wexelblat:1987:IIT",
pages = "253--263",
year = "1987",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Sat Aug 13 17:16:20 MDT 1994",
keywords = "languages; algorithms; theory; design",
series = "Published as ACM SIGPLAN Notices",
subject = "D.4.2 Software, OPERATING SYSTEMS, Storage Management
\\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Modes of Computation, Parallelism",
}
@Article{Schelvis:1989:IDT,
author = "M. Schelvis",
title = "Incremental distribution of timestamp packets: a new
approach to distributed garbage collection",
journal = "ACM SIGPLAN Notices",
volume = "24",
number = "10",
pages = "37--48",
month = oct,
year = "1989",
ISSN = "0362-1340",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Sat Aug 13 17:16:20 MDT 1994",
keywords = "algorithms; design; languages",
subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors \\
D.1.0 Software, PROGRAMMING TECHNIQUES, General \\
D.4.2 Software, OPERATING SYSTEMS, Storage Management,
Allocation/deallocation strategies \\ D.4.7 Software,
OPERATING SYSTEMS, Organization and Design, Distributed
systems \\ G.2.2 Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Graph algorithms",
}
@Article{Wilson:1989:CSC,
author = "P. R. Wilson and T. G. Moher",
title = "A ``card-marking'' scheme for controlling
intergenerational references in generation-based
garbage collection on stock hardware",
journal = "ACM SIGPLAN Notices",
volume = "24",
number = "5",
pages = "87--92",
month = may,
year = "1989",
ISSN = "0362-1340",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Sat Aug 13 17:16:20 MDT 1994",
keywords = "languages",
subject = "D.4.2 Software, OPERATING SYSTEMS, Storage Management
\\ D.2.m Software, SOFTWARE ENGINEERING, Miscellaneous
\\ D.3.2 Software, PROGRAMMING LANGUAGES, Language
Classifications \\ D.3.3 Software, PROGRAMMING
LANGUAGES, Language Constructs",
}
@Article{Wilson:1989:SBA,
author = "P. R. Wilson",
title = "A simple bucket-brigade advancement mechanism for
generation-bases garbage collection",
journal = "ACM SIGPLAN Notices",
volume = "24",
number = "5",
pages = "38--46",
month = may,
year = "1989",
ISSN = "0362-1340",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Sat Aug 13 17:16:20 MDT 1994",
keywords = "design",
subject = "D.4.2 Software, OPERATING SYSTEMS, Storage
Management",
}
@Article{Baker:1993:LQ,
author = "Henry G. {Baker, Jr.}",
title = "A ``Linear Logic'' Quicksort",
journal = "ACM SIGPLAN Notices",
volume = "??",
number = "??",
pages = "??--??",
month = oct,
year = "1993",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
bibdate = "Sun Sep 18 20:00:03 1994",
}
@Article{Sankaran:1994:BGC,
author = "Nandakumar Sankaran",
title = "A Bibliography on Garbage Collection and Related
Topics",
journal = "ACM SIGPLAN Notices",
year = "1994",
volume = "29",
number = "9",
pages = "149--158",
month = sep,
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Fri Sep 09 21:28:03 1994",
}
@Article{Baker:1993:SLR,
author = "Henry G. {Baker, Jr.}",
title = "Safe and Leakproof Resource Management Using Ada83
Limited Types",
journal = "ACM SIGADA Ada Letters",
volume = "13",
number = "5",
pages = "32--42",
month = sep,
year = "1993",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
bibdate = "Sat Sep 17 20:46:11 1994",
}
@Article{Nilsen:COMPSYS-7-4-467,
author = "Kevin Nilsen",
title = "Reliable Real-Time Garbage Collection of {C++}",
journal = "Computing Systems",
year = "1994",
volume = "7",
number = "4",
pages = "467--504",
acknowledgement = ack-nhfb,
bibdate = "Sat Nov 19 09:57:31 1994",
}
@Book{Denert:1977:D,
author = "Ernst Denert and Reinhold Franxk",
title = "Datenstrukturen",
publisher = "Bibliographisches Institut",
address = "Mannheim",
pages = "362",
year = "1977",
ISBN = "3-411-01524-1",
LCCN = "QA76.9.D35 D46",
bibdate = "Wed Jul 13 18:55:17 1994",
descriptor = "B-baum, Balancierter Baum, Baum, Best-fit,
Buddy-methode, Duenn Besetzte Matrix, Feld, First-fit,
Garbage Collection, Halde, Hashing, Keller, Lineare
Liste, Lisp, Matrix, Q-baum, Schlange, Stapel, Zeiger",
}
@InProceedings{Borgwardt:1984:PPU,
author = "P. Borgwardt",
title = "Parallel Prolog Using Stack Segments on Shared-memory
Multiprocessors",
crossref = "IEEE:1984:ISL",
pages = "??",
year = "1984",
note = "CH2007-3/84/0002\$01.00.",
abstract = "A method of parallel evaluation for standard PROLOG
for shared-memory multiprocessors is presented that is
a natural extension of the current methods of compiling
PROLOG for sequential execution. In particular, the
method exploits stack-based evaluation with stack
segments spread across several processors to reduce the
amount of runtime storage needed and hence to reduce
the occurrence of garbage collection in the distributed
computation. And parallelism and stream parallelism are
the most important sources of concurrent execution in
this method; these are implemented using local process
lists; idle processors may scan these and execute any
process which is ready to execute. Or parallelism is
less important, but the method does not implement it
with hash table windows into a binary tree of or
contexts when it is requested in the source program.",
bibdate = "Thu Jul 21 09:37:44 1994",
keywords = "Program Compilers; High Level Languages; Parallel
Processing; Programming; Software Engineering",
}
@Article{Appel:1987:GCC,
author = "Andrew W. Appel",
title = "Garbage collection can be faster than stack
allocation",
journal = "Information Processing Letters",
volume = "25",
number = "4",
pages = "275--279",
month = jun,
year = "1987",
ISSN = "0020-0190",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Mon Aug 15 13:51:01 MDT 1994",
keywords = "theory",
subject = "D.4.2 Software, OPERATING SYSTEMS, Storage Management,
Allocation/deallocation strategies \\ D.4.2 Software,
OPERATING SYSTEMS, Storage Management, Main memory",
}
@Article{VandeSnepscheut:1987:AOG,
author = "Jan Van de Snepscheut and L. A.",
title = "``Algorithms for on-the-fly garbage collection''
revisited",
journal = "Information Processing Letters",
volume = "24",
number = "4",
pages = "211--216",
month = mar,
year = "1987",
ISSN = "0020-0190",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Wed Aug 17 01:43:46 1994",
keywords = "algorithms; verification",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems \\ D.3.3 Software, PROGRAMMING LANGUAGES,
Language Constructs, Concurrent programming
structures",
}
@Article{Collins:1960:MOE,
author = "George E. Collins",
title = "A Method for Overlapping and Erasure of Lists",
journal = "Communications of the ACM",
volume = "2",
number = "12",
pages = "655--657",
month = dec,
year = "1960",
bibdate = "Mon Sep 19 22:18:26 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
comment = "The original reference counting paper.",
}
@Article{McCarthy:1960:RFS,
author = "J. McCarthy",
title = "Recursive Functions of Symbolic Expressions and their
Computation by Machine, Part {I}",
journal = "Communications of the ACM",
volume = "3",
number = "4",
pages = "184--195",
month = apr,
year = "1960",
annote = "A programming system called LISP (for LISt Processor)
has been developed for the IBM 704 computer by the
Artificial Intelligence Group at MIT. The system was
designed to facilitate experiments with a proposed
system called the Advice Taker, whereby a machine could
be instructed to handle declarative as well as
imperative sentences and could exhibit ``common sense''
in carrying out its instructions. The original proposal
(1) for the Advice Taker\ldots{}",
bibdate = "Mon Sep 19 22:25:43 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/Pre.1970.bib
and
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
descriptors = "symbolic algebraic language; symbolic algebraic
computation; formula interpretation; recursion method",
keywords = "LISP functional",
}
@Article{Weizenbaum:1964:MRC,
author = "J. Weizenbaum",
title = "More on the Reference Counter Method",
journal = "Communications of the ACM",
volume = "7",
number = "1",
pages = "38",
month = jan,
year = "1964",
bibdate = "Thu Sep 22 11:27:24 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
}
@Article{Bobrow:1967:SLS,
author = "D. G. Bobrow and D. L. Murphy",
title = "Structure of a {LISP} system using two-level Storage",
journal = "Communications of the ACM",
volume = "10",
number = "3",
pages = "155--159",
month = mar,
year = "1967",
bibdate = "Mon Sep 19 23:20:22 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
}
@Article{Fenichel:1969:LGC,
author = "Robert R. Fenichel and Jerome C. Yochelson",
title = "A {LISP} Garbage-Collector for Virtual-Memory Computer
Systems",
journal = "Communications of the ACM",
volume = "12",
number = "11",
pages = "611--612",
month = nov,
year = "1969",
bibdate = "Mon Sep 19 23:58:02 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
}
@Article{Reingold:1973:NLM,
author = "E. M. Reingold",
title = "A Nonrecursive List Moving Algorithm",
journal = "Communications of the ACM",
volume = "16",
number = "5",
pages = "305--307",
month = may,
year = "1973",
bibdate = "Tue Sep 20 21:29:38 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
}
@Article{Clark:1976:ELM,
author = "D. W. Clark",
title = "An Efficient List Moving Algorithm Using constant
Workspace",
journal = "Communications of the ACM",
volume = "19",
number = "6",
pages = "352--354",
month = jun,
year = "1976",
bibdate = "Tue Sep 20 22:29:26 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
}
@Article{Nielsen:1977:DMA,
author = "Norman R. Nielsen",
title = "Dynamic Memory Allocation in Computer Simulation",
journal = "Communications of the ACM",
volume = "20",
number = "11",
pages = "864--873",
month = nov,
year = "1977",
bibdate = "Tue Sep 20 23:05:28 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
}
@Article{Robson:1977:BSA,
author = "J. M. Robson",
title = "A Bounded Storage Algorithm for Copying cyclic
Structures",
journal = "Communications of the ACM",
volume = "20",
number = "6",
pages = "431--433",
month = jun,
year = "1977",
bibdate = "Tue Sep 20 23:07:38 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
}
@Article{Morris:1979:CGC,
author = "F. L. Morris",
title = "On a Comparison of Garbage Collection Techniques",
journal = "Communications of the ACM",
volume = "22",
number = "10",
pages = "571",
month = oct,
year = "1979",
bibdate = "Wed Sep 21 22:40:09 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
}
@Article{Lee:1980:LAC,
author = "K. P. Lee",
title = "A Linear Algorithm for Copying Binary Trees Using
Bounded Workspace",
journal = "Communications of the ACM",
volume = "23",
number = "3",
pages = "159--162",
month = mar,
year = "1980",
bibdate = "Wed Sep 21 22:56:16 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
}
@Article{Appleby:1988:GCP,
author = "K. Appleby and M. Carllson and S. Haridi and D.
Sawhlin",
title = "Garbage collection for {Prolog} based on {WAM}",
journal = "Communications of the ACM",
volume = "31",
number = "6",
pages = "719--741",
month = jun,
year = "1988",
ISSN = "0001-0782",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Sun Aug 14 18:32:13 MDT 1994",
keywords = "algorithms; design; languages; performance; theory",
subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Models of Computation \\ F.2.2 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Sorting and searching \\ D.3.2 Software, PROGRAMMING
LANGUAGES, Language Classifications, Prolog",
}
@Article{Cohen:1981:GCL,
author = "Jacques Cohen",
title = "Garbage Collection of Linked Data Structures",
journal = "ACM Computing Surveys",
volume = "13",
number = "3",
pages = "341--367",
month = sep,
year = "1981",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Sat Sep 24 22:18:11 1994",
}
@TechReport{gc:rep:1208,
author = "Terence J. Critchlow and Mark R. Swanson",
title = "Global Garbage Collection in Concurrent {U}tah
{S}cheme",
institution = "Dept.\ of Computer Sc., U.\ of Utah",
year = "1994",
number = "92-01",
address = "Utah UT {(USA)}",
month = feb,
}
@PhdThesis{gc:rep:1221,
author = "David Plainfoss\'e",
title = "Distributed Garbage Collection and Reference
Management in the {S}oul Object Support System",
school = "Universit\'{e} Paris-6, Pierre-et-Marie-Curie",
year = "1994",
address = "Paris (France)",
month = jun,
note = "Available from INRIA as TU-281, ISBN-2-7261-0849-0",
}
@InProceedings{gc:rep:sor:1223,
author = "Paulo Ferreira and Marc Shapiro",
title = "Garbage Collection of Persistent Objects in
Distributed Shared Memory",
pages = "176--191",
booktitle = "Proc.\ of the 6th Int.\ Workshop on Persistent Object
Systems",
year = "1994",
publisher = "Springer-Verlag",
address = "Tarascon (France)",
month = sep,
}
@InProceedings{gc:1225,
author = "Marc Shapiro and David Plainfoss\'{e} and Paulo
Ferreira and Laurent Amsaleg",
title = "Some Key Issues in the Design of Distributed Garbage
Collection and References",
booktitle = "Unifying Theory and Practice in Distributed Systems",
year = "1994",
address = "Dagstuhl (Germany)",
month = sep,
}
@InProceedings{gc:bd:1237,
author = "Jonathan E. Cook and Alexander L. Wolf and Benjamin G.
Zorn",
title = "Partition Selection Policies in Object Database
Garbage Collection",
pages = "371--382",
booktitle = "Proc.\ Int.\ Conf.\ on Management of Data (SIGMOD)",
year = "1994",
organization = "ACM SIGMOD",
address = "Minneapolis MN ({USA})",
month = may,
}
@InProceedings{gc:svy:sor:1238,
author = "David Plainfoss\'e and Marc Shapiro",
title = "A Survey of Distributed Garbage Collection
Techniques",
booktitle = "Second Closed BROADCAST Workshop",
year = "1994",
organization = "Broadcast Basic Research Action",
address = "Bruxelles (Belgique)",
month = nov,
}
@InProceedings{Ellis94,
author = "John R. Ellis and David L. Detlefs",
title = "Safe, Efficient Garbage Collection for {C}++",
booktitle = "USENIX Sixth C++ Technical Conference",
location = "Xerox PARC, DEC SR",
pages = "143--177",
publisher = "USENIX",
address = "Cambridge, MA",
month = apr # " 11-14",
year = "1994",
}
@InProceedings{ferreira:garbage,
author = "Paulo Ferreira and Marc Shapiro",
title = "Garbage Collection and {DSM} Consistency",
booktitle = "Proceedings of the First Symposium on Operating
Systems Design and Implementation",
year = "1994",
pages = "229--241",
abstract = "This paper presents the design of a copying garbage
collector for persistent distributed shared objects in
a loosely coupled network with weakly consistent
distributed shared memory (DSM). \par The main goal of
the design for this garbage collector is to minimize
the communication overhead due to collection between
nodes of the system, and to avoid any interference with
the DSM memory consistency protocol. \par Our design is
based on the observation that, in a weakly consistent
DSM system, the memory consistency requirements of the
garbage collector are less strict than those of the
applications. Thus, the garbage collector reclaims
objects independently of other copies of the same
objects without interfering with the DSM consistency
protocol. Furthermore, our design does not require
reliable communication support, and is capable of
reclaiming distributed cycles of dead objects.",
}
@TechReport{Schr94a,
author = "Wolfgang Schreiner",
title = "{Garbage Collection on a Stack}",
number = "94-01",
institution = "Research Institute for Symbolic Computation",
address = "Johannes Kepler University, Linz, Austria",
month = jan,
year = "1994",
}
@Article{Hughes:1982:SGC,
author = "R. J. M. Hughes",
title = "A semi-incremental garbage collection algorithm",
journal = "Software\emdash Practice and Experience",
volume = "12",
number = "11",
pages = "1081--1084",
month = nov,
year = "1982",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Wed Aug 24 12:18:38 MDT 1994",
keywords = "languages; performance",
subject = "C.3 Computer Systems Organization, SPECIAL-PURPOSE AND
APPLICATION-BASED SYSTEMS, Real-time systems \\ E.4
Data, CODING AND INFORMATION THEORY, Data compaction
and compression \\ D.3.2 Software, PROGRAMMING
LANGUAGES, Language Classifications, LISP",
}
@Article{Christopher:1984:RCG,
author = "T. W. Christopher",
title = "Reference count garbage collection",
journal = "Software\emdash Practice and Experience",
volume = "14",
number = "6",
pages = "503--507",
month = jun,
year = "1984",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Wed Aug 24 12:18:38 MDT 1994",
keywords = "algorithms",
subject = "E.1 Data, DATA STRUCTURES, Lists",
}
@Article{Detlefs:1994:MAC,
author = "David Detlefs and Al Dosser and Benjamin Zorn",
title = "Memory Allocation Costs in Large {C} and {C++}
Programs",
journal = "Software\emdash Practice and Experience",
volume = "24",
number = "6",
pages = "527--542",
month = jun,
year = "1994",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Wed Aug 24 15:30:34 1994",
keywords = "garbage collection; dynamic storage allocation;
performance evaluation; conservative collection;
dynamic memory management",
}
@TechReport{Hogen??a,
author = "Rita Loogen Guido Hogen",
title = "Parallel Functional Implementations: Graphbased
vs.~Stackbased",
institution = "Technical University of Aachen (RWTH Aachen)",
number = "94-18",
pages = "14",
url = "ftp://ftp.informatik.rwth-aachen.de/pub/reports/1994/94-18.ps.gz",
abstract = "The {\em meshed stack} is a technique for the
management of control structures in distributed
implementations of dynamic process systems. In the
environment of a parallel abstract machine for the
execution of functional programs, we compare this
approach to the classical graphbased reduction
technique. Experimental results will show, that the
stackbased reduction is more efficient in space and
time, especially in relation to garbage collection.
Also, the stack technique is a natural extension of
sequential reduction machines.",
}
@TechReport{Amsaleg94,
author = "Laurent Amsaleg and Michael Franklin and Olivier
Gruber",
title = "Efficient Incremental Garbage Collection for
Workstation/Server Database Systems",
institution = "University of Maryland Institute for Advanced Computer
Studies Dept. of Computer Science, Univ. of Maryland",
number = "CS-TR-3370",
address = "College Park, MD",
month = nov,
year = "1994",
url = "ftp://ftp.cs.umd.edu/pub/papers/papers/3370/3370.ps.Z",
abstract = "We describe an efficient server-based algorithm for
garbage collecting object-oriented databases in a
workstation/server environment. The algorithm is
incremental and runs concurrently with client
transactions, however, it does not hold any locks on
data and does not require callbacks to clients. It is
fault tolerant, but performs very little logging. The
algorithm has been designed to be integrated into
existing OODB systems, and therefore it works with
standard implementation techniques such as two-phase
locking and write-ahead-logging. In addition, it
supports client-server performance optimizations such
as client caching and flexible management of client
buffers. We describe an implementation of the algorithm
in the EXODUS storage manager and present results from
an initial performance study of the implementation.
These results demonstrate that the introduction of the
garbage collector adds minimal overhead to client
operations .\par (Also cross-referenced as
UMIACS-TR-94-121)",
}
@TechReport{AIM-1462,
title = "Garbage Collection is Fast, but a Stack is Faster",
author = "James S. Miller and Guillermo J. Rozas",
institution = "Artificial Intelligence Laboratory, Massachusetts
Institute of Technology (MIT)",
address = "Cambridge, Massachusetts",
month = mar,
year = "1994",
pages = "37",
url = "ftp://publications.ai.mit.edu/ai-publications/1000-1499/AIM-1462.ps.Z",
abstract = "Prompted by claims that garbage collection can
outperform stack allocation when sufficient physical
memory is available, we present a careful analysis and
set of cross-architecture measurements comparing these
two approaches for the implementation of continuation
(procedure call) frames. When the frames are allocated
on a heap they require additional space, increase the
amount of data transferred between memory and
registers, and, on current architectures, require more
instructions. We find that stack allocation of
continuation frames outperforms heap allocation in some
cases by almost a factor of three. Thus, stacks remain
an important implementation technique for procedure
calls, even in the presence of an efficient, compacting
garbage collector and large amounts of memory.",
}
@TechReport{AITR-1492,
title = "Logging and Recovery in a Highly Concurrent Database",
author = "John S. Keen",
institution = "Artificial Intelligence Laboratory, Massachusetts
Institute of Technology (MIT)",
address = "Cambridge, Massachusetts",
month = jun,
year = "1994",
pages = "183",
url = "ftp://publications.ai.mit.edu/ai-publications/1000-1499/AITR-1492.ps.Z",
abstract = "This report addresses the problem of fault tolerance
to system failures for database systems that are to run
on highly concurrent computers. It assumes that, in
general, an application may have a wide distribution in
the lifetimes of its transactions. Logging remains the
method of choice for ensuring fault tolerance.
Generational garbage collection techniques manage the
limited disk space reserved for log information; this
technique does not require periodic checkpoints and is
well suited for applications with a broad range of
transaction lifetimes. An arbitrarily large collection
of parallel log streams provide the necessary disk
bandwidth.",
}
@TechReport{Goncalves94,
author = "Marcelo J. R. Goncalves and Andrew W. Appel",
title = "Cache Performance of Fast-Allocating Programs",
institution = "Department of Computer Science, Princeton University",
number = "TR-482-94",
pages = "12",
month = dec,
year = "1994",
abstract = "We study the cache performance of a set of ML
programs, compiled by the Standard ML of New Jersey
compiler. We find that more than half of the reads are
for objects that have just been allocated. We also
consider the effects of varying software (garbage
collection frequency) and hardware (cache) parameters.
Confirming results of related experiments, we found
that ML programs can have good cache performance when
there is no penalty for allocation. Even on caches that
have an allocation penalty, we found that ML programs
can have lower miss ratios than the C and Fortran
SPEC92 benchmarks.\par Topics: 4 benchmarks,
performance analysis; 21 hardware design, measurements;
17 garbage collection, storage allocation; 46 runtime
systems.",
}
@Article{Baker94,
author = "Baker",
title = "Thermodynamics and Garbage Collection",
journal = "ACM SIGPLAN Notices",
volume = "29",
year = "1994",
}
@Article{Banach94,
author = "Banach",
title = "Term Graph Rewriting and Garbage Collection Using
Opfibrations",
journal = "Theoretical Computer Science",
volume = "131",
year = "1994",
}
@Article{Kowaltowski:1979:DSC,
author = "Tomasz Kowaltowski",
title = "Data Structures and Correctness of Programs",
journal = "Journal of the ACM",
volume = "26",
number = "2",
pages = "283--301",
month = apr,
year = "1979",
acknowledgement = "Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|",
bibdate = "Wed Oct 26 23:15:54 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
}
Found 59 references in 21 bibliographies.
You used 22 seconds of our CPU time.