Sciweavers

45 search results - page 8 / 9
» Age-Oriented Concurrent Garbage Collection
Sort
View
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
VEE
2006
ACM
102views Virtualization» more  VEE 2006»
14 years 6 days ago
A stackless runtime environment for a Pi-calculus
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
Frédéric Peschanski, Samuel Hym
OOPSLA
2009
Springer
14 years 25 days ago
Scalable nonblocking concurrent objects for mission critical code
The high degree of complexity and autonomy of future robotic space missions, such as Mars Science Laboratory (MSL), poses serious challenges in assuring their reliability and efï¬...
Damian Dechev, Bjarne Stroustrup
IWMM
2011
Springer
254views Hardware» more  IWMM 2011»
12 years 9 months ago
Short-term memory for self-collecting mutators
We propose a new memory model called short-term memory for managing objects on the heap. In contrast to the traditional persistent memory model for heap management, objects in sho...
Martin Aigner, Andreas Haas, Christoph M. Kirsch, ...
IWMM
2004
Springer
92views Hardware» more  IWMM 2004»
13 years 11 months ago
Memory accounting without partitions
Operating systems account for memory consumption and allow for termination at the level of individual processes. As a result, if one process consumes too much memory, it can be te...
Adam Wick, Matthew Flatt