for "garbage" and "collection" and "1985"
Search term: garbage;collection;1985
No spelling errors allowed, case-insensitive, partial words match.
Information on how to form queries.
@InProceedings{HSMMieeepp85,
author = "Heonshik Shin and Miroslaw Malek",
title = "Parallel Garbage Collection with Associative Tag",
booktitle = "Proc. {IEEE} conf. Parallel Processing",
year = "1985",
pages = "369--375",
}
@TechReport{Ro:CedarGC,
author = "Paul Rovner",
title = "On Adding Garbage Collection and Runtime Types to a
Strongly-Typed, Statically Checked, Concurrent
Language",
institution = "Xerox Palo Alto Research Center",
year = "1985",
type = "Technical Report",
address = "Palo Alto, California",
month = jul,
number = "CSL-84-7",
}
@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.",
}
@Book{Jouannaud85,
editor = "J. P. Jouannaud",
title = "Functional Programming Languages and Computer
Architecture",
series = "LNCS",
volume = "201",
publisher = "Springer Verlag",
month = sep,
year = "1985",
keywords = "FP, fpca, fplca, fplca85, fpca85",
abstract = "D. A. Turner Miranda: non-strict functional language
with polymorphic types M. L. Welcome, S. K.
Skedzielewski. Dataflow optimization in IF1 C. Clack,
S. L. Peyton Jones. Strictness analysis - a practical
approach G. Cousineau, P. L. Curien, M. Mauny. The
categorical abstract machine P. Bellot. High order
programming in extended FP S. Abramsky, R. Sykes.
Secd-m: virtual machine for applicative programming M.
J. Shute, P. E. Osmon, C. L. Hankin. Cobweb: combinator
reduction arch' P. Wadler. How to replace failure by a
list of success J. Hughes. Lazy memo functions D. A.
Plaisted. An architecture for fast data movement in the
FFP machine J. T. O'Donell An architecture that
efficiently updates associative aggregates in
applicative programming languages T. Johnsson. Lambda
lifting : transforming programs to recursive equations
S. K. Debray. Optimizing almost tail recursive prolog
programs M. Sheeran. Designing regular array
architectures using higher order functions M.
Ercegovac, M. Schlag, D. Patel. vFP : an environment
for the multi level specification, analysis and
synthesis of hardware algorithms J. Hughes A
distributed garbage collection algorithm D. R.
Brownbridge Cyclic reference counting for combinator
machines D. S. Wise. Design for a multiprocessing heap
with on-board reference counting M. F. Young. A
functional language and modular architecture for
scientific computing R. S. Nikhil. Practical
polymorphism P. Dybjer Program verification in a
logical theory of constructions V. J. Bush, J. R. Gurd.
Transforming recursive programs for execution on
parallel machines (single and double recursive schemes,
dynamic, FP) L. Augustsson. Compiling pattern matching
B. Goldberg. P. Hudak. Serial combinators : optimal
grains of parallelism R. B. Kieburtz. The G Machine : a
fast graph-reduction evaluator",
}
@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",
}
@Article{Halstead85,
author = "R. H. Halstead",
title = "Multilisp: {A} Language for Concurrent Symbolic
Computation",
journal = "ACM Transactions on Programming Languages and
Systems",
volume = "7",
number = "4",
pages = "501--538",
year = "1985",
keywords = "functional parallel",
abstract = "Multilisp is a version of the Lisp dialect Scheme
extended with constructs for parallel execution. Like
Scheme, Multilisp is oriented toward symbolic
computation. Unlike some parallel programming
languages, Multilisp incorporates constructs for
causing side effects and for explicitly introducing
parallelism. The potential complexity of dealing with
side effects in a parallel context is mitigated by the
nature of the parallelism constructs and by support for
abstract data types: a recommended Multilisp
programming style is presented which, if followed,
should lead to highly parallel, easily understandable
programs. Multilisp is being implemented on the 32
processor Concert multiprocessor; however, it is
ultimately intended for use on larger multiprocessors.
The current implementation, called Concert Multilisp,
is complete enough to run the Multilisp compiler itself
and has been run on Concert prototypes including up to
eight processors. Concert Multilisp uses novel
techniques for task scheduling and garbage collection.
The task scheduler helps control excessive resource
utilization by means of an unfair scheduling policy;
the garbage collector uses a multiprocessor algorithm
based on the incremental garbage collector of Baker.",
}
@InCollection{Hughes85,
author = "R. J. M. Hughes",
editor = "J.-P. Jouannaud",
title = "A Distributed Garbage Collection Algorithm",
booktitle = "Functional Programming Languages and Computer
Architecture",
pages = "256--272",
publisher = "Springer-Verlag",
address = "Berlin, DE",
year = "1985",
keywords = "functional Nancy Symposium parallel",
ISBN = "3-540-15975-4",
abstract = "Each processor is able to garbage collect its local
memory independently of the rest of the system, and
each local garbage collection contributes a little to
global garbage collection.",
note = "Lecture Notes in Computer Science 201Proceedings of.
Conference at Nancy.",
}
@InCollection{Hughes85a,
author = "R. J. M. Hughes",
editor = "J.-P. Jouannaud",
title = "A Distributed Garbage Collector Algorithm",
booktitle = "Functional Programming Languages and Computer
Architecture",
pages = "256--272",
publisher = "Springer-Verlag",
address = "Berlin, DE",
year = "1985",
keywords = "parallel",
ISBN = "3-540-15975-4",
note = "Lecture Notes in Computer Science 201Proceedings of.
Conference at Nancy.",
}
@InProceedings{gc:rep:685,
author = "John Hughes",
title = "A Distributed Garbage Collection Algorithm",
editor = "Jean-Pierre Jouannaud",
number = "201",
series = "Lecture Notes in Computer Science",
pages = "256--272",
booktitle = "Functional Languages and Computer Architectures",
year = "1985",
publisher = "Springer-Verlag",
address = "Nancy (France)",
month = sep,
}
@Article{ShMa85,
author = "Heonshik Shin and Miroslaw Malek",
title = "{Parrallel Garbage Collection with Associative Tag}",
journal = "{IEEE Computer}",
pages = "369--375",
year = "1985",
owner = "pcl",
}
@InProceedings{RaPa85,
author = "Ashwin Ram and Janak H. Patel",
title = "{Parallel Garbage Collection Without Synchronization
Overhead}",
booktitle = "{Proceedings of the 12th International Symposium on
Computer Architecture}",
series = "ACM SIGARCH Newsletter, Vol. 13, No. 3",
address = "Boston, Massachusetts",
month = jun,
year = "1985",
pages = "84--90",
owner = "pcl",
}
@InProceedings{Beva85,
author = "D. I. Bevan",
title = "{Distributed Garbage Collection Using Reference
Counting}",
booktitle = "{Functional Programming Languages and Computer
Architecture}",
editor = "Jean-Pierre Jouannaud",
address = "Nancy, France, September 16--19",
year = "1985",
pages = "176--187",
series = "Lecture Notes in Computer Science",
volume = "201",
publisher = "Springer, Berlin",
owner = "pcl",
descr = "pagc",
}
Found 12 references in 7 bibliographies.
You used 19 seconds of our CPU time.