Sciweavers

55 search results - page 7 / 11
» Lock-Free Parallel Garbage Collection
Sort
View
IPPS
2007
IEEE
14 years 4 months ago
Mobility of Data in Distributed Hybrid Computing Systems
In distributed hybrid computing systems, traditional sequential processors are loosely coupled with reconfigurable hardware for optimal performance. This loose coupling proves to...
Philippe Faes, Mark Christiaens, Dirk Stroobandt
CONCUR
2009
Springer
14 years 4 months ago
Perspectives on Transactional Memory
Abstract. We examine the role of transactional memory from two perspectives: that of a programming language with atomic actions and that of implementations of the language. We argu...
Martín Abadi, Tim Harris
SAC
2008
ACM
13 years 9 months ago
A self-balancing striping scheme for NAND-flash storage systems
To use multiple memory banks in parallel is a nature approach to boost the performance of flash-memory storage systems. However, realistic data-access localities unevenly load eac...
Yu-Bin Chang, Li-Pin Chang
VEE
2005
ACM
218views Virtualization» more  VEE 2005»
14 years 3 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
IPPS
2007
IEEE
14 years 4 months ago
Task-pushing: a Scalable Parallel GC Marking Algorithm without Synchronization Operations
This paper describes a scalable parallel marking technique for garbage collection that does not employ any synchronization operation. To achieve good scalability, two major design...
Ming Wu, Xiao-Feng Li