Results 141 to 150 of about 185,526 (197)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Garbage-first garbage collection
Proceedings of the 4th international symposium on Memory management, 2004Garbage-First is a server-style garbage collector, targeted for multi-processors with large memories, that meets a soft real-time goal with high probability, while achieving high throughput. Whole-heap operations, such as global marking, are performed concurrently with mutation, to prevent interruptions proportional to heap or live-data size ...
David Detlefs +3 more
openaire +1 more source
Proceedings of the 8th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems, 2013
It's been more than 50 years since John McCarthy invented garbage collection. The last 15 years or so have been the most exciting as garbage collection became mainstream and is now considered the norm for all/most modern programming languages. However, despite its overall success, programmers still face challenges when relying on garbage collection for
openaire +1 more source
It's been more than 50 years since John McCarthy invented garbage collection. The last 15 years or so have been the most exciting as garbage collection became mainstream and is now considered the norm for all/most modern programming languages. However, despite its overall success, programmers still face challenges when relying on garbage collection for
openaire +1 more source
Collecting hollywood's garbage
Proceedings of the 2010 international symposium on Memory management, 2010The reactive programming model is largely different to what we're used to as we don't have full control over the application's control flow. If we mix the declarative and imperative programming style, which is usual in the ML family of languages, the situation is even more complex. It becomes easy to introduce patterns where the usual garbage collector
Tomas Petricek, Don Syme
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
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
2019
We present a method that allows to bound the sizes of intermediate trees in a composition of macro tree transducers. Macro tree transducers are a powerful model of tree translation which, for instance, includes all attribute grammars (seen as tree-to-tree translators).
openaire +1 more source
We present a method that allows to bound the sizes of intermediate trees in a composition of macro tree transducers. Macro tree transducers are a powerful model of tree translation which, for instance, includes all attribute grammars (seen as tree-to-tree translators).
openaire +1 more source
Contaminated Garbage Collection
2003We describe a new method for determining when an object can be garbage collected. The method does not require marking live objects. Instead, each object X is dynamically associated with a stack frame M, such that X is collectable when M pops. Because X could have been dead earlier, our method is conservative.
openaire +2 more sources