for "garbage" and "collection" and "1991"
Search term: garbage;collection;1991
No spelling errors allowed, case-insensitive, partial words match.
Information on how to form queries.
@InProceedings{appel:macqueen:91:plilp,
author = "Andrew W. Appel and David B. MacQueen",
title = "Standard {ML} of New Jersey",
crossref = "PLILP91",
year = "1991",
pages = "1--13",
keywords = "concurrency, parsing, compiler construction, type
checking, continuation passing, modules, garbage
collection",
keywords2 = "weak polymorphism, closure conversion, Standard ML",
}
@Article{BagherzadehHengWu91,
key = "Bagherzadeh et al.",
author = "N. Bagherzadeh and S-l. Heng and C-l. Wu",
title = "A Parallel Asynchronous Garbage Collection Algorithm
for Distributed Systems",
journal = "IEEE Transactions on Knowledge and Data Engineering",
pages = "100--107",
volume = "3",
number = "1",
month = mar,
year = "1991",
location = "CMU Engineering \&{} Science Library",
}
@InCollection{Appel:GC,
title = "Garbage Collection",
author = "Andrew W. Appel",
booktitle = "Topics in Advanced Language Implementation",
editor = "Peter Lee",
pages = "89--100",
publisher = "{MIT} Press",
address = "Cambridge, Massachusetts",
year = "1991",
}
@Misc{Ba:CCCC,
author = "Henry G. {Baker, Jr.}",
title = "Cache-Conscious Copying Collection",
howpublished = "Unpublished position paper for {OOPSLA} '91 Workshop
on Garbage Collection in Object-Oriented Systems. See
\cite{WH:GC91}",
note = "Available via anonymous Internet {FTP} from
cs.utexas.edu (/pub/garbage/GC91/baker.ps)",
month = oct,
year = "1991",
}
@InProceedings{boehm:91,
author = "Hans-Juergen Boehm and Alan J. Demers and S. Shenker",
title = "Mostly parallel garbage collection",
booktitle = "Proceedings of the ACM SIGPLAN '91 Conference on
Programming Language Design and Implementation",
journal = sigplan,
volume = "26",
number = "6",
pages = "157--164",
address = "Toronto, Ontario, Canada",
month = jun,
year = "1991",
}
@InProceedings{goldberg:91b,
author = "B. Goldberg",
title = "Tag-free garbage collection for strongly typed
programming languages",
booktitle = "Proceedings of the ACM SIGPLAN '91 Conference on
Programming Language Design and Implementation",
journal = sigplan,
volume = "26",
number = "6",
pages = "165--176",
address = "Toronto, Ontario, Canada",
month = jun,
year = "1991",
}
@InProceedings{Bo:HOSSCGC,
title = "Hardware and Operating System Support for Conservative
Garbage Collection",
author = "Hans-Juergen Boehm",
booktitle = "International Workshop on Memory Management",
year = "1991",
month = oct,
address = "Palo Alto, California",
pages = "61--67",
publisher = "{IEEE} Press",
}
@Misc{BMBC:GC91panel,
author = "Hans-Juergen Boehm and Eliot Moss and Joel Bartlett
and David Chase",
title = "Panel Discussion: Conservative vs. Accurate Garbage
Collection",
howpublished = "Summary appears in \cite{WH:GC91}",
month = oct,
year = "1991",
}
@TechReport{BZ52891,
author = "Benjamin ${}^{\surd\clubsuit}$Zorn",
title = "The Effect of Garbage Collection on Cache
performance",
institution = "University of Colorado",
type = "Computer Science Technical Report",
number = "CU-CS-528-91",
address = "Campus Box 430, Boulder, CO 80309",
month = may,
year = "1991",
}
@Misc{PRWBHWs:OOPSLAGC91,
author = "${}^{\clubsuit}$Paul R. Wilson and Barry Hayes",
title = "The 1991 Workshop on Garbage Collection in
Object-Oriented Systems",
month = oct,
year = "1993",
howpublished = "Addendum to the Proceedings of OOPSLA '91, Phoenix,
AZ, 1991",
}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%
%%%% Positional Papers for 1991 OOPSLA workshop on Memory Management
%%%% and Garbage Collection
%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@Misc{AD:OOPSLAGC91,
author = "Amer ${}^{\clubsuit}$Diwan",
title = "Stack Tracing In {A} Statically Typed Language",
month = oct,
year = "1991",
howpublished = "{OOPSLA} '91 Workshop on Garbage Collection in
Object-Oriented Systems. Summary appears in
\cite{WH:GC91}",
}
@Misc{FJ:OOPSLAGC91,
author = "Frank ${}^{\clubsuit}$Jackson",
title = "Garbage Collection Bugs that {I} have known",
month = oct,
year = "1991",
howpublished = "{OOPSLA} '91 Workshop on Garbage Collection in
Object-Oriented Systems. Summary appears in
\cite{WH:GC91}",
}
@Misc{PF:OOPSLAGC91,
author = "Paulo ${}^{\clubsuit}$Ferreira",
title = "Garbage Collection in {C}++",
month = oct,
year = "1991",
howpublished = "{OOPSLA} '91 Workshop on Garbage Collection in
Object-Oriented Systems. Summary appears in
\cite{WH:GC91}",
}
@Misc{VFR:OOPSLAGC91,
author = "Vincent F. ${}^{\clubsuit}$Russo",
title = "Garbage Collecting and Object-Oriented Operating
System Kernel",
month = oct,
year = "1991",
howpublished = "{OOPSLA} '91 Workshop on Garbage Collection in
Object-Oriented Systems. Summary appears in
\cite{WH:GC91}",
}
@Misc{RAM:OOPSLAGC91,
author = "Robert A. ${}^{\clubsuit}$MacLachlan",
title = "A System Model of Memory Management",
month = oct,
year = "1991",
howpublished = "{OOPSLA} '91 Workshop on Garbage Collection in
Object-Oriented Systems. Summary appears in
\cite{WH:GC91}",
}
@Misc{UH:OOPSLAGC91,
author = "Urs ${}^{\clubsuit}$H{\"{o}}lzle",
title = "The Myth of High Object Creation Rates",
month = oct,
year = "1991",
howpublished = "{OOPSLA} '91 Workshop on Garbage Collection in
Object-Oriented Systems. Summary appears in
\cite{WH:GC91}",
}
%L Shar91a
%K olit oopsla91
%A Ravi Sharma
%A Mary Lou Soffa
%T Parallel Generational Garbage Collection
%J Proceedings OOPSLA '91, ACM SIGPLAN Notices
%V 26
%N 11
%D Nov 1991
%P 16-32
@Article{Heym91,
author = "J. Heymann",
title = "A Comprehensive Analytical Model for Garbage
Collection Algorithms",
journal = "{SIGPLAN} Notices",
volume = "26",
number = "8",
month = aug,
year = "1991",
pages = "50--59",
keywords = "Space overhead, CPU time overhead, mark and sweep,
parallel mark and sweep, parallel copy, reference
counting",
comment = "good model",
}
@PhdThesis{De:phdthesis,
author = "David L. Detlefs",
title = "Concurrent, Atomic Garbage Collection",
school = "Dept. of Computer Science, Carnegie Mellon
University",
year = "1991",
month = nov,
address = "Pittsburgh, Pennsylvania",
note = "Technical report CMU-CS-90-177",
}
@InProceedings{Kuechlin91d,
author = "Wolfgang W. K{\"u}chlin and Nicholas J. Nevin",
title = "On Multi-Threaded List-Processing and Garbage
Collection",
booktitle = "Proc. Third IEEE Symp. on Parallel and Distributed
Processing",
publisher = "IEEE Press",
address = "Dallas, TX",
month = dec,
year = "1991",
pages = "894--897",
also = "Computer and Information Science Research Center, The
Ohio State University, {OSU-CISRC-3/91-TR11}, March
1991",
}
@TechReport{GMY91-8,
author = "May G. Yip",
title = "Incremental, Generational mostly-copying collection in
uncooperative environments",
number = "91/8",
institution = "{DEC WRL}",
year = "1991",
month = jun,
abstract = "The thesis of this project is that incremental
collection can be done feasibly and efficitently in an
architecture and compiler independent manner. The
design and implementation of an incremental,
generational mostly-copying garbage collector for C++
is presented. The collector achieves, simultaneously,
real-time performance (from incremental collection),
and the ability to function without hardware and
compiler support (from mostly-copying collection). The
incremental collector runs on commercially available
uniprocessors, such as the DECStation 3100, without any
special hardware support. It uses Unix's user
controllable page protection facility (mprotect) to
synchronize between the scanner (of the collector) and
the mutator (of the application program). Its
implementation does not require any modification to the
C++ compiler. The maximum garbage collection pause is
well within the 100-millisecond limit imposed by
real-time applications executing on interactive
workstations. Compared to its non-incremental version,
the total execution time of the incremental collector
is not adversely affected.",
}
@Proceedings{OOPSLA-GC91,
title = "Workshop on Garbage Collection",
booktitle = "Workshop on Garbage Collection in Object-Oriented
Systems",
key = "{OOPSLA}",
month = oct,
year = "1991",
publisher = "{ACM} Press",
}
@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.",
}
@Article{boehm:91,
title = "Mostly Parallel Garbage Collection",
author = "Hans-Juergen Boehm and Alan J. Demers and Scott
Shenker",
journal = "SIGPLAN Notices",
year = "1991",
month = jun,
volume = "26",
number = "6",
note = "{\em Proceedings of the ACM SIGPLAN '91 Conference on
Programming Language Design and Implementation}",
pages = "157--164",
}
@Article{goldberg:91,
author = "Benjamin Goldberg",
title = "Tag-Free Garbage Collection for Strongly Typed
Programming Languages",
pages = "165--176",
journal = "SIGPLAN Notices",
year = "1991",
month = jun,
volume = "26",
number = "6",
note = "{\em Proceedings of the ACM SIGPLAN '91 Conference on
Programming Language Design and Implementation}",
}
@Article{Bagherzadeh91,
author = "N. Bagherzadeh and S. L. Heng and C. L. Wu and W. H.
Deason and D. B. Brown and K. H. Chang and J. H.
Cross",
title = "A Parallel Asynchronous Garbage Collection Algorithm
for Distributed Systems {A} Rule-Based Software Test
Data Generator",
journal = "IEEE Trans. on Knowledge and Data Eng.",
volume = "3",
number = "1",
pages = "100 108",
month = mar,
year = "1991",
keywords = "TKDE",
}
@InCollection{KuechlinNevin,
author = "W. W. K{\"u}chlin and N. J. Nevin",
title = "On Multi-Threaded List-Processing and Garbage
Collection",
pages = "894--897",
crossref = "PDP1991",
}
@InProceedings{KafWas91,
author = "D. M. Washabaugh and D. Kafura",
title = "Distributed Garbage Collection of Active Objects",
booktitle = "Proceedings of the 11th International Conference on
Distributed Computing Systems (ICDCS)",
pages = "369--377",
publisher = "IEEE Computer Society , Washington, DC",
address = "Arlington, TX USA",
year = "1991",
}
@InProceedings{NilsenKevi1991a,
author = "Kevin Nilsen",
booktitle = "OOPSLA Workshop on Garbage Collection in
Object-Oriented Systems",
title = "{A} high-performance architecture for real-time
garbage collection",
year = "1991",
url = "ftp://cs.utexas.edu/pub/garbage/GC91/nilsen.ps",
scope = "gc",
}
@InProceedings{Withington1991a,
author = "P. T. Withington",
booktitle = "OOPSLA Workshop on Garbage Collection in
Object-Oriented Systems",
title = "{H}ow real is ``{R}eal-time'' {GC}?",
year = "1991",
url = "ftp://cs.utexas.edu/pub/garbage/GC91/withington.ps",
scope = "gc",
}
@InProceedings{JohnsonDou1991a,
author = "Douglas Johnson",
booktitle = "OOPSLA Workshop on Garbage Collection in
Object-Oriented Systems",
title = "{C}omparing two garbage collectors",
year = "1991",
url = "ftp://cs.utexas.edu/pub/garbage/GC91/johnson.ps",
scope = "gc",
}
@InProceedings{BoehmHansJ1991a,
author = "Hans-Juergen Boehm",
booktitle = "OOPSLA Workshop on Garbage Collection in
Object-Oriented Systems",
title = "{S}imple {GC}-{S}afe {C}ompilation",
year = "1991",
url = "ftp://cs.utexas.edu/pub/garbage/GC91/boehm.ps",
scope = "gc",
}
@InProceedings{MossJEliot1991a,
author = "J. Eliot B. Moss",
booktitle = "OOPSLA Workshop on Garbage Collection in
Object-Oriented Systems",
title = "{T}he {UM}ass {L}anguage {I}ndependent {G}arbage
{C}ollector {T}oolkit",
year = "1991",
url = "ftp://cs.utexas.edu/pub/garbage/GC91/moss.ps",
scope = "gc",
}
@InProceedings{HoskingAnt1991a,
author = "Antony Hosking",
booktitle = "OOPSLA Workshop on Garbage Collection in
Object-Oriented Systems",
title = "{M}ain memory management for persistence",
year = "1991",
url = "ftp://cs.utexas.edu/pub/garbage/GC91/hosking.ps",
scope = "gc",
}
@InProceedings{HudsonRich1991a,
author = "Richard L. Hudson",
booktitle = "OOPSLA Workshop on Garbage Collection in
Object-Oriented Systems",
title = "{F}inalization in a {G}arbage {C}ollected world",
year = "1991",
url = "ftp://cs.utexas.edu/pub/garbage/GC91/hudson.ps",
scope = "gc",
}
@InProceedings{UngarDavid1991a,
author = "David Ungar and Frank Jackson",
booktitle = "OOPSLA Workshop on Garbage Collection in
Object-Oriented Systems",
title = "{O}utwitting {GC} devils: {A} hybrid incremental
garbage collector",
year = "1991",
url = "ftp://cs.utexas.edu/pub/garbage/GC91/ungar.ps",
scope = "gc",
}
@InProceedings{ChambersCr1991a,
author = "Craig Chambers",
booktitle = "OOPSLA Workshop on Garbage Collection in
Object-Oriented Systems",
title = "{C}ost of garbage collection in the {S}elf system",
year = "1991",
url = "ftp://cs.utexas.edu/pub/garbage/GC91/chambers.ps",
scope = "gc",
}
@InProceedings{DiwanAmer1991a,
author = "Amer Diwan",
booktitle = "OOPSLA Workshop on Garbage Collection in
Object-Oriented Systems",
title = "{S}tack tracing in a statically typed labguage",
year = "1991",
url = "ftp://cs.utexas.edu/pub/garbage/GC91/diwan.ps",
keywords = "tag removal from objects",
scope = "rt",
}
@TechReport{SansomPatr92b,
author = "Patrick M. Sansom",
institution = "Dept. of Computing Science, University of Glasgow",
title = "{D}ual-mode garbage collection",
year = "91",
document-size = "161.8 kbytes",
url = "ftp://ftp.dcs.gla.ac.uk/pub/glasgow-fp/authors/Patrick_Sansom/1991_dual-mode-gc_PAPER.ps.Z",
month = dec,
scope = "gc",
}
@InCollection{Hamilton91,
author = "G. W. Hamilton and S. B. Jones",
editor = "S. L. {Peyton Jones} and G. Hutton and C. K. Holst",
title = "Compile-Time Garbage Collection by Necessity
Analysis",
booktitle = "Functional Programming, Glasgow 1990",
pages = "66--70",
publisher = "Springer-Verlag",
address = "London, UK",
year = "1991",
keywords = "peyton jones",
}
@InCollection{Jones91,
author = "S. B. Jones and M. White",
editor = "S. L. {Peyton Jones} and G. Hutton and C. K. Holst",
title = "Is Compile Time Garbage Collection Worth The Effort?",
booktitle = "Functional Programming, Glasgow 1990",
pages = "172--176",
publisher = "Springer-Verlag",
address = "London, UK",
year = "1991",
keywords = "peyton jones",
}
@TechReport{Lins91,
author = "R. D. Lins and M. A. Vasques",
title = "A Comparative Study of Algorithms for Cyclic Reference
Counting",
institution = "Computing Laboratory, University of Kent",
type = "Technical Report No.",
number = "92",
address = "Canterbury, UK",
year = "1991",
keywords = "functional",
abstract = "The two most simple algorithms used for garbage
collection are Mark-Scan and reference counting. The
properties of not degrading with heap occupancy and
being performed in small steps interleaved with
computation make reference counting suitable for a
number of applications in computer science. One of the
major drawbacks of standard reference counting is its
inability to collect cyclic structures. More recently,
several algorithms have been developed to overcome this
problem. This paper presents an analysis of some of
these cyclic reference counting algorithms. We also
generalise Glaser and Thompson's Lazy Garbage
Collection algorithm to work with cyclic structures.
The performance of the Lazy and the Lazy cyclic
algorithms is also analysed.",
note = "Submitted to Software - Practice and Experience.",
}
@InProceedings{Sansom91,
author = "P. Sansom",
editor = "H. Glaser and P. H. Hartel",
title = "Dual-Mode Garbage Collection",
booktitle = "Proceedings of the Workshop on the Parallel
Implementation of Functional Languages",
pages = "283--310",
publisher = "Department of Electronics and Computer Science,
University of Southampton",
address = "Southampton, UK",
year = "1991",
note = "Technical Report CSTR 91-07.",
}
@InProceedings{Sansom92,
author = "P. Sansom",
editor = "R. Heldal and C. K. Holst and P. L. Wadler",
title = "Combining Single-Space and Two-Space Compacting
Garbage Collectors",
booktitle = "Functional Programming, Glasgow 1991: Proceedings of
the 1991 Workshop, Portree, UK",
pages = "312--323",
publisher = "Springer-Verlag",
address = "Berlin, DE",
year = "1992",
ISBN = "3-540-19760-5",
abstract = "The garbage collector presented makes use of two well
known compaction garbage collection algorithms with
very different performance characteristics: C.J.
Cheney's (1970) two-space copying collector and H.B.M.
Jonker's (1979) single-space sliding compaction
collector. The author proposes a scheme which allows
either collector to be used. The run-time memory
requirements of the program being executed are used to
determine the most appropriate collector. This enables
one to achieve a fast collector for heap requirements
less than half of the heap memory but allows the heap
utilization to increase beyond this threshold. Using
these ideas the author develops a particularly
attractive extension to A.W. Appel's (1989)
generational collector.",
}
@InProceedings{Shar91a,
author = "Ravi Sharma and Mary Lou Soffa",
title = "Parallel Generational Garbage Collection",
booktitle = "Proceedings OOPSLA '91, ACM SIGPLAN Notices",
pages = "16--32",
month = nov,
year = "1991",
keywords = "olit oopsla91",
note = "Published as Proceedings OOPSLA '91, ACM SIGPLAN
Notices, volume 26, number 11",
}
@InProceedings{gc:628,
author = "Jos\'{e} M. Piquer",
title = "Indirect Reference-Counting, a Distributed Garbage
Collection Algorithm",
volume = "505",
series = "Lecture Notes in Computer Science",
pages = "150--165",
booktitle = "PARLE'91---Parallel Architectures and Languages
Europe",
year = "1991",
publisher = "Springer-Verlag",
address = "Eindhoven (the Netherlands)",
month = jun,
}
@InProceedings{gc:rep:804,
author = "Luigi V. Mancini and Vittoria Rotella and Simonetta
Venosa",
title = "Copying Garbage Collection for Distributed Object
Stores",
pages = "218--227",
booktitle = "Proc.\ 10th Symp.\ on Reliable Distributed Systems",
year = "1991",
address = "Pisa, {(Italy)}",
month = sep,
}
@InProceedings{gc:rep:866,
author = "David Plainfoss\'{e} and Marc Shapiro",
title = "Distributed Garbage Collection in the System is Good",
crossref = "iwooos91-p",
pages = "94--99",
booktitle = "Proc.\ of the International Workshop on
Object-Orientation in Operating Systems",
year = "1991",
}
@Article{gc:rep:924,
author = "L. Mancini and S. K. Shrivastava",
title = "Fault-Tolerant Reference Counting for Garbage
Collection in Distributed Systems",
journal = "The Computer Journal",
year = "1991",
volume = "34",
number = "6",
pages = "503--513",
month = dec,
}
@TechReport{Ruda90b,
author = "Martin Rudalics",
title = "{Correctness of Distributed Garbage Collection
Algorithms}",
type = "Technical Report",
month = aug,
year = "1990",
institution = "RISC-Linz",
address = "Johannes Kepler University, Linz, Austria",
number = "90-40.0",
note = "Also: ACPC Technical Report ACPC/TR 91-5, Austrian
Center for Parallel Computation, January 1991",
owner = "pcl",
descr = "pagc",
}
@InProceedings{GCandMH,
author = "Paul R. Wilson",
title = "Some Issues and Strategies in Heap Management and
Memory Hierarchies",
booktitle = "{OOPSLA/ECOOP} '90 Workshop on Garbage Collection in
Object-Oriented Systems",
note = "Also in {\em SIGPLAN Notices 23}(1):45--52, January
1991.",
month = oct,
year = "1990",
}
@TechReport{Bober91,
author = "Paul M. Bober and Michael J. Carey",
title = "On Mixing Queries in Transactions Via Multiversion
Locking",
institution = "Computer Sciences Department",
number = "TR 1045",
address = "University of Wisconsin-Madison",
month = nov,
year = "1991",
abstract = "In this paper, we discuss a new approach to
multiversion concurrency control that allows
high-performance transaction systems to support the
on-line execution of long-running queries (e.g., for
decision support purposes). Long-running queries are
typically run at level 1 or level 2 consistency because
they introduce a high level of data contention with
two-phase locking. Multiversion algorithms have been
discussed as a way to reduce the level of data
contention and at the same time support the
serializable execution of queries. Our approach extends
the multiversion locking algorithm developed by
Computer Corporation of America by using record-level
versioning and reserving a portion of each data page
for {\it caching} prior versions that are potentially
needed for the serializable execution of queries;
on-page caching also enables an efficient approach to
{\it garbage collection} of old versions. In addition,
we introduce {\it view sharing}, which has the
potential for reducing the cost of versioning by
grouping together queries to run against the same
transaction-consistent view of the database. Finally,
we also present results from a simulation study that
compares our approach versus that of providing level 1
or level 2 consistency for queries. The results
indicate that our approach is a viable alternative to
reduced-consistency locking when the portion of each
data reserved for prior versions is chosen
appropriately.",
}
@TechReport{Ginter91,
author = "Andrew Ginter",
title = "{DESIGN} {ALTERNATIVES} {FOR} {A} {COOPERATIVE}
{GARBAGE} {COLLECTOR} {FOR} {THE} {C}++ {PROGRAMMING}
{LANGUAGE}",
institution = "University of Calgary",
number = "91/417/01",
month = jan,
year = "1991",
url = "mailto::parin@cpsc.ucalgary.ca",
abstract = "Currently, conservative garbage collectors for C++ are
the collectors which enjoy the most use. While pro-
totype cooperative collectors have been written for
C++, the language does not support either a type-safe
or a reliable cooperative collector. This report
examines design alterna- tives for adding support to
the C++ programing language for cooperative garbage
collection and discusses in detail alternatives which
provide language support for user defined cooperative
for
sup- porting user defined collectors and for supporting
per- sistent object caches, distributed object stores
and other kinds of storage managers. Further research
is needed how- ever, in the areas of type inquiry and
the coordination of multiple storage managers, before
any parameterized smart pointer proposal can be
completed. This discussion is based on experiments with
a compacting, cooperative collector in existing
implementations of C++. The changes to the language
discussed in this report have not yet been
implemented.",
}
@TechReport{Fernandez91,
author = "Mary F. Fernandez and David R. Hanson",
title = "Garbage Collection Alternatives for Icon",
institution = "Department of Computer Science, Princeton University",
number = "TR-324-91",
pages = "16",
month = may,
year = "1991",
abstract = "Copying garbage collectors are becoming the collectors
of choice for very high-level languages and for
functional and object-oriented languages. Copying
collectors are particularly efficient for large heaps
because their execution time is proportional only to
the amount of accessible data, and they identify and
compact this data in one pass. In contrast,
mark-and-sweep collectors execute in time proportional
to the heap size and require a second pass to compact
accessible data. The performance of existing systems
with old mark-and-sweep collectors might be improved by
replacing their collectors with copying collectors.
This paper explores this possibility by describing the
results of replacing the mark-and-sweep collector in
the Icon programming language with four alternative
collectors, three of which are copying collectors.
Copying collectors do indeed yield better performance,
but at a significant cost in space. Measurements
suggest that the mark-and-sweep alternative is best for
Icon programs that have 1-5MB heaps.",
}
@TechReport{Hudson91,
author = "Richard L. Hudson and J. Eliot B. Moss and Amer Diwan
and Christopher F. Weight",
title = "A Language-Independent Garbage Collector Toolkit",
institution = "University of Massachusetts",
number = "COINS TR 91-47",
month = sep,
year = "1991",
abstract = "We describe a memory management toolkit for language
implementors. It offers efficient and flexible
generation scavenging garbage collection. In addition
to providing a core of language-independent algorithms
and data structures, the toolkit includes auxiliary
components that east implementation of garbage
collection for programming languages. We have detailed
designs for Smalltalk and Modula-3 and are confident
the toolkit can be used with a wide variety of
languages. The toolkit approach is itself novel, and
our design includes a number of additional innovations
in flexibility, efficiency, accuracy, and cooperation
between the compiler and the collector.",
}
@InProceedings{HerMos91,
author = "Herlihy and Moss",
title = "Lock-Free Garbage Collection for Multiprocessors",
booktitle = "Annual ACM Symposium on Parallel Algorithms and
Architectures",
year = "1991",
}
@InProceedings{CarlssonEtAl91,
author = "Carlsson and Mattsson and Poblete and Bengtsson",
title = "A New Compacting Garbage-Collection Algorithm with a
Good Average-Case Performance",
booktitle = "Annual Symposium on Theoretical Aspects of Computer
Science",
year = "1991",
}
Found 59 references in 21 bibliographies.
You used 21 seconds of our CPU time.