86 search results - page 9 / 18 » Automatic memory reclamation for lock-free data structures |
MICRO
2009
IEEE
14 years 2 months ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
ICA3PP
2009
Springer
14 years 2 days ago
2009
Springer
In-memory data sharing for grids allow location-transparent access to data stored in volatile memory. Existing Grid middlewares typ- ically support only explicit data transfer betw...
IWMM
2000
Springer
13 years 11 months ago
2000
Springer
This paper explains a technique that integrates conservative garbage collection on top of general memory allocators. This is possible by using two data structures named malloc-tab...
CGO
2008
IEEE
14 years 1 months ago
2008
IEEE
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...
EUROPDS
1997
13 years 8 months ago
1997
In this paper, we follow a new path to arrive at the idea of a COMA — a Cache Only Memory Architecture. We show how the evolution of another architecture (ADARC) leads quite nat...