Sciweavers

14 search results - page 2 / 3
» Wait-Free Reference Counting and Memory Management
Sort
View
CC
2007
Springer
139views System Software» more  CC 2007»
13 years 11 months ago
Using Prefetching to Improve Reference-Counting Garbage Collectors
Reference counting is a classical garbage collection method. Recently, a series of papers have extended the basic method to drastically reduce its notorious overhead and extend the...
Harel Paz, Erez Petrank
POPL
2009
ACM
13 years 12 months ago
Declarative aspects of memory management in the concurrent collections parallel programming model
Concurrent Collections (CnC)[8] is a declarative parallel language that allows the application developer to express their parallel application as a collection of high-level comput...
Zoran Budimlic, Aparna Chandramowlishwaran, Kathle...
IWMM
2004
Springer
122views Hardware» more  IWMM 2004»
13 years 10 months ago
Experience with safe manual memory-management in cyclone
The goal of the Cyclone project is to investigate type safety for low-level languages such as C. Our hardest challenge has been providing programmers control over memory managemen...
Michael W. Hicks, J. Gregory Morrisett, Dan Grossm...
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 3 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
ICS
2004
Tsinghua U.
13 years 10 months ago
Inter-reference gap distribution replacement: an improved replacement algorithm for set-associative caches
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
Masamichi Takagi, Kei Hiraki