Results 241 to 250 of about 186,596 (292)
Some of the next articles are maybe not open access.
Garbage collecting the Internet
ACM Computing Surveys, 1998Internet programming languages such as Java present new challenges to garbage-collection design. The spectrum of garbage-collection schema for linked structures distributed over a network are reviewed here. Distributed garbage collectors are classified first because they evolved from single-address-space collectors. This taxonomy is used as a framework
Saleh E. Abdullahi, Graem A. Ringwood
openaire +1 more source
The Journal of Supercomputing, 1989
Garbage collection can be done in vector mode on supercomputers like the CRAY-2 and the Cyber 205. Both copying collection and mark-and-sweep can be expressed as breadth-first searches in which the “queue” can be processed in parallel. We have designed a copying garbage collector whose inner loop works entirely in vector mode.
Andrew W. Appel, Aage Bendiksen
openaire +1 more source
Garbage collection can be done in vector mode on supercomputers like the CRAY-2 and the Cyber 205. Both copying collection and mark-and-sweep can be expressed as breadth-first searches in which the “queue” can be processed in parallel. We have designed a copying garbage collector whose inner loop works entirely in vector mode.
Andrew W. Appel, Aage Bendiksen
openaire +1 more source
Garbage collection in LINDACAP
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services, 2009LINDACAP provides a capability-based coordination for open distributed systems. As open systems are persistent, garbage collection (GC) can be a vital aspect in managing the systems' resources. Garbage collection has been proposed for the standard Linda to garbage collect tuple-spaces, but not selected tuples (data) within.
Nur Izura Udzir +2 more
openaire +1 more source
Software: Practice and Experience, 1987
AbstractThis paper describes a variation on the reference count method of garbage collection which can be particularly effective for the implemention of modern, truly functional languages. This method gives a high degree of control over the collection process and an increase in efficiency for many systems, particularly those with small, fast memories ...
Glaser, H., Thompson, P.
openaire +1 more source
AbstractThis paper describes a variation on the reference count method of garbage collection which can be particularly effective for the implemention of modern, truly functional languages. This method gives a high degree of control over the collection process and an increase in efficiency for many systems, particularly those with small, fast memories ...
Glaser, H., Thompson, P.
openaire +1 more source
Collections and garbage collection
2005We present here a data parallel dialect of lisp, Plural EuLisp, which is a relatively low-level abstract model of massively parallel processing. It is not as rich as languages like Connection Machine Lisp and Paralation Lisp but encompasses ideas integral to at least Paralation Lisp.
Simon C. Merrall, Julian A. Padget
openaire +1 more source
Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92, 1992
Distributed symbolic computations involve the existence of remote references allowing an object, local to a processor, to designate another object located on another processor. To reclaim inaccessible objects is the non trivial task of a distributed Garbage Collector (GC).
Bernard Lang +2 more
openaire +1 more source
Distributed symbolic computations involve the existence of remote references allowing an object, local to a processor, to designate another object located on another processor. To reclaim inaccessible objects is the non trivial task of a distributed Garbage Collector (GC).
Bernard Lang +2 more
openaire +1 more source
Garbage collection in multischeme
1990On stock hardware, our garbage collector commonly takes under 4% of a system's time and less than 0.2 seconds at each occurrence. It provides an unsurpassed mechanism for reclaiming memory and processing resources in a parallel system. Furthermore, the elementary algorithm is easily extended to a parallel implementation that achieves significant ...
James S. Miller, Barbara S. Epstein
openaire +1 more source
Proceedings of the 1994 ACM conference on LISP and functional programming - LFP '94, 1994
We present a method, adapted to polymorphically typed functional languages, to detect and collect more garbage than existing GCs. It can be applied to strict or lazy higher order languages and to several garbage collection schemes. Our GC exploits the information on utility of arguments provided by polymorphic types of functions.
openaire +1 more source
We present a method, adapted to polymorphically typed functional languages, to detect and collect more garbage than existing GCs. It can be applied to strict or lazy higher order languages and to several garbage collection schemes. Our GC exploits the information on utility of arguments provided by polymorphic types of functions.
openaire +1 more source
Thermodynamics and garbage collection
ACM SIGPLAN Notices, 1994We discuss the principles of statistical thermodynamics and their application to storage management problems. We point out problems which result from impercise usage of the terms information, state, reversible, conservative , etc.
openaire +1 more source
Opportunistic garbage collection
ACM SIGPLAN Notices, 1988Opportunistic garbage collection is a non-incremental generation-based garbage collection system. It attempts to minimize the probability of disruptive pauses by careful scheduling of scavenges. Scavenge pauses are hidden in pauses created by the running program or by the user; they are also shortened by scheduling them at low ...
openaire +1 more source