184 search results - page 3 / 37 » Making Sense of Large Heaps |
ASPLOS
2006
ACM
13 years 7 months ago
2006
ACM
Different uses of memory protection schemes have different needs in terms of granularity. For example, heap security can benefit from chunk separation (by using protected "pa...
IWMM
2007
Springer
13 years 11 months ago
2007
Springer
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
WWW
2009
ACM
14 years 5 months ago
2009
ACM
Nowadays, the increasing amount of semantic data available on the Web leads to a new stage in the potential of Semantic Web applications. However, it also introduces new issues du...
ASPLOS
2009
ACM
14 years 5 months ago
2009
ACM
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
ALGORITHMICA
2005
13 years 4 months ago
2005
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...