for "garbage" and "collection" and "1982"
Search term: garbage;collection;1982
No spelling errors allowed, case-insensitive, partial words match.
Information on how to form queries.
@InProceedings{BRUYNOOGHE82,
key = "Bruynooghe",
author = "M. Bruynooghe",
title = "A Note on Garbage Collection in Prolog Interpreters",
booktitle = "Proceedings of the First International Logic
Programming Conference",
editor = "M. van Caneghem",
organization = "ADDP-GIA, Faculte des Sciences de Luminy",
address = "Marseille, France",
month = sep,
year = "1982",
pages = "52--55",
keywords = "garbage collection; determinate computations",
bibdate = "Tue Jul 5 14:32:18 1983",
}
@Article{NSW:PPGA,
author = "I. A. Newman and R. P. Stallard and M. C. Woodward",
title = "Performance of parallel garbage collection
algorithms",
journal = "Computer Studies",
volume = "166",
number = "",
year = "1982",
month = sep,
}
@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{Hudak82,
author = "P. Hudak and R. M. Keller",
title = "Garbage collection and task deletion in distributed
applicative processing systems.",
journal = "???",
pages = "168--178",
year = "1982",
keywords = "FP, parallel, distributed, applicative, functional,
programming, implementation, garbage, collection, task,
process, spawn, spark",
abstract = "Processing elements have only local store. Connected
by a communication network. Virtual addressing =$>$ a
PE may ref any other node in system.",
}
@InProceedings{Hudak82,
author = "P. R. Hudak and R. M. Keller",
title = "Garbage Collection and Task Deletion in Distributed
Applicative Processing Systems",
booktitle = "Conference Record of the 1982 ACM Symposium on LISP
and Functional Programming",
publisher = "ACM",
address = "New York, NY",
year = "1982",
keywords = "functional parallel",
}
@Article{Martin:1982:EGC,
author = "Johannes J. Martin",
title = "An Efficient Garbage Compaction Algorithm",
journal = "Communications of the ACM",
volume = "25",
number = "8",
pages = "571--581",
month = aug,
year = "1982",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib",
}
@Article{COPELAND82,
key = "Copeland",
author = "G. Copeland",
title = "What If Mass Storage Were Free?",
journal = "IEEE Computer",
volume = "15",
number = "7",
month = jul,
year = "1982",
pages = "27--35",
abstract = "This article takes the idea of ever-decreasing mass
storage costs to its absolute limit and examines the
hypothetical effects that free mass storage would
likely have on the design and use of future data-base
systems. Unfortunately, because of the broad scope of
the topics discussed herein, it is not possible to
describe each of them in depth. Instead, the goal here
is to provide an overall picture of mass storage
systems so that the reader can see how the pieces fit
together in a compatible and consistent way.",
annote = "The following advantages accrue from a non-deletion
strategy: improved functionality, access to past
states, use in accounting systems, elimination of
complex garbage collection mechanisms, improved
reliability, throughput, and availability, and
synchronization of distributed data bases. Two problems
with optical disks are noted: the solid-state laser
read/write heads currently have a limited lifespan and
therefore require periodic replacement, and
first-generation optical disks do not facilitate small
insertions because optical disks, like magnetic disks,
have unacceptable raw error rates.",
bibdate = "Wed Sep 26 10:52:16 1984",
}
@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",
}
@InProceedings{BenAri82,
author = "Ben-Ari",
title = "On-the-fly Garbage Collection: New Algorithms Inspired
by Program Proofs",
booktitle = "Annual International Colloquium on Automata, Languages
and Programming",
year = "1982",
}
Found 10 references in 9 bibliographies.
You used 19 seconds of our CPU time.