Sciweavers

30 search results - page 6 / 6
» Colimits for Concurrent Collectors
Sort
View
JAVA
2001
Springer
13 years 9 months ago
Sapphire: copying GC without stopping the world
Many concurrent garbage collection (GC) algorithms have been devised, but few have been implemented and evaluated, particularly for the Java programming language. Sapphire is an a...
Richard L. Hudson, J. Eliot B. Moss
CORR
2011
Springer
181views Education» more  CORR 2011»
12 years 9 months ago
Garbage Collection for Multicore NUMA Machines
Modern high-end machines feature multiple processor packages, each of which contains multiple independent cores and integrated memory controllers connected directly to dedicated p...
Sven Auhagen, Lars Bergstrom, Matthew Fluet, John ...
COORDINATION
2009
Springer
14 years 5 months ago
High-Performance Transactional Event Processing
This paper presents a transactional framework for low-latency, high-performance, concurrent event processing in Java. At the heart of our framework lies Reflexes, a restricted prog...
Antonio Cunei, Rachid Guerraoui, Jesper Honig Spri...
APLAS
2010
ACM
13 years 3 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander
VEE
2005
ACM
218views Virtualization» more  VEE 2005»
13 years 11 months ago
The pauseless GC algorithm
Modern transactional response-time sensitive applications have run into practical limits on the size of garbage collected heaps. The heap can only grow until GC pauses exceed the ...
Cliff Click, Gil Tene, Michael Wolf