Sciweavers

62 search results - page 6 / 13
» Are Fibonacci Heaps Optimal
Sort
View
LCTRTS
2005
Springer
14 years 29 days ago
Upper bound for defragmenting buddy heaps
Knuth’s buddy system is an attractive algorithm for managing storage allocation, and it can be made to operate in real-time. At some point, storage-management systems must eithe...
Delvin C. Defoe, Sharath R. Cholleti, Ron Cytron
CC
2008
Springer
172views System Software» more  CC 2008»
13 years 9 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...
BIRTHDAY
2009
Springer
14 years 2 months ago
Vertical Object Layout and Compression for Fixed Heaps
Research into embedded sensor networks has placed increased focus on the problem of developing reliable and flexible software for microcontroller-class devices. Languages such as ...
Ben Titzer, Jens Palsberg
ASPLOS
2006
ACM
13 years 9 months ago
Tradeoffs in fine-grained heap memory protection
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...
Jianli Shen, Guru Venkataramani, Milos Prvulovic
MST
2006
97views more  MST 2006»
13 years 7 months ago
Optimal Implicit Dictionaries over Unbounded Universes
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
Gianni Franceschini, Roberto Grossi