for "garbage" and "collection" and "1987"
Search term: garbage;collection;1987
No spelling errors allowed, case-insensitive, partial words match.
Information on how to form queries.
@TechReport{Abraham87,
author = "Santosh Abraham and J. Patel",
title = "Parallel Garbage Collection on a Virtual Memory
System",
institution = "Center for Supercomputing Research and Development,
University of Illinois",
number = "620",
month = aug,
year = "1987",
keywords = "T01 H03",
abstract = "to appear in 1987 International Conference on Parallel
Processing",
}
@TechReport{chase:87c,
author = "David R. Chase",
title = "Garbage collection and other optimizations",
institution = rice,
type = "Technical Report",
month = aug,
year = "1987",
}
@PhdThesis{Chase:phd,
author = "David Chase",
title = "Garbage Collection and Other Optimizations",
year = "1987",
month = nov,
school = "Rice University",
address = "Houston, Texas",
}
@InProceedings{AP:PGCVMS,
author = "Santosh G. Abraham and Janak H. Patel",
title = "Parallel Garbage Collection on a Virtual Memory
System",
booktitle = "International Conference on Parallel Processing and
Applications",
editor = "E. Chiricozzi and A. D'Amato",
year = "1987",
month = sep,
address = "L'Aquila, Italy",
publisher = "Elsevier North-Holland",
pages = "243--246",
}
@InCollection{Watson-Watson-1987,
author = "P. Watson and I. Watson",
title = "An Efficient Garbage Collection Scheme for Parallel
Computer Architecture",
crossref = "parle87",
key = "",
pages = "432--443",
}
@PhdThesis{Bagherzadeh87,
author = "Nader Bagherzadeh",
title = "Distributed resource management: garbage collection",
year = "1987",
school = "University of Texas, Austin",
keywords = "distributed processing, garbage collection",
}
@MastersThesis{Gray87,
author = "Stanley M. Gray",
title = "Garbage collection in a parallel processing
environment",
year = "1987",
school = "East Texas State University",
keywords = "parallel processing, 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,
}
@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.",
}
@Article{HARLAND87,
key = "Harland \& Beloff",
author = "D. M. Harland and B. Beloff",
title = "{OBJEKT}: {A} Persistent Object Store With An
Integrated Garbage Collector",
journal = "sigplan",
publisher = "acm",
volume = "22",
number = "4",
month = apr,
year = "1987",
pages = "70--79",
abstract = "This paper describes OBJEKT, a single-level persistent
storage system desgined for the REKURSIV architecture.
It will be shown that OBJEKT can be microcoded to
implement ``objects'' efficiently, and that data
integrity can be guaranteed by provision of an object
oriented instruction set. Particular attention will be
paid to its facilities for type and range checking, to
its object by object paging strategy and to ways of
enchancing parallelism during garbage collection.",
bibdate = "Thu Apr 9 12:03:30 1987",
owner = "manning",
}
@InCollection{MulTan85,
author = "S. J. Mullender and A. S. Tanenbaum",
editor = "S. J. Mullender",
title = "A Distributed File Service Based on Optimistic
Concurrency Control",
booktitle = "The Amoeba distributed operating system: Selected
papers 1984-1987",
pages = "185--207",
publisher = "Centrum voor Wiskunde en Informatica , Amsterdam",
month = "[12]",
year = "1985",
keywords = "File System Amoeba",
abstract = "Principles are presented for a distributed file and
database system that leaves a large degree of freedom
to the users of the system. It can be used as an
efficient storage medium for files, but also as a basis
for a distributed data base system. An optimistic
concurrency control mechanism, based on the
simultaneous existance of several versions of a file or
data base is used. Each version provides to the client
that owns it, a consistent view of the contents of the
file at the time of the versions creation. We show how
this mechanism works, how it can be implemented and how
serialisability of concurrent access is enforced. A
garbage collector that runs independant of, and in
parallel with, the operation of the system is also
presented.",
note = "Comment 1 by schlenk, Thu Jun 23 22:51:38 1988 The
Amoeba filesystem is based on a tree of pages. Each
page is named by a path leading to it, that includes
previous data or filename pages. Transactions are
supported by versions which makes this filesystem an
ideal basis for databases.",
}
@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",
}
@MastersThesis{BIYANI87,
key = "Biyani",
author = "V. Biyani",
title = "An Efficient Runtime System for {IDL}",
school = "University of North Carolina at Chapel Hill",
address = "Department of Computer Science, Chapel Hill, NC",
month = oct,
year = "1987",
abstract = "The Interface Description Language is a language to
specify data structures communicated between processes.
This research deals with the design of an efficient
runtime system should support, and describes how they
are implemented in our system. The runtime system
includes support for input and output for IDL instances
both in ASCII and in relocatable binary format, support
for sets and sequences of objects, an object management
system with garbage collection and a memory display
facility for debugging purposes. An example IDL
specification is presented. Limitations of the system
and directions for future work in the area are
discussed.",
bibdate = "Wed Oct 7 16:07:28 1987",
owner = "manning",
}
@TechReport{ROVNER85,
key = "Rovner et al.",
author = "P. Rovner and R. Levin and J. Wick",
title = "On Extending Modula-2 for Building Large, Integrated
Systems",
number = "3",
institution = "Digital Systems Research Center",
address = "Palo Alto, CA",
year = "1985",
month = jan,
pages = "1--46",
abstract = "Modula-2 has been chosen as SRC's primary programming
language for the next few years. This report addresses
some of the problems of using Modula-2 for building
large, integrated systems. The report has three
sections: Section 1 outlines a set of extensions to the
language. (The extended language is called Modula-2+.)
Section 2 (with Appendix B) provides a complete
description of the Modula-2+ type-checking rules.
Section 3 offers some guidelines for programming in
Modula-2+. Our implementation of Modula-2+ is based on
the Modula-2 compiler written by Mike Powell at the DEC
Western Research Laboratory. Our extensions include
features for exceptions and finalization, garbage
collection, and concurrency.",
bibdate = "Mon Feb 2 11:41:56 1987",
owner = "manning",
}
@InCollection{Bevan87,
author = "D. I. Bevan",
title = "Distributed Garbage Collection using Reference
Counting",
booktitle = "PARLE: Parallel Architectures and Languages Europe
(Volume 2)",
year = "1987",
keywords = "functional",
note = "Lecture Notes in Computer Science 259.",
}
@InProceedings{Deb87,
author = "A. Deb",
editor = "J. H. Fasel and R. M. Keller",
title = "Parallel Garbage Collection in a Parallel Virtual
Memory Environment",
booktitle = "Graph Reduction: Proceedings of a Workshop at Santa
F{\'e}, New Mexico",
pages = "252--264",
publisher = "Springer-Verlag",
address = "New York, NY",
year = "1987",
keywords = "functional",
ISBN = "0-387-18420-1",
note = "Lecture Notes in Computer Science 279.",
}
@TechReport{Derbyshire87,
author = "M. Derbyshire",
title = "Garbage Collection on the {IRM}: Report Number 6",
institution = "University of Manchester, Department of Computer
Science",
type = "Ref. no.",
number = "FS/MU/MHD/004-87",
address = "Manchester, UK",
year = "1987",
keywords = "functional parallel flagship",
abstract = "This report specifies a mark-scan garbage collection
algorithm for the IRM.",
}
@InCollection{North87,
author = "S. C. North and J. H. Reppy",
editor = "G. Kahn",
title = "Concurrent Garbage Collection on Stock Hardware",
booktitle = "Functional Programming Languages and Computer
Architecture",
pages = "113--133",
publisher = "Springer-Verlag",
address = "Berlin, DE",
year = "1987",
ISBN = "3-540-18317-5",
abstract = "This paper describes the design and implementation of
a memory management system for Pegasus, a system that
supports the implementation of programming environments
and other interactive applications on single-user
workstations.",
note = "Lecture Notes in Computer Science 274; Proceedings of
Conference held at Portland, OR.",
}
@InCollection{Watson87b,
author = "P. Watson and I. Watson",
editor = "J. W. de Bakker and A. J. Nijman and P. C. Treleaven",
title = "An Efficient Garbage Collection Scheme for Parallel
Computer Architectures",
booktitle = "PARLE: Parallel Architectures and Languages Europe
(Volume 2: Parallel Languages)",
pages = "432--443",
publisher = "Springer-Verlag",
address = "Berlin, DE",
year = "1987",
keywords = "functional bakker",
ISBN = "0-387-17945-3",
abstract = "This paper examines the problems of garbage collection
on parallel machines, and proposes a new scheme which
has been implemented on the Flagship parallel machine
architecture. It is efficient because it requires no
synchronisation.",
note = "Lecture Notes in Computer Science 259.",
}
@InProceedings{Ridoux87,
author = "Olivier Ridoux",
title = "Deterministic and Stochastic Modeling of Parallel
Garbage Collection: Towards Real-Time Criteria",
booktitle = "Proc. 14th Annual Symposium on Computer Architecture",
pages = "128--136",
month = jun,
year = "1987",
}
@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{Rosen87,
author = "Steven M. Rosen",
title = "Controlling Dynamic Ada Objects in Large Ada Systems",
journal = "Ada Letters",
volume = "VII",
number = "5",
pages = "79--92",
publisher = "ACM SIGAda",
address = "New York, NY",
month = sep,
year = "1987",
keywords = "garbage collection, generic packages",
}
@PhdThesis{gc:rep:191,
author = "Stephen C. Vestal",
title = "Garbage Collection: An Exercise in Distributed,
Fault-Tolerant Programming",
school = "Dept.\ of Comp.\ Sc., U.\ of Washington",
year = "1987",
address = "Seattle WA (USA)",
month = jan,
note = "U.\ of Washington Tech.\ Report 87-01-03",
}
@InProceedings{Beva87,
author = "D. I. Bevan",
title = "{Distributed Garbage Collection Using Reference
Counting}",
booktitle = "{Proceedings of PARLE, Parallel Architectures and
Languages Europe, Volume 2: Parallel Languages}",
address = "Eindhoven, The Netherlands, June 15--19",
year = "1987",
series = "Lecture Notes in Computer Science",
volume = "259",
publisher = "Springer, Berlin",
pages = "176--187",
owner = "pcl",
}
@InProceedings{WaWa87,
author = "Paul Watson and Ian Watson",
title = "{An Efficient Garbage Collection Scheme for Parallel
Computer Architectures}",
booktitle = "{Proceedings of PARLE, Parallel Architectures and
Languages Europe, Volume 2: Parallel Languages}",
address = "Eindhoven, The Netherlands, June 15--19",
year = "1987",
series = "Lecture Notes in Computer Science",
volume = "259",
publisher = "Springer, Berlin",
pages = "432--443",
owner = "pcl",
}
@InProceedings{Augu87a,
author = "Lex Augusteijn",
title = "{Garbage Collection in a Distributed Environment}",
booktitle = "{Proceedings of PARLE, Parallel Architectures and
Languages Europe, Volume 2: Parallel Languages}",
address = "Eindhoven, The Netherlands, June 15--19",
year = "1987",
series = "Lecture Notes in Computer Science",
volume = "259",
publisher = "Springer, Berlin",
pages = "75--93",
owner = "pcl",
}
@Article{EcLe87,
author = "J. Dana Eckart and Richard J. LeBlanc",
title = "{Distributed Garbage Collection}",
year = "1987",
journal = "??",
publisher = "ACM",
pages = "264--273",
owner = "Bu",
descr = "pagc",
}
@Article{NSW87,
author = "I. A. Newman and R. P. Stallard and M. C. Woodward",
title = "{A Hybrid Multiple Processor Garbage Collection
Algorithm}",
journal = "{The Computer Journal}",
year = "1987",
volume = "30",
number = "2",
pages = "119--127",
owner = "pcl",
descr = "pagc",
}
@Article{GlTh87,
author = "H. W. Glaser and P. Thompson",
title = "{Lazy Garbage Collection}",
journal = "{Software --- Practice and Experience}",
year = "1987",
volume = "17",
number = "1",
pages = "1--4",
month = jan,
owner = "pcl",
descr = "pagc",
}
@Article{STROM86,
key = "Strom \& Yemini",
author = "R. E. Strom and S. Yemini",
title = "Typestate: {A} Programming Language Concept for
Enhancing Software Reliability",
journal = "tose",
publisher = "ieee",
volume = "SE-12",
number = "1",
month = jan,
year = "1986",
pages = "157--171",
keywords = "Program analysis; program verification; security;
software reliability; type checking; typestate",
abstract = "We introduce a new programming language concept called
typestate, which is a refinement of the concept of
type. Whereas the type of a data object determines the
set of operations ever permitted on the object,
typestate determines the subset of these operations
which is permitted in a particular context. Typestate
tracking is a program analysis technique which enhances
program reliability by detecting at compile-time
syntactically legal but semantically undefined
execution sequences. These include, for example,
reading a variable before it has been initialized,
dereferencing a pointer after the dynamic object has
been deallocated, etc. Typestate tracking detects
errors that cannot be detected by type checking or by
conventional static scope rules. Additionally,
typestate tracking makes it possible for compilers to
insert appropriate finalization of data at exception
points and on program termination, eliminating the need
to support finalization by means of either garbage
collection or unsafe deallocation operations such as
Pascal's dispose operation. By enforcing typestate
invariants at compile-time, it becomes practical to
implement a ``secure language''- that is, on in which
all successfully compiled program modules have fully
defined execution-time effects, and the only effects of
program errors are incorrect output values. This paper
defines typestate, gives examples of its application,
and shows how typestate checking may be embedded into a
compiler. We discuss the consequences of typestate
checking for software reliability and software
structure, and conclude with a discussion of our
experience using a high-level language incorporating
typestate checking.",
bibdate = "Fri Aug 21 14:26:38 1987",
owner = "manning",
}
@PhdThesis{Watson87,
author = "Paul Watson",
title = "The Parallel Reduction of Lambda Calculus Expression",
school = "University of Manchester, Computer Science
Department",
type = "Ph.{D}. Thesis",
number = "UMCS-87-2-1",
month = feb,
year = "1987",
url = "http://www.cs.man.ac.uk/csonly/cstechrep/Abstracts/UMCS-87-2-1.html
mailto::techreports@cs.man.ac.uk",
abstract = "Models of computation for the evaluation of Functional
Programs are based on the rules for reducing Lambda
Calculus expressions. Reduction is achieved by the
application of the b-conversion rule to suitable
redexes, but few models of computation provide a full
implementation of this rule because of the complexity
of avoiding variable name clashes. Consequently,
evaluation orders are restricted to those in which name
clashes cannot occur. \_ This thesis develops a model
of computation for the parallel reduction of Lambda
Calculus expressions, represented in De Bruijn's
name-free notation, which does provide a full
implementation of b-conversion, allowing expression to
be reduced by any evaluation order. The model is
designed to allow reduction to be performed on a
parallel machine comprised of a set of processor/store
pairs connected by a communications network. A data-
driven, graph reduction execution mechanism is used to
exploit the parallel hardware efficiently. \_ A
language for specifying graph reduction models of
computation is proposed, and is used to give full
specification of the Lambda Calculus reduction model.
Specifications in the language can be compiled to the
instruction set of a virtual machine. The code produced
can then be executed by a virtual machine emulator, or
could be recompiled to the order code of a physical
processor to allow the high performance simulation of
models of computation. The virtual machine is used as
the foundation for the design of a physical machine
which would support the parallel reduction of lambda
calculus expressions. \_ One of the major issues in the
design of graph reduction models of computation is the
removal of redundant parts of the expression graph.
Neither of the two standard Garbage Collection schemes:
Reference Count, or Mark-Scan is entirely suitable for
a distributed machine, mainly because of the
synchronisation they require. A modified Reference
Garbage Collection scheme is described which removes
the need for synchronisation, and enhances some of the
attractive properties of Reference Count Garbage
Collection.",
}
@TechReport{Vestal87,
author = "Vestal",
title = "Garbage Collection: An Exercise in Distributed,
Fault-Tolerant Programming",
institution = "University of Washington",
number = "87-01-03",
year = "1987",
}
@PhdThesis{MIT/LCS/TR-402,
author = "J. Miller",
title = "{MULTI}-{SCHEME}: {A} {PARALLEL} {PROCESSING} {SYSTEM}
{BASED} {ON} {MIT} {SCHEME}",
school = "MIT Laboratory for Computer Science",
type = "Ph.{D}. Thesis",
number = "MIT/LCS/TR-402",
pages = "243",
month = sep,
year = "1987",
price = "USD 24.00",
keywords = "parallel computing, Lisp, Scheme, garbage collection,
speculative parallelism, futures, placeholders",
abstract = "MultiScheme is a fully operational
parallel-programming system based upon the Scheme
dialect of Lisp. LIke its Lisp ancestors, MultiScheme
provides a conducive environment for prototyping and
testing new linguistic structures and programming
methodologies. MultiScheme supports a diverse community
of users who have a side range of interests in parallel
programming. MultiScheme's flexible support for
system-based experiments in parallel processing has
enabled it to serve as a development vehicle for
university and industrial research. At the same time,
MultiScheme is sufficiently robust, and supports a
sufficiently wide range of parallel-processing
applications, that it has become the base for
commerical product, the Butterfly Lisp System produced
by BBN Advanced Computers, Inc.",
}
@TechReport{MIT/LCS/TR-404,
author = "E. K. Kolodner",
title = "{RECOVERY} {USING} {VIRTUAL} {MEMORY}",
institution = "MIT Laboratory for Computer Science",
number = "MIT/LCS/TR-404",
pages = "91",
month = jul,
year = "1987",
price = "USD 16.00",
keywords = "atomic actions, recovery, garbage collection, virtual
memory, persistent storage, stable storage, distributed
systems",
abstract = "Maintaining the consistency of long-lived data in the
presence of failures is important for many applications
such as airline reservation and banking systems. After
a crash, the long-lived data must be recovered for the
application to continue running. Storing the data and
later restoring it is the job of a recovery system.
This thesis presents a new recovery method with two
features: it is fast because as much as possible it
uses data already stored by an application in virtual
memory for recovery, and it is novel because it allows
data in virtual memory to be organized in a heap with
automatic garbage collection. The recovery method is
designed to be used in the Argus system, but it will
also work for other persistent storage systems.",
}
@InProceedings{TelTanLee87,
author = "Tel and Tan and van Leeuwen",
title = "The Derivation of On-the-Fly Garbage Collection
Algorithms from Distributed Termination Detection
Protocols",
booktitle = "Annual Symposium on Theoretical Aspects of Computer
Science",
year = "1987",
}
Found 38 references in 19 bibliographies.
You used 20 seconds of our CPU time.