Sciweavers

12 search results - page 2 / 3
» The transactional memory garbage collection analogy
Sort
View
IWMM
1998
Springer
115views Hardware» more  IWMM 1998»
13 years 11 months ago
One-Bit Counts between Unique and Sticky
Stoye's one-bit reference tagging scheme can be extended to local counts of two or more via two strategies. The first, suited to pure register transactions, is a cache of ref...
David J. Roth, David S. Wise
ASPLOS
2011
ACM
12 years 10 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
VLDB
1993
ACM
107views Database» more  VLDB 1993»
13 years 11 months ago
Recovering from Main-Memory Lapses
Recovery activities, like logging, checkpointing and restart, are used to restore a database to a consistent state after a system crash has occurred. Recovery related overhead is ...
H. V. Jagadish, Abraham Silberschatz, S. Sudarshan
OOPSLA
2009
Springer
14 years 1 months 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
2009
Springer
152views Hardware» more  IWMM 2009»
14 years 1 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt