for "garbage" and "collection" and "1980"
Search term: garbage;collection;1980
No spelling errors allowed, case-insensitive, partial words match.
Information on how to form queries.
@InCollection{Stoyan79,
author = "Herbert Stoyan",
title = "Vergleich und Bewertung von Markierungsalgorithmen
f{\"u}r Garbage Collection",
booktitle = "Intern. Koll. Aktuelle Probl. d. Rechentechnik",
publisher = "Wiss. Zeitschr. TU Dresden, Math.-Nat. Reihe (2)",
address = "Dresden",
volume = "29 (1980)",
number = "2",
pages = "386--387",
keywords = "LISP",
year = "1979",
}
@TechReport{Lieberman80b,
author = "H. Lieberman and Carl E. Hewitt",
title = "A Real Time Garbage Collector That Can Recover
Temporary Storage Quickly",
institution = "Massachusetts Institute of Technology, A.I. Lab.",
address = "Cambridge, Massachusetts",
type = "Technical Report",
number = "A. I. MEMO 569",
keywords = "Real Time Garbage Collection, Reference Counting,
LISP, Object-Oriented Programming, Virtual Memory,
Parallel Processing",
cite = "\bibitem{LH83a} (\cite{LH83c})",
note = "siehe auch A. I. MEMO 569A, 1983 und 569A, Okt. 1981",
month = apr,
year = "1980",
}
@Article{Stoyan80b,
author = "Herbert Stoyan",
title = "Vergleich und Bewertung von Markierungsalgorithmen
fuer Garbage Collection",
journal = "Wiss. Zeitschr. TU Dresden, Math-Nat. Reihe (2)",
volume = "29",
number = "2",
pages = "386--387",
keywords = "LISP",
note = "Intern. Koll. Aktuelle Probl. d. Rechentechnik,
Dresden 1979",
year = "1980",
}
%L Alme80a
%K olit memory
%A Guy T. Almes
%T Garbage Collection in an Object-Oriented System
%R Ph.D. thesis
%I Carnegie Mellon University
%C Pittsburgh, PA
%D 1980
@Article{HYsigarchnews80,
author = "Y. Hibino",
title = "A Practical Parallel Garbage Collection Algorithm and
Its Implementation",
journal = "{SIGARCH} Newsletter",
volume = "8",
number = "3",
month = may,
year = "1980",
pages = "113--120",
keywords = "Hardware assisted GC",
}
@PhdThesis{GTA1980CMU,
author = "Guy T. Almes",
title = "Garbage Collection in an Object-Oriented System",
school = "Carnegie Mellon University",
address = "Pittsburgh, PA",
year = "1980",
month = jun,
comment = "Introduces a multiprocessor scheme that relies on a
centralized data structure to coordinate collection",
}
@Article{Baker80,
author = "H. G. Baker and C. E. Hewitt",
title = "The Incremental Garbage Collection of Processes",
journal = "ACM SIGPLAN Notices",
volume = "12",
number = "8",
year = "1980",
keywords = "functional",
}
@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",
}
@TechReport{MIT/LCS/TR-243,
author = "L. Svobodova",
title = "{MANAGEMENT} {OF} {OBJECT} {HISTORIES} {IN} {THE}
{SWALLOW} {REPOSITORY}",
institution = "MIT Laboratory for Computer Science",
number = "MIT/LCS/TR-243",
pages = "79",
month = aug,
year = "1980",
price = "USD 16.00",
keywords = "distributed systems, atomicity, storage management,
reliability, recovery, SWALLOW",
abstract = "SWALLOW is an experimental distributed data storage
system that provides personal computers with a uniform
interface to their local data and the data stored in
shared remote servers called repositories. The SWALLOW
repositories provide reliable, secure, and efficient
long-term storage for both very small and very large
objects and support updating of a group of objects at
one or several repositories in a single atomic action.
The repositories support, with some minor
modifications, the object model developed by Reed [Reed
78]. The core of the repository is stable append-only
storage called the Version Storage (VS). VS is the only
stable storage in the repository. It contains the
histories of all objects in the repository and all the
information needed for crash recovery. It is assumed
that VS will be implemented with write-once storage
devices such as optical disks. The upper 2 words of VS
are kept in the Online Version Storage (OVS).
Techniques similar to real-time garbage collection are
used to keep current versions of frequently used
objects in OVS. Two different policies for retaining
current versions of objects in OVS are investigated;
the actual implementation further depends on the type
of storage devices used for OVS. A critical concern
addressed throughout the design of the repository is
recovery from crashes and storage device failures. The
crash recovery of the repositories is based entirely on
the information contained in VS; VS is scanned
sequentially, starting from its current end, until all
objects histories have been reconstructed. The recovery
can be distributed over time, such that the recovery
process is invoked for one object at a time, as
individual objects are accessed. The same mechanism is
used to recover commit records, which are data
structures that record the state of atomic actions and
group together the objects to be updated in a single
atomic action. The implementation of commit records in
the repository guarantees that all updates made by a
specific atomic action are either all completed or all
undone, regardless of failures. Further, interrupted
atomic actions can be continued from the point of
interruption, without any additional (backward)
recovery.",
}
Found 9 references in 5 bibliographies.
You used 16 seconds of our CPU time.